./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 883ae562acbdc0ddaf57b9acda91c94407da87efc745325e9971c16b2e3730c3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:39:27,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:39:27,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:39:27,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:39:27,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:39:27,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:39:27,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:39:27,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:39:27,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:39:27,505 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:39:27,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:39:27,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:39:27,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:39:27,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:39:27,509 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:39:27,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:39:27,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:39:27,510 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:39:27,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:39:27,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:39:27,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:39:27,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:39:27,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:39:27,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:39:27,516 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:39:27,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:39:27,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:39:27,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:39:27,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:39:27,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:39:27,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:39:27,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:39:27,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:39:27,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:39:27,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:39:27,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:39:27,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:39:27,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:39:27,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:39:27,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:39:27,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:39:27,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:39:27,521 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 883ae562acbdc0ddaf57b9acda91c94407da87efc745325e9971c16b2e3730c3 [2024-10-11 03:39:27,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:39:27,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:39:27,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:39:27,845 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:39:27,845 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:39:27,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-11 03:39:29,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:39:29,471 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:39:29,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-11 03:39:29,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6fa51eef0/5fff11bc2ac24cfdb45cb579718a44a4/FLAG68b6359a7 [2024-10-11 03:39:29,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6fa51eef0/5fff11bc2ac24cfdb45cb579718a44a4 [2024-10-11 03:39:29,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:39:29,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:39:29,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:39:29,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:39:29,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:39:29,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:39:29" (1/1) ... [2024-10-11 03:39:29,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e46a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:29, skipping insertion in model container [2024-10-11 03:39:29,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:39:29" (1/1) ... [2024-10-11 03:39:29,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:39:29,807 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7165,7178] [2024-10-11 03:39:29,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:39:29,877 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:39:29,924 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7165,7178] [2024-10-11 03:39:29,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:39:29,980 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:39:29,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:29 WrapperNode [2024-10-11 03:39:29,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:39:29,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:39:29,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:39:29,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:39:29,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:29" (1/1) ... [2024-10-11 03:39:29,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:29" (1/1) ... [2024-10-11 03:39:30,038 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 605 [2024-10-11 03:39:30,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:39:30,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:39:30,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:39:30,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:39:30,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:29" (1/1) ... [2024-10-11 03:39:30,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:29" (1/1) ... [2024-10-11 03:39:30,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:29" (1/1) ... [2024-10-11 03:39:30,073 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:39:30,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:29" (1/1) ... [2024-10-11 03:39:30,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:29" (1/1) ... [2024-10-11 03:39:30,086 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:29" (1/1) ... [2024-10-11 03:39:30,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:29" (1/1) ... [2024-10-11 03:39:30,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:29" (1/1) ... [2024-10-11 03:39:30,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:29" (1/1) ... [2024-10-11 03:39:30,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:39:30,106 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:39:30,106 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:39:30,106 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:39:30,107 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:29" (1/1) ... [2024-10-11 03:39:30,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:39:30,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:39:30,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:39:30,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:39:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:39:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:39:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:39:30,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:39:30,327 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:39:30,333 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:39:30,901 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-10-11 03:39:30,901 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:39:30,942 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:39:30,942 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:39:30,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:39:30 BoogieIcfgContainer [2024-10-11 03:39:30,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:39:30,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:39:30,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:39:30,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:39:30,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:39:29" (1/3) ... [2024-10-11 03:39:30,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1278e300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:39:30, skipping insertion in model container [2024-10-11 03:39:30,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:39:29" (2/3) ... [2024-10-11 03:39:30,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1278e300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:39:30, skipping insertion in model container [2024-10-11 03:39:30,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:39:30" (3/3) ... [2024-10-11 03:39:30,951 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-11 03:39:30,962 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:39:30,963 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:39:31,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:39:31,046 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e39899b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:39:31,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:39:31,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7202797202797202) internal successors, (246), 144 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 03:39:31,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:31,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:31,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:31,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:31,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1045916224, now seen corresponding path program 1 times [2024-10-11 03:39:31,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:31,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056940381] [2024-10-11 03:39:31,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:31,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:31,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:31,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056940381] [2024-10-11 03:39:31,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056940381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:31,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:31,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:39:31,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31410680] [2024-10-11 03:39:31,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:31,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:39:31,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:31,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:39:31,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:39:31,689 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7202797202797202) internal successors, (246), 144 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:31,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:31,901 INFO L93 Difference]: Finished difference Result 461 states and 749 transitions. [2024-10-11 03:39:31,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:39:31,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-10-11 03:39:31,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:31,915 INFO L225 Difference]: With dead ends: 461 [2024-10-11 03:39:31,915 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 03:39:31,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:39:31,920 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 821 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:31,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 843 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:39:31,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 03:39:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 230. [2024-10-11 03:39:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.5109170305676856) internal successors, (346), 229 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 346 transitions. [2024-10-11 03:39:31,972 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 346 transitions. Word has length 47 [2024-10-11 03:39:31,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:31,972 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 346 transitions. [2024-10-11 03:39:31,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:31,973 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 346 transitions. [2024-10-11 03:39:31,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:39:31,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:31,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:31,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:39:31,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:31,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:31,976 INFO L85 PathProgramCache]: Analyzing trace with hash -375563424, now seen corresponding path program 1 times [2024-10-11 03:39:31,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:31,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539659206] [2024-10-11 03:39:31,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:31,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:32,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:32,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539659206] [2024-10-11 03:39:32,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539659206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:32,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:32,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:39:32,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294618265] [2024-10-11 03:39:32,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:32,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:39:32,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:32,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:39:32,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:32,172 INFO L87 Difference]: Start difference. First operand 230 states and 346 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:32,210 INFO L93 Difference]: Finished difference Result 568 states and 874 transitions. [2024-10-11 03:39:32,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:39:32,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 03:39:32,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:32,213 INFO L225 Difference]: With dead ends: 568 [2024-10-11 03:39:32,213 INFO L226 Difference]: Without dead ends: 400 [2024-10-11 03:39:32,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:32,219 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 143 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:32,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 390 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:39:32,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-10-11 03:39:32,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 398. [2024-10-11 03:39:32,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 1.513853904282116) internal successors, (601), 397 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 601 transitions. [2024-10-11 03:39:32,238 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 601 transitions. Word has length 50 [2024-10-11 03:39:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:32,239 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 601 transitions. [2024-10-11 03:39:32,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 601 transitions. [2024-10-11 03:39:32,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:39:32,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:32,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:32,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:39:32,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:32,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:32,242 INFO L85 PathProgramCache]: Analyzing trace with hash -44113567, now seen corresponding path program 1 times [2024-10-11 03:39:32,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:32,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316601736] [2024-10-11 03:39:32,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:32,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:32,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:32,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316601736] [2024-10-11 03:39:32,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316601736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:32,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:32,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:39:32,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237371191] [2024-10-11 03:39:32,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:32,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:39:32,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:32,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:39:32,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:32,345 INFO L87 Difference]: Start difference. First operand 398 states and 601 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:32,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:32,377 INFO L93 Difference]: Finished difference Result 978 states and 1497 transitions. [2024-10-11 03:39:32,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:39:32,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 03:39:32,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:32,380 INFO L225 Difference]: With dead ends: 978 [2024-10-11 03:39:32,381 INFO L226 Difference]: Without dead ends: 690 [2024-10-11 03:39:32,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:32,384 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 130 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:32,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 390 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:39:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-10-11 03:39:32,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2024-10-11 03:39:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 1.5036390101892285) internal successors, (1033), 687 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1033 transitions. [2024-10-11 03:39:32,418 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1033 transitions. Word has length 50 [2024-10-11 03:39:32,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:32,419 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1033 transitions. [2024-10-11 03:39:32,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1033 transitions. [2024-10-11 03:39:32,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:39:32,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:32,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:32,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:39:32,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:32,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1648416127, now seen corresponding path program 1 times [2024-10-11 03:39:32,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:32,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671435123] [2024-10-11 03:39:32,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:32,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:32,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:32,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671435123] [2024-10-11 03:39:32,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671435123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:32,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:32,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:39:32,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879047810] [2024-10-11 03:39:32,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:32,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:39:32,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:32,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:39:32,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:32,518 INFO L87 Difference]: Start difference. First operand 688 states and 1033 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:32,565 INFO L93 Difference]: Finished difference Result 1810 states and 2728 transitions. [2024-10-11 03:39:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:39:32,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 03:39:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:32,571 INFO L225 Difference]: With dead ends: 1810 [2024-10-11 03:39:32,572 INFO L226 Difference]: Without dead ends: 1208 [2024-10-11 03:39:32,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:32,576 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 139 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:32,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 398 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:39:32,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2024-10-11 03:39:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1206. [2024-10-11 03:39:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1205 states have (on average 1.467219917012448) internal successors, (1768), 1205 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1768 transitions. [2024-10-11 03:39:32,605 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1768 transitions. Word has length 50 [2024-10-11 03:39:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:32,605 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1768 transitions. [2024-10-11 03:39:32,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:32,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1768 transitions. [2024-10-11 03:39:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:39:32,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:32,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:32,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:39:32,611 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:32,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:32,612 INFO L85 PathProgramCache]: Analyzing trace with hash 123430489, now seen corresponding path program 1 times [2024-10-11 03:39:32,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:32,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999691730] [2024-10-11 03:39:32,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:32,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:32,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:32,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999691730] [2024-10-11 03:39:32,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999691730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:32,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:32,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:39:32,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223079042] [2024-10-11 03:39:32,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:32,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:39:32,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:32,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:39:32,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:39:32,795 INFO L87 Difference]: Start difference. First operand 1206 states and 1768 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:32,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:32,909 INFO L93 Difference]: Finished difference Result 2346 states and 3505 transitions. [2024-10-11 03:39:32,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:39:32,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-11 03:39:32,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:32,919 INFO L225 Difference]: With dead ends: 2346 [2024-10-11 03:39:32,920 INFO L226 Difference]: Without dead ends: 2000 [2024-10-11 03:39:32,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:39:32,922 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 562 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:32,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 892 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:39:32,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2024-10-11 03:39:32,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1610. [2024-10-11 03:39:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1609 states have (on average 1.4748290863890616) internal successors, (2373), 1609 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:32,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2373 transitions. [2024-10-11 03:39:32,971 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2373 transitions. Word has length 51 [2024-10-11 03:39:32,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:32,973 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2373 transitions. [2024-10-11 03:39:32,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:32,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2373 transitions. [2024-10-11 03:39:32,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:39:32,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:32,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:32,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:39:32,976 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:32,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:32,977 INFO L85 PathProgramCache]: Analyzing trace with hash -42268309, now seen corresponding path program 1 times [2024-10-11 03:39:32,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:32,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375278116] [2024-10-11 03:39:32,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:32,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:33,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:33,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375278116] [2024-10-11 03:39:33,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375278116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:33,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:33,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:39:33,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357627110] [2024-10-11 03:39:33,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:33,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:39:33,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:33,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:39:33,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:39:33,114 INFO L87 Difference]: Start difference. First operand 1610 states and 2373 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:33,215 INFO L93 Difference]: Finished difference Result 2720 states and 4065 transitions. [2024-10-11 03:39:33,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:39:33,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-11 03:39:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:33,226 INFO L225 Difference]: With dead ends: 2720 [2024-10-11 03:39:33,226 INFO L226 Difference]: Without dead ends: 2374 [2024-10-11 03:39:33,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:39:33,228 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 566 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:33,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 926 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:39:33,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2024-10-11 03:39:33,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 1920. [2024-10-11 03:39:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1920 states, 1919 states have (on average 1.4804585721730068) internal successors, (2841), 1919 states have internal predecessors, (2841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:33,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2841 transitions. [2024-10-11 03:39:33,283 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2841 transitions. Word has length 51 [2024-10-11 03:39:33,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:33,284 INFO L471 AbstractCegarLoop]: Abstraction has 1920 states and 2841 transitions. [2024-10-11 03:39:33,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:33,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2841 transitions. [2024-10-11 03:39:33,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:39:33,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:33,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:33,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:39:33,286 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:33,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:33,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2011229715, now seen corresponding path program 1 times [2024-10-11 03:39:33,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:33,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067948181] [2024-10-11 03:39:33,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:33,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:33,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:33,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:33,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067948181] [2024-10-11 03:39:33,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067948181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:33,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:33,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:39:33,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499010564] [2024-10-11 03:39:33,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:33,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:39:33,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:33,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:39:33,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:39:33,477 INFO L87 Difference]: Start difference. First operand 1920 states and 2841 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:33,578 INFO L93 Difference]: Finished difference Result 3134 states and 4686 transitions. [2024-10-11 03:39:33,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:39:33,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-11 03:39:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:33,588 INFO L225 Difference]: With dead ends: 3134 [2024-10-11 03:39:33,588 INFO L226 Difference]: Without dead ends: 2788 [2024-10-11 03:39:33,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:39:33,593 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 570 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:33,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1001 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:39:33,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2024-10-11 03:39:33,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2215. [2024-10-11 03:39:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 2214 states have (on average 1.485546522131888) internal successors, (3289), 2214 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 3289 transitions. [2024-10-11 03:39:33,647 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 3289 transitions. Word has length 52 [2024-10-11 03:39:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:33,648 INFO L471 AbstractCegarLoop]: Abstraction has 2215 states and 3289 transitions. [2024-10-11 03:39:33,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 3289 transitions. [2024-10-11 03:39:33,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 03:39:33,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:33,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:33,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:39:33,652 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:33,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:33,652 INFO L85 PathProgramCache]: Analyzing trace with hash 817234416, now seen corresponding path program 1 times [2024-10-11 03:39:33,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:33,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293778752] [2024-10-11 03:39:33,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:33,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:33,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:33,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:33,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293778752] [2024-10-11 03:39:33,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293778752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:33,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:33,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:39:33,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672007774] [2024-10-11 03:39:33,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:33,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:39:33,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:33,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:39:33,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:39:33,756 INFO L87 Difference]: Start difference. First operand 2215 states and 3289 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:33,939 INFO L93 Difference]: Finished difference Result 5193 states and 7715 transitions. [2024-10-11 03:39:33,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:39:33,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-11 03:39:33,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:33,949 INFO L225 Difference]: With dead ends: 5193 [2024-10-11 03:39:33,949 INFO L226 Difference]: Without dead ends: 3054 [2024-10-11 03:39:33,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:39:33,953 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 774 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:33,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 211 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:39:33,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2024-10-11 03:39:33,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 3036. [2024-10-11 03:39:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3035 states have (on average 1.4721581548599671) internal successors, (4468), 3035 states have internal predecessors, (4468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:34,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 4468 transitions. [2024-10-11 03:39:34,011 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 4468 transitions. Word has length 55 [2024-10-11 03:39:34,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:34,011 INFO L471 AbstractCegarLoop]: Abstraction has 3036 states and 4468 transitions. [2024-10-11 03:39:34,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:34,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 4468 transitions. [2024-10-11 03:39:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 03:39:34,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:34,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:34,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:39:34,013 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:34,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:34,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1475033810, now seen corresponding path program 1 times [2024-10-11 03:39:34,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:34,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157469347] [2024-10-11 03:39:34,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:34,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:34,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:34,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:34,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157469347] [2024-10-11 03:39:34,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157469347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:34,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:34,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:39:34,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125157225] [2024-10-11 03:39:34,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:34,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:39:34,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:34,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:39:34,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:39:34,147 INFO L87 Difference]: Start difference. First operand 3036 states and 4468 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:34,351 INFO L93 Difference]: Finished difference Result 7095 states and 10424 transitions. [2024-10-11 03:39:34,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:39:34,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-11 03:39:34,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:34,366 INFO L225 Difference]: With dead ends: 7095 [2024-10-11 03:39:34,367 INFO L226 Difference]: Without dead ends: 4144 [2024-10-11 03:39:34,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:39:34,374 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 806 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:34,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 199 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:39:34,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4144 states. [2024-10-11 03:39:34,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4144 to 3036. [2024-10-11 03:39:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3035 states have (on average 1.4556836902800658) internal successors, (4418), 3035 states have internal predecessors, (4418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 4418 transitions. [2024-10-11 03:39:34,444 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 4418 transitions. Word has length 56 [2024-10-11 03:39:34,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:34,444 INFO L471 AbstractCegarLoop]: Abstraction has 3036 states and 4418 transitions. [2024-10-11 03:39:34,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:34,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 4418 transitions. [2024-10-11 03:39:34,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 03:39:34,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:34,446 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:34,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:39:34,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:34,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:34,447 INFO L85 PathProgramCache]: Analyzing trace with hash 235925500, now seen corresponding path program 1 times [2024-10-11 03:39:34,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:34,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297486690] [2024-10-11 03:39:34,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:34,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:34,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:34,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297486690] [2024-10-11 03:39:34,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297486690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:34,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:34,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:39:34,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098151370] [2024-10-11 03:39:34,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:34,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:39:34,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:34,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:39:34,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:39:34,548 INFO L87 Difference]: Start difference. First operand 3036 states and 4418 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:34,730 INFO L93 Difference]: Finished difference Result 7241 states and 10531 transitions. [2024-10-11 03:39:34,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:39:34,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-11 03:39:34,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:34,744 INFO L225 Difference]: With dead ends: 7241 [2024-10-11 03:39:34,744 INFO L226 Difference]: Without dead ends: 4245 [2024-10-11 03:39:34,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:39:34,749 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 783 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:34,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 209 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:39:34,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4245 states. [2024-10-11 03:39:34,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4245 to 4220. [2024-10-11 03:39:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4220 states, 4219 states have (on average 1.4418108556529983) internal successors, (6083), 4219 states have internal predecessors, (6083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4220 states to 4220 states and 6083 transitions. [2024-10-11 03:39:34,875 INFO L78 Accepts]: Start accepts. Automaton has 4220 states and 6083 transitions. Word has length 56 [2024-10-11 03:39:34,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:34,875 INFO L471 AbstractCegarLoop]: Abstraction has 4220 states and 6083 transitions. [2024-10-11 03:39:34,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4220 states and 6083 transitions. [2024-10-11 03:39:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 03:39:34,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:34,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:34,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:39:34,878 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:34,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:34,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1475937801, now seen corresponding path program 1 times [2024-10-11 03:39:34,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:34,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38106141] [2024-10-11 03:39:34,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:34,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:35,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:35,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38106141] [2024-10-11 03:39:35,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38106141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:35,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:35,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:39:35,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322181004] [2024-10-11 03:39:35,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:35,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:39:35,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:35,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:39:35,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:39:35,031 INFO L87 Difference]: Start difference. First operand 4220 states and 6083 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:35,367 INFO L93 Difference]: Finished difference Result 10021 states and 14368 transitions. [2024-10-11 03:39:35,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:39:35,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-10-11 03:39:35,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:35,395 INFO L225 Difference]: With dead ends: 10021 [2024-10-11 03:39:35,395 INFO L226 Difference]: Without dead ends: 8651 [2024-10-11 03:39:35,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:39:35,401 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1342 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:35,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 366 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:39:35,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8651 states. [2024-10-11 03:39:35,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8651 to 4232. [2024-10-11 03:39:35,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4232 states, 4231 states have (on average 1.4415031907350508) internal successors, (6099), 4231 states have internal predecessors, (6099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4232 states to 4232 states and 6099 transitions. [2024-10-11 03:39:35,534 INFO L78 Accepts]: Start accepts. Automaton has 4232 states and 6099 transitions. Word has length 57 [2024-10-11 03:39:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:35,534 INFO L471 AbstractCegarLoop]: Abstraction has 4232 states and 6099 transitions. [2024-10-11 03:39:35,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 4232 states and 6099 transitions. [2024-10-11 03:39:35,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 03:39:35,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:35,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:35,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:39:35,538 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:35,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:35,539 INFO L85 PathProgramCache]: Analyzing trace with hash -349521333, now seen corresponding path program 1 times [2024-10-11 03:39:35,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:35,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046825196] [2024-10-11 03:39:35,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:35,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:35,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:35,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046825196] [2024-10-11 03:39:35,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046825196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:35,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:35,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:39:35,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062764987] [2024-10-11 03:39:35,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:35,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:39:35,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:35,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:39:35,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:39:35,699 INFO L87 Difference]: Start difference. First operand 4232 states and 6099 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:35,992 INFO L93 Difference]: Finished difference Result 9516 states and 13617 transitions. [2024-10-11 03:39:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:39:35,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-11 03:39:35,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:36,007 INFO L225 Difference]: With dead ends: 9516 [2024-10-11 03:39:36,008 INFO L226 Difference]: Without dead ends: 7302 [2024-10-11 03:39:36,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:39:36,014 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 999 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:36,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 316 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:39:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2024-10-11 03:39:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 4252. [2024-10-11 03:39:36,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4252 states, 4251 states have (on average 1.4403669724770642) internal successors, (6123), 4251 states have internal predecessors, (6123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4252 states to 4252 states and 6123 transitions. [2024-10-11 03:39:36,103 INFO L78 Accepts]: Start accepts. Automaton has 4252 states and 6123 transitions. Word has length 58 [2024-10-11 03:39:36,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:36,104 INFO L471 AbstractCegarLoop]: Abstraction has 4252 states and 6123 transitions. [2024-10-11 03:39:36,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:36,104 INFO L276 IsEmpty]: Start isEmpty. Operand 4252 states and 6123 transitions. [2024-10-11 03:39:36,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 03:39:36,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:36,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:36,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:39:36,107 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:36,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:36,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1946389460, now seen corresponding path program 1 times [2024-10-11 03:39:36,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:36,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914526078] [2024-10-11 03:39:36,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:36,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:36,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:36,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914526078] [2024-10-11 03:39:36,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914526078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:36,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:36,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:39:36,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095298575] [2024-10-11 03:39:36,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:36,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:39:36,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:36,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:39:36,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:39:36,228 INFO L87 Difference]: Start difference. First operand 4252 states and 6123 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:36,560 INFO L93 Difference]: Finished difference Result 11058 states and 15822 transitions. [2024-10-11 03:39:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:39:36,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-11 03:39:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:36,577 INFO L225 Difference]: With dead ends: 11058 [2024-10-11 03:39:36,578 INFO L226 Difference]: Without dead ends: 9016 [2024-10-11 03:39:36,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:39:36,584 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1180 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:36,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 350 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:39:36,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9016 states. [2024-10-11 03:39:36,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9016 to 4330. [2024-10-11 03:39:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4330 states, 4329 states have (on average 1.4375144375144375) internal successors, (6223), 4329 states have internal predecessors, (6223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 6223 transitions. [2024-10-11 03:39:36,686 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 6223 transitions. Word has length 58 [2024-10-11 03:39:36,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:36,686 INFO L471 AbstractCegarLoop]: Abstraction has 4330 states and 6223 transitions. [2024-10-11 03:39:36,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:36,687 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 6223 transitions. [2024-10-11 03:39:36,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:39:36,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:36,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:36,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:39:36,690 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:36,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:36,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1193614241, now seen corresponding path program 1 times [2024-10-11 03:39:36,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:36,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125779568] [2024-10-11 03:39:36,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:36,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:37,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:37,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125779568] [2024-10-11 03:39:37,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125779568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:37,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:37,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:39:37,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568394543] [2024-10-11 03:39:37,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:37,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:39:37,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:37,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:39:37,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:39:37,079 INFO L87 Difference]: Start difference. First operand 4330 states and 6223 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:37,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:37,634 INFO L93 Difference]: Finished difference Result 10445 states and 15049 transitions. [2024-10-11 03:39:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:39:37,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-11 03:39:37,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:37,648 INFO L225 Difference]: With dead ends: 10445 [2024-10-11 03:39:37,648 INFO L226 Difference]: Without dead ends: 6868 [2024-10-11 03:39:37,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:39:37,657 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 567 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:37,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 792 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:39:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2024-10-11 03:39:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 4330. [2024-10-11 03:39:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4330 states, 4329 states have (on average 1.436128436128436) internal successors, (6217), 4329 states have internal predecessors, (6217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 6217 transitions. [2024-10-11 03:39:37,751 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 6217 transitions. Word has length 60 [2024-10-11 03:39:37,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:37,751 INFO L471 AbstractCegarLoop]: Abstraction has 4330 states and 6217 transitions. [2024-10-11 03:39:37,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 6217 transitions. [2024-10-11 03:39:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:39:37,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:37,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:37,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:39:37,755 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:37,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:37,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1573545695, now seen corresponding path program 1 times [2024-10-11 03:39:37,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:37,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635611092] [2024-10-11 03:39:37,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:37,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:38,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:38,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635611092] [2024-10-11 03:39:38,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635611092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:38,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:38,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:39:38,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589090929] [2024-10-11 03:39:38,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:38,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:39:38,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:38,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:39:38,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:39:38,095 INFO L87 Difference]: Start difference. First operand 4330 states and 6217 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:38,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:38,668 INFO L93 Difference]: Finished difference Result 10210 states and 14717 transitions. [2024-10-11 03:39:38,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:39:38,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-11 03:39:38,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:38,682 INFO L225 Difference]: With dead ends: 10210 [2024-10-11 03:39:38,682 INFO L226 Difference]: Without dead ends: 6766 [2024-10-11 03:39:38,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:39:38,690 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 857 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:38,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 690 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:39:38,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6766 states. [2024-10-11 03:39:38,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6766 to 4248. [2024-10-11 03:39:38,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4248 states, 4247 states have (on average 1.4325406169060513) internal successors, (6084), 4247 states have internal predecessors, (6084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:38,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4248 states to 4248 states and 6084 transitions. [2024-10-11 03:39:38,770 INFO L78 Accepts]: Start accepts. Automaton has 4248 states and 6084 transitions. Word has length 60 [2024-10-11 03:39:38,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:38,770 INFO L471 AbstractCegarLoop]: Abstraction has 4248 states and 6084 transitions. [2024-10-11 03:39:38,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 4248 states and 6084 transitions. [2024-10-11 03:39:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:39:38,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:38,773 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:38,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:39:38,773 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:38,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:38,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1904995552, now seen corresponding path program 1 times [2024-10-11 03:39:38,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:38,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238527995] [2024-10-11 03:39:38,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:38,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:39,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:39,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238527995] [2024-10-11 03:39:39,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238527995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:39,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:39,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:39:39,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4699412] [2024-10-11 03:39:39,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:39,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:39:39,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:39,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:39:39,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:39:39,073 INFO L87 Difference]: Start difference. First operand 4248 states and 6084 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:39,644 INFO L93 Difference]: Finished difference Result 11243 states and 16201 transitions. [2024-10-11 03:39:39,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:39:39,644 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-11 03:39:39,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:39,658 INFO L225 Difference]: With dead ends: 11243 [2024-10-11 03:39:39,658 INFO L226 Difference]: Without dead ends: 7671 [2024-10-11 03:39:39,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-10-11 03:39:39,666 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 860 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:39,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 755 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:39:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7671 states. [2024-10-11 03:39:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7671 to 4073. [2024-10-11 03:39:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4073 states, 4072 states have (on average 1.4287819253438114) internal successors, (5818), 4072 states have internal predecessors, (5818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:39,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4073 states to 4073 states and 5818 transitions. [2024-10-11 03:39:39,749 INFO L78 Accepts]: Start accepts. Automaton has 4073 states and 5818 transitions. Word has length 60 [2024-10-11 03:39:39,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:39,749 INFO L471 AbstractCegarLoop]: Abstraction has 4073 states and 5818 transitions. [2024-10-11 03:39:39,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4073 states and 5818 transitions. [2024-10-11 03:39:39,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 03:39:39,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:39,752 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:39,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:39:39,752 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:39,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:39,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1386526584, now seen corresponding path program 1 times [2024-10-11 03:39:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:39,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119712665] [2024-10-11 03:39:39,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:39,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:39,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:39,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119712665] [2024-10-11 03:39:39,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119712665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:39,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:39,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:39:39,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80153542] [2024-10-11 03:39:39,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:39,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:39:39,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:39,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:39:39,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:39,809 INFO L87 Difference]: Start difference. First operand 4073 states and 5818 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:39,842 INFO L93 Difference]: Finished difference Result 6079 states and 8709 transitions. [2024-10-11 03:39:39,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:39:39,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-11 03:39:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:39,849 INFO L225 Difference]: With dead ends: 6079 [2024-10-11 03:39:39,849 INFO L226 Difference]: Without dead ends: 3966 [2024-10-11 03:39:39,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:39,852 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 132 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:39,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 474 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:39:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2024-10-11 03:39:39,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3964. [2024-10-11 03:39:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3964 states, 3963 states have (on average 1.4130709058793842) internal successors, (5600), 3963 states have internal predecessors, (5600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3964 states and 5600 transitions. [2024-10-11 03:39:39,904 INFO L78 Accepts]: Start accepts. Automaton has 3964 states and 5600 transitions. Word has length 61 [2024-10-11 03:39:39,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:39,905 INFO L471 AbstractCegarLoop]: Abstraction has 3964 states and 5600 transitions. [2024-10-11 03:39:39,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 3964 states and 5600 transitions. [2024-10-11 03:39:39,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 03:39:39,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:39,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:39,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:39:39,908 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:39,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:39,908 INFO L85 PathProgramCache]: Analyzing trace with hash 163801939, now seen corresponding path program 1 times [2024-10-11 03:39:39,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:39,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594812120] [2024-10-11 03:39:39,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:39,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:39,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:39,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594812120] [2024-10-11 03:39:39,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594812120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:39,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:39,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:39:39,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659930337] [2024-10-11 03:39:39,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:39,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:39:39,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:39,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:39:39,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:39,972 INFO L87 Difference]: Start difference. First operand 3964 states and 5600 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:40,000 INFO L93 Difference]: Finished difference Result 5466 states and 7721 transitions. [2024-10-11 03:39:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:39:40,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-11 03:39:40,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:40,006 INFO L225 Difference]: With dead ends: 5466 [2024-10-11 03:39:40,006 INFO L226 Difference]: Without dead ends: 3371 [2024-10-11 03:39:40,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:40,009 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 120 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:40,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 463 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:39:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2024-10-11 03:39:40,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 3369. [2024-10-11 03:39:40,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3369 states, 3368 states have (on average 1.3865795724465557) internal successors, (4670), 3368 states have internal predecessors, (4670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 4670 transitions. [2024-10-11 03:39:40,051 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 4670 transitions. Word has length 61 [2024-10-11 03:39:40,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:40,051 INFO L471 AbstractCegarLoop]: Abstraction has 3369 states and 4670 transitions. [2024-10-11 03:39:40,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 4670 transitions. [2024-10-11 03:39:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 03:39:40,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:40,054 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:40,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:39:40,054 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:40,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:40,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1149979677, now seen corresponding path program 1 times [2024-10-11 03:39:40,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:40,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399405399] [2024-10-11 03:39:40,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:40,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:40,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:40,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399405399] [2024-10-11 03:39:40,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399405399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:40,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:40,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:39:40,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30906853] [2024-10-11 03:39:40,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:40,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:39:40,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:40,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:39:40,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:40,124 INFO L87 Difference]: Start difference. First operand 3369 states and 4670 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:40,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:40,158 INFO L93 Difference]: Finished difference Result 4118 states and 5685 transitions. [2024-10-11 03:39:40,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:39:40,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-11 03:39:40,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:40,162 INFO L225 Difference]: With dead ends: 4118 [2024-10-11 03:39:40,162 INFO L226 Difference]: Without dead ends: 2781 [2024-10-11 03:39:40,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:40,164 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 150 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:40,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 479 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:39:40,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2024-10-11 03:39:40,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2779. [2024-10-11 03:39:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2779 states, 2778 states have (on average 1.3538516918646508) internal successors, (3761), 2778 states have internal predecessors, (3761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3761 transitions. [2024-10-11 03:39:40,199 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3761 transitions. Word has length 61 [2024-10-11 03:39:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:40,199 INFO L471 AbstractCegarLoop]: Abstraction has 2779 states and 3761 transitions. [2024-10-11 03:39:40,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:40,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3761 transitions. [2024-10-11 03:39:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:39:40,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:40,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:40,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:39:40,204 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:40,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:40,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1379218415, now seen corresponding path program 1 times [2024-10-11 03:39:40,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:40,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244788547] [2024-10-11 03:39:40,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:40,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:40,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:40,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244788547] [2024-10-11 03:39:40,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244788547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:40,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:40,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:39:40,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186107483] [2024-10-11 03:39:40,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:40,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:39:40,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:40,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:39:40,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:39:40,873 INFO L87 Difference]: Start difference. First operand 2779 states and 3761 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:41,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:41,499 INFO L93 Difference]: Finished difference Result 4363 states and 5953 transitions. [2024-10-11 03:39:41,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:39:41,500 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-11 03:39:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:41,506 INFO L225 Difference]: With dead ends: 4363 [2024-10-11 03:39:41,506 INFO L226 Difference]: Without dead ends: 3975 [2024-10-11 03:39:41,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:39:41,509 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1116 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:41,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 1043 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:39:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2024-10-11 03:39:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 2690. [2024-10-11 03:39:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2690 states, 2689 states have (on average 1.3536630717738936) internal successors, (3640), 2689 states have internal predecessors, (3640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 3640 transitions. [2024-10-11 03:39:41,555 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 3640 transitions. Word has length 62 [2024-10-11 03:39:41,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:41,556 INFO L471 AbstractCegarLoop]: Abstraction has 2690 states and 3640 transitions. [2024-10-11 03:39:41,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3640 transitions. [2024-10-11 03:39:41,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:39:41,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:41,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:41,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:39:41,559 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:41,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:41,559 INFO L85 PathProgramCache]: Analyzing trace with hash -657539413, now seen corresponding path program 1 times [2024-10-11 03:39:41,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:41,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430598526] [2024-10-11 03:39:41,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:41,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:42,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:42,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430598526] [2024-10-11 03:39:42,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430598526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:42,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:42,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-11 03:39:42,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83394564] [2024-10-11 03:39:42,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:42,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:39:42,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:42,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:39:42,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:39:42,806 INFO L87 Difference]: Start difference. First operand 2690 states and 3640 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:45,220 INFO L93 Difference]: Finished difference Result 5440 states and 7420 transitions. [2024-10-11 03:39:45,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 03:39:45,220 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-11 03:39:45,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:45,228 INFO L225 Difference]: With dead ends: 5440 [2024-10-11 03:39:45,228 INFO L226 Difference]: Without dead ends: 5373 [2024-10-11 03:39:45,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=298, Invalid=1508, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 03:39:45,230 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 1705 mSDsluCounter, 3253 mSDsCounter, 0 mSdLazyCounter, 2532 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 3510 SdHoareTripleChecker+Invalid, 2533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:45,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 3510 Invalid, 2533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2532 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 03:39:45,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5373 states. [2024-10-11 03:39:45,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5373 to 2702. [2024-10-11 03:39:45,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2702 states, 2701 states have (on average 1.3532025175860791) internal successors, (3655), 2701 states have internal predecessors, (3655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 3655 transitions. [2024-10-11 03:39:45,287 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 3655 transitions. Word has length 62 [2024-10-11 03:39:45,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:45,288 INFO L471 AbstractCegarLoop]: Abstraction has 2702 states and 3655 transitions. [2024-10-11 03:39:45,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:45,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 3655 transitions. [2024-10-11 03:39:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:39:45,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:45,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:45,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:39:45,291 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:45,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:45,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1808923676, now seen corresponding path program 1 times [2024-10-11 03:39:45,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:45,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700804897] [2024-10-11 03:39:45,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:45,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:45,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:45,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700804897] [2024-10-11 03:39:45,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700804897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:45,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:45,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:39:45,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816113446] [2024-10-11 03:39:45,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:45,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:39:45,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:45,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:39:45,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:45,343 INFO L87 Difference]: Start difference. First operand 2702 states and 3655 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:45,389 INFO L93 Difference]: Finished difference Result 4906 states and 6691 transitions. [2024-10-11 03:39:45,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:39:45,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-11 03:39:45,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:45,398 INFO L225 Difference]: With dead ends: 4906 [2024-10-11 03:39:45,398 INFO L226 Difference]: Without dead ends: 3560 [2024-10-11 03:39:45,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:45,401 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 151 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:45,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 305 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:39:45,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2024-10-11 03:39:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 2532. [2024-10-11 03:39:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2532 states, 2531 states have (on average 1.3524298696167523) internal successors, (3423), 2531 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 3423 transitions. [2024-10-11 03:39:45,445 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 3423 transitions. Word has length 62 [2024-10-11 03:39:45,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:45,445 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 3423 transitions. [2024-10-11 03:39:45,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:45,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3423 transitions. [2024-10-11 03:39:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:39:45,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:45,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:45,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:39:45,448 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:45,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:45,448 INFO L85 PathProgramCache]: Analyzing trace with hash -909030368, now seen corresponding path program 1 times [2024-10-11 03:39:45,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:45,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32288037] [2024-10-11 03:39:45,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:45,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:46,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:46,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32288037] [2024-10-11 03:39:46,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32288037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:46,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:46,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 03:39:46,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39491691] [2024-10-11 03:39:46,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:46,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:39:46,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:46,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:39:46,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:39:46,480 INFO L87 Difference]: Start difference. First operand 2532 states and 3423 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:48,076 INFO L93 Difference]: Finished difference Result 4875 states and 6651 transitions. [2024-10-11 03:39:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:39:48,077 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-11 03:39:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:48,083 INFO L225 Difference]: With dead ends: 4875 [2024-10-11 03:39:48,083 INFO L226 Difference]: Without dead ends: 4737 [2024-10-11 03:39:48,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=230, Invalid=826, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 03:39:48,088 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 778 mSDsluCounter, 2437 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 2634 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:48,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 2634 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:39:48,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4737 states. [2024-10-11 03:39:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 2509. [2024-10-11 03:39:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 2508 states have (on average 1.3516746411483254) internal successors, (3390), 2508 states have internal predecessors, (3390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3390 transitions. [2024-10-11 03:39:48,128 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3390 transitions. Word has length 63 [2024-10-11 03:39:48,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:48,128 INFO L471 AbstractCegarLoop]: Abstraction has 2509 states and 3390 transitions. [2024-10-11 03:39:48,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:48,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3390 transitions. [2024-10-11 03:39:48,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:39:48,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:48,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:48,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:39:48,131 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:48,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:48,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2050966729, now seen corresponding path program 1 times [2024-10-11 03:39:48,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:48,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017669889] [2024-10-11 03:39:48,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:48,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:48,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:48,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017669889] [2024-10-11 03:39:48,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017669889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:48,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:48,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:39:48,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006160692] [2024-10-11 03:39:48,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:48,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:39:48,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:48,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:39:48,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:39:48,233 INFO L87 Difference]: Start difference. First operand 2509 states and 3390 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:48,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:48,293 INFO L93 Difference]: Finished difference Result 2515 states and 3393 transitions. [2024-10-11 03:39:48,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:39:48,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-11 03:39:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:48,297 INFO L225 Difference]: With dead ends: 2515 [2024-10-11 03:39:48,297 INFO L226 Difference]: Without dead ends: 2300 [2024-10-11 03:39:48,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:39:48,299 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 582 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:48,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 555 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:39:48,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2300 states. [2024-10-11 03:39:48,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2300 to 2296. [2024-10-11 03:39:48,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2296 states, 2295 states have (on average 1.3538126361655773) internal successors, (3107), 2295 states have internal predecessors, (3107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:48,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 3107 transitions. [2024-10-11 03:39:48,324 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 3107 transitions. Word has length 64 [2024-10-11 03:39:48,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:48,324 INFO L471 AbstractCegarLoop]: Abstraction has 2296 states and 3107 transitions. [2024-10-11 03:39:48,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:48,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3107 transitions. [2024-10-11 03:39:48,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 03:39:48,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:48,327 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:48,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:39:48,328 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:48,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:48,328 INFO L85 PathProgramCache]: Analyzing trace with hash 942548057, now seen corresponding path program 1 times [2024-10-11 03:39:48,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:48,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863953957] [2024-10-11 03:39:48,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:48,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:48,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:48,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:48,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863953957] [2024-10-11 03:39:48,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863953957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:48,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:48,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:39:48,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762563653] [2024-10-11 03:39:48,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:48,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:39:48,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:48,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:39:48,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:48,426 INFO L87 Difference]: Start difference. First operand 2296 states and 3107 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:48,454 INFO L93 Difference]: Finished difference Result 5655 states and 7771 transitions. [2024-10-11 03:39:48,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:39:48,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-11 03:39:48,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:48,461 INFO L225 Difference]: With dead ends: 5655 [2024-10-11 03:39:48,461 INFO L226 Difference]: Without dead ends: 3898 [2024-10-11 03:39:48,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:48,465 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 103 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:48,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 403 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:39:48,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3898 states. [2024-10-11 03:39:48,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 3630. [2024-10-11 03:39:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3630 states, 3629 states have (on average 1.361532102507578) internal successors, (4941), 3629 states have internal predecessors, (4941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3630 states to 3630 states and 4941 transitions. [2024-10-11 03:39:48,507 INFO L78 Accepts]: Start accepts. Automaton has 3630 states and 4941 transitions. Word has length 67 [2024-10-11 03:39:48,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:48,507 INFO L471 AbstractCegarLoop]: Abstraction has 3630 states and 4941 transitions. [2024-10-11 03:39:48,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3630 states and 4941 transitions. [2024-10-11 03:39:48,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 03:39:48,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:48,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:48,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:39:48,510 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:48,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:48,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1222049860, now seen corresponding path program 1 times [2024-10-11 03:39:48,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:48,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708197051] [2024-10-11 03:39:48,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:48,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:48,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:48,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708197051] [2024-10-11 03:39:48,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708197051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:48,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:48,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:39:48,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204018208] [2024-10-11 03:39:48,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:48,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:39:48,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:48,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:39:48,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:48,603 INFO L87 Difference]: Start difference. First operand 3630 states and 4941 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:48,638 INFO L93 Difference]: Finished difference Result 9502 states and 13035 transitions. [2024-10-11 03:39:48,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:39:48,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-11 03:39:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:48,647 INFO L225 Difference]: With dead ends: 9502 [2024-10-11 03:39:48,648 INFO L226 Difference]: Without dead ends: 6411 [2024-10-11 03:39:48,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:48,653 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 92 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:48,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 395 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:39:48,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2024-10-11 03:39:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 5957. [2024-10-11 03:39:48,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5957 states, 5956 states have (on average 1.362155809267965) internal successors, (8113), 5956 states have internal predecessors, (8113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5957 states to 5957 states and 8113 transitions. [2024-10-11 03:39:48,742 INFO L78 Accepts]: Start accepts. Automaton has 5957 states and 8113 transitions. Word has length 68 [2024-10-11 03:39:48,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:48,742 INFO L471 AbstractCegarLoop]: Abstraction has 5957 states and 8113 transitions. [2024-10-11 03:39:48,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 5957 states and 8113 transitions. [2024-10-11 03:39:48,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:39:48,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:48,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:48,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:39:48,745 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:48,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:48,745 INFO L85 PathProgramCache]: Analyzing trace with hash 580845370, now seen corresponding path program 1 times [2024-10-11 03:39:48,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:48,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504931687] [2024-10-11 03:39:48,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:48,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:48,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:48,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504931687] [2024-10-11 03:39:48,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504931687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:48,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:48,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:39:48,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070170488] [2024-10-11 03:39:48,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:48,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:39:48,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:48,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:39:48,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:39:48,932 INFO L87 Difference]: Start difference. First operand 5957 states and 8113 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:48,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:48,972 INFO L93 Difference]: Finished difference Result 6451 states and 8770 transitions. [2024-10-11 03:39:48,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:39:48,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-11 03:39:48,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:48,981 INFO L225 Difference]: With dead ends: 6451 [2024-10-11 03:39:48,981 INFO L226 Difference]: Without dead ends: 6449 [2024-10-11 03:39:48,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:39:48,984 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:48,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 938 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:39:48,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6449 states. [2024-10-11 03:39:49,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6449 to 6449. [2024-10-11 03:39:49,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6449 states, 6448 states have (on average 1.3345223325062034) internal successors, (8605), 6448 states have internal predecessors, (8605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6449 states to 6449 states and 8605 transitions. [2024-10-11 03:39:49,058 INFO L78 Accepts]: Start accepts. Automaton has 6449 states and 8605 transitions. Word has length 71 [2024-10-11 03:39:49,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:49,059 INFO L471 AbstractCegarLoop]: Abstraction has 6449 states and 8605 transitions. [2024-10-11 03:39:49,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:49,059 INFO L276 IsEmpty]: Start isEmpty. Operand 6449 states and 8605 transitions. [2024-10-11 03:39:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 03:39:49,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:49,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:49,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:39:49,062 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:49,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:49,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1426787329, now seen corresponding path program 1 times [2024-10-11 03:39:49,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:49,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367455324] [2024-10-11 03:39:49,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:49,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:49,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:49,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367455324] [2024-10-11 03:39:49,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367455324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:49,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:49,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:39:49,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588063544] [2024-10-11 03:39:49,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:49,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:39:49,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:49,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:39:49,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:49,120 INFO L87 Difference]: Start difference. First operand 6449 states and 8605 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:49,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:49,185 INFO L93 Difference]: Finished difference Result 16883 states and 22507 transitions. [2024-10-11 03:39:49,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:39:49,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-11 03:39:49,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:49,202 INFO L225 Difference]: With dead ends: 16883 [2024-10-11 03:39:49,203 INFO L226 Difference]: Without dead ends: 10883 [2024-10-11 03:39:49,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:49,212 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 118 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:49,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 311 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:39:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10883 states. [2024-10-11 03:39:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10883 to 10717. [2024-10-11 03:39:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10717 states, 10716 states have (on average 1.2994587532661441) internal successors, (13925), 10716 states have internal predecessors, (13925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10717 states to 10717 states and 13925 transitions. [2024-10-11 03:39:49,378 INFO L78 Accepts]: Start accepts. Automaton has 10717 states and 13925 transitions. Word has length 72 [2024-10-11 03:39:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:49,379 INFO L471 AbstractCegarLoop]: Abstraction has 10717 states and 13925 transitions. [2024-10-11 03:39:49,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 10717 states and 13925 transitions. [2024-10-11 03:39:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:39:49,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:49,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:49,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 03:39:49,382 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:49,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:49,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1064758803, now seen corresponding path program 1 times [2024-10-11 03:39:49,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:49,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630407566] [2024-10-11 03:39:49,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:49,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:49,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:49,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630407566] [2024-10-11 03:39:49,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630407566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:49,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:49,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:39:49,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536233476] [2024-10-11 03:39:49,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:49,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:39:49,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:49,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:39:49,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:49,473 INFO L87 Difference]: Start difference. First operand 10717 states and 13925 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:49,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:49,565 INFO L93 Difference]: Finished difference Result 27033 states and 35107 transitions. [2024-10-11 03:39:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:39:49,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-11 03:39:49,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:49,590 INFO L225 Difference]: With dead ends: 27033 [2024-10-11 03:39:49,591 INFO L226 Difference]: Without dead ends: 16749 [2024-10-11 03:39:49,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:49,607 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 97 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:49,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 389 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:39:49,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16749 states. [2024-10-11 03:39:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16749 to 15163. [2024-10-11 03:39:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15163 states, 15162 states have (on average 1.2874950534230312) internal successors, (19521), 15162 states have internal predecessors, (19521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15163 states to 15163 states and 19521 transitions. [2024-10-11 03:39:49,804 INFO L78 Accepts]: Start accepts. Automaton has 15163 states and 19521 transitions. Word has length 73 [2024-10-11 03:39:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:49,804 INFO L471 AbstractCegarLoop]: Abstraction has 15163 states and 19521 transitions. [2024-10-11 03:39:49,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 15163 states and 19521 transitions. [2024-10-11 03:39:49,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 03:39:49,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:49,810 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:49,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:39:49,853 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:49,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:49,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1185902139, now seen corresponding path program 1 times [2024-10-11 03:39:49,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:49,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253661947] [2024-10-11 03:39:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:49,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:50,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:50,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253661947] [2024-10-11 03:39:50,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253661947] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:39:50,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288462265] [2024-10-11 03:39:50,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:50,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:39:50,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:39:50,210 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:39:50,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:39:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:50,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 03:39:50,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:39:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:51,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:39:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:52,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288462265] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:39:52,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:39:52,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 14] total 30 [2024-10-11 03:39:52,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714515120] [2024-10-11 03:39:52,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:39:52,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 03:39:52,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:52,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 03:39:52,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2024-10-11 03:39:52,602 INFO L87 Difference]: Start difference. First operand 15163 states and 19521 transitions. Second operand has 31 states, 31 states have (on average 7.612903225806452) internal successors, (236), 30 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:07,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:07,193 INFO L93 Difference]: Finished difference Result 112702 states and 142980 transitions. [2024-10-11 03:40:07,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2024-10-11 03:40:07,194 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.612903225806452) internal successors, (236), 30 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 03:40:07,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:07,356 INFO L225 Difference]: With dead ends: 112702 [2024-10-11 03:40:07,356 INFO L226 Difference]: Without dead ends: 105136 [2024-10-11 03:40:07,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27935 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=10611, Invalid=56729, Unknown=0, NotChecked=0, Total=67340 [2024-10-11 03:40:07,399 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 6030 mSDsluCounter, 6106 mSDsCounter, 0 mSdLazyCounter, 6224 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6030 SdHoareTripleChecker+Valid, 6417 SdHoareTripleChecker+Invalid, 6330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 6224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:07,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6030 Valid, 6417 Invalid, 6330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 6224 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-11 03:40:07,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105136 states. [2024-10-11 03:40:08,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105136 to 31519. [2024-10-11 03:40:08,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31519 states, 31518 states have (on average 1.2871692366266896) internal successors, (40569), 31518 states have internal predecessors, (40569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:08,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31519 states to 31519 states and 40569 transitions. [2024-10-11 03:40:08,165 INFO L78 Accepts]: Start accepts. Automaton has 31519 states and 40569 transitions. Word has length 91 [2024-10-11 03:40:08,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:08,166 INFO L471 AbstractCegarLoop]: Abstraction has 31519 states and 40569 transitions. [2024-10-11 03:40:08,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.612903225806452) internal successors, (236), 30 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:08,166 INFO L276 IsEmpty]: Start isEmpty. Operand 31519 states and 40569 transitions. [2024-10-11 03:40:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 03:40:08,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:08,174 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:08,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:40:08,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:08,375 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:08,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:08,376 INFO L85 PathProgramCache]: Analyzing trace with hash 560481407, now seen corresponding path program 1 times [2024-10-11 03:40:08,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:08,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772594195] [2024-10-11 03:40:08,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:08,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:08,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772594195] [2024-10-11 03:40:08,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772594195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:08,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:08,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:40:08,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581140229] [2024-10-11 03:40:08,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:08,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:40:08,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:08,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:40:08,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:40:08,818 INFO L87 Difference]: Start difference. First operand 31519 states and 40569 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:09,481 INFO L93 Difference]: Finished difference Result 66112 states and 84795 transitions. [2024-10-11 03:40:09,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:40:09,482 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 03:40:09,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:09,550 INFO L225 Difference]: With dead ends: 66112 [2024-10-11 03:40:09,550 INFO L226 Difference]: Without dead ends: 53520 [2024-10-11 03:40:09,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:40:09,576 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 438 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:09,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 912 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:40:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53520 states. [2024-10-11 03:40:10,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53520 to 45956. [2024-10-11 03:40:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45956 states, 45955 states have (on average 1.286976389946687) internal successors, (59143), 45955 states have internal predecessors, (59143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45956 states to 45956 states and 59143 transitions. [2024-10-11 03:40:10,388 INFO L78 Accepts]: Start accepts. Automaton has 45956 states and 59143 transitions. Word has length 91 [2024-10-11 03:40:10,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:10,388 INFO L471 AbstractCegarLoop]: Abstraction has 45956 states and 59143 transitions. [2024-10-11 03:40:10,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 45956 states and 59143 transitions. [2024-10-11 03:40:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:40:10,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:10,397 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:10,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 03:40:10,398 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:10,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:10,398 INFO L85 PathProgramCache]: Analyzing trace with hash 997528935, now seen corresponding path program 1 times [2024-10-11 03:40:10,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:10,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878428877] [2024-10-11 03:40:10,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:10,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:10,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:10,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878428877] [2024-10-11 03:40:10,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878428877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:10,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:10,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:10,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221016983] [2024-10-11 03:40:10,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:10,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:10,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:10,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:10,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:10,484 INFO L87 Difference]: Start difference. First operand 45956 states and 59143 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:10,884 INFO L93 Difference]: Finished difference Result 91373 states and 117686 transitions. [2024-10-11 03:40:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:10,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:40:10,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:10,966 INFO L225 Difference]: With dead ends: 91373 [2024-10-11 03:40:10,966 INFO L226 Difference]: Without dead ends: 45958 [2024-10-11 03:40:11,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:11,007 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 88 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:11,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 335 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:11,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45958 states. [2024-10-11 03:40:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45958 to 44299. [2024-10-11 03:40:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44299 states, 44298 states have (on average 1.2676870287597635) internal successors, (56156), 44298 states have internal predecessors, (56156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44299 states to 44299 states and 56156 transitions. [2024-10-11 03:40:11,797 INFO L78 Accepts]: Start accepts. Automaton has 44299 states and 56156 transitions. Word has length 92 [2024-10-11 03:40:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:11,797 INFO L471 AbstractCegarLoop]: Abstraction has 44299 states and 56156 transitions. [2024-10-11 03:40:11,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 44299 states and 56156 transitions. [2024-10-11 03:40:11,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:40:11,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:11,806 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:11,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 03:40:11,807 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:11,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:11,807 INFO L85 PathProgramCache]: Analyzing trace with hash 32256659, now seen corresponding path program 1 times [2024-10-11 03:40:11,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:11,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330319711] [2024-10-11 03:40:11,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:11,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:12,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:12,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330319711] [2024-10-11 03:40:12,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330319711] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:40:12,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876489764] [2024-10-11 03:40:12,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:12,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:12,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:40:12,107 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:40:12,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:40:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:12,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:40:12,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:40:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:12,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:40:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:12,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876489764] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:40:12,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:40:12,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-11 03:40:12,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506319010] [2024-10-11 03:40:12,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:40:12,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:40:12,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:12,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:40:12,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:40:12,619 INFO L87 Difference]: Start difference. First operand 44299 states and 56156 transitions. Second operand has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:13,054 INFO L93 Difference]: Finished difference Result 126797 states and 159435 transitions. [2024-10-11 03:40:13,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:40:13,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:40:13,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:13,175 INFO L225 Difference]: With dead ends: 126797 [2024-10-11 03:40:13,176 INFO L226 Difference]: Without dead ends: 83039 [2024-10-11 03:40:13,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:40:13,334 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 319 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:13,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1113 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:40:13,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83039 states. [2024-10-11 03:40:14,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83039 to 64345. [2024-10-11 03:40:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64345 states, 64344 states have (on average 1.2587653860499814) internal successors, (80994), 64344 states have internal predecessors, (80994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64345 states to 64345 states and 80994 transitions. [2024-10-11 03:40:14,328 INFO L78 Accepts]: Start accepts. Automaton has 64345 states and 80994 transitions. Word has length 92 [2024-10-11 03:40:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:14,328 INFO L471 AbstractCegarLoop]: Abstraction has 64345 states and 80994 transitions. [2024-10-11 03:40:14,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:14,329 INFO L276 IsEmpty]: Start isEmpty. Operand 64345 states and 80994 transitions. [2024-10-11 03:40:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 03:40:14,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:14,340 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:14,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:40:14,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:14,541 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:14,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:14,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1242845570, now seen corresponding path program 1 times [2024-10-11 03:40:14,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:14,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739551370] [2024-10-11 03:40:14,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:14,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 03:40:14,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:14,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739551370] [2024-10-11 03:40:14,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739551370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:14,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:14,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:40:14,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862127470] [2024-10-11 03:40:14,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:14,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:40:14,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:14,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:40:14,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:14,602 INFO L87 Difference]: Start difference. First operand 64345 states and 80994 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:15,081 INFO L93 Difference]: Finished difference Result 121476 states and 153093 transitions. [2024-10-11 03:40:15,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:40:15,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-11 03:40:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:15,157 INFO L225 Difference]: With dead ends: 121476 [2024-10-11 03:40:15,158 INFO L226 Difference]: Without dead ends: 57672 [2024-10-11 03:40:15,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:40:15,195 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 142 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:15,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 174 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:40:15,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57672 states. [2024-10-11 03:40:15,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57672 to 56279. [2024-10-11 03:40:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56279 states, 56278 states have (on average 1.2422260919009205) internal successors, (69910), 56278 states have internal predecessors, (69910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56279 states to 56279 states and 69910 transitions. [2024-10-11 03:40:16,250 INFO L78 Accepts]: Start accepts. Automaton has 56279 states and 69910 transitions. Word has length 98 [2024-10-11 03:40:16,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:16,255 INFO L471 AbstractCegarLoop]: Abstraction has 56279 states and 69910 transitions. [2024-10-11 03:40:16,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 56279 states and 69910 transitions. [2024-10-11 03:40:16,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 03:40:16,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:16,267 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:16,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 03:40:16,268 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:16,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:16,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1460878145, now seen corresponding path program 1 times [2024-10-11 03:40:16,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:16,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293404027] [2024-10-11 03:40:16,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:16,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:16,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:16,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293404027] [2024-10-11 03:40:16,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293404027] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:40:16,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354109134] [2024-10-11 03:40:16,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:16,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:16,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:40:16,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:40:16,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:40:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:16,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:40:16,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:40:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:16,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:40:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:16,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354109134] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:40:16,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:40:16,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-10-11 03:40:16,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759936886] [2024-10-11 03:40:16,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:40:16,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 03:40:16,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:16,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 03:40:16,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:40:16,944 INFO L87 Difference]: Start difference. First operand 56279 states and 69910 transitions. Second operand has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:17,443 INFO L93 Difference]: Finished difference Result 107518 states and 133546 transitions. [2024-10-11 03:40:17,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:40:17,444 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-11 03:40:17,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:17,507 INFO L225 Difference]: With dead ends: 107518 [2024-10-11 03:40:17,508 INFO L226 Difference]: Without dead ends: 51732 [2024-10-11 03:40:17,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:40:17,757 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 1856 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:17,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 642 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:40:17,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51732 states. [2024-10-11 03:40:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51732 to 45626. [2024-10-11 03:40:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45626 states, 45625 states have (on average 1.2239780821917807) internal successors, (55844), 45625 states have internal predecessors, (55844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:18,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45626 states to 45626 states and 55844 transitions. [2024-10-11 03:40:18,357 INFO L78 Accepts]: Start accepts. Automaton has 45626 states and 55844 transitions. Word has length 99 [2024-10-11 03:40:18,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:18,357 INFO L471 AbstractCegarLoop]: Abstraction has 45626 states and 55844 transitions. [2024-10-11 03:40:18,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:18,358 INFO L276 IsEmpty]: Start isEmpty. Operand 45626 states and 55844 transitions. [2024-10-11 03:40:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 03:40:18,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:18,378 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:18,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:40:18,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:18,579 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:18,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:18,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1810696450, now seen corresponding path program 1 times [2024-10-11 03:40:18,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:18,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222579334] [2024-10-11 03:40:18,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:18,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:18,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:18,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222579334] [2024-10-11 03:40:18,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222579334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:40:18,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:40:18,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:40:18,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321398360] [2024-10-11 03:40:18,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:40:18,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:40:18,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:18,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:40:18,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:40:18,674 INFO L87 Difference]: Start difference. First operand 45626 states and 55844 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:18,896 INFO L93 Difference]: Finished difference Result 87339 states and 106660 transitions. [2024-10-11 03:40:18,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:40:18,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-10-11 03:40:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:18,947 INFO L225 Difference]: With dead ends: 87339 [2024-10-11 03:40:18,947 INFO L226 Difference]: Without dead ends: 42238 [2024-10-11 03:40:18,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:40:18,978 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 316 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:18,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 319 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:40:19,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42238 states. [2024-10-11 03:40:19,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42238 to 41567. [2024-10-11 03:40:19,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41567 states, 41566 states have (on average 1.1973728528123948) internal successors, (49770), 41566 states have internal predecessors, (49770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41567 states to 41567 states and 49770 transitions. [2024-10-11 03:40:19,657 INFO L78 Accepts]: Start accepts. Automaton has 41567 states and 49770 transitions. Word has length 102 [2024-10-11 03:40:19,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:19,657 INFO L471 AbstractCegarLoop]: Abstraction has 41567 states and 49770 transitions. [2024-10-11 03:40:19,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 41567 states and 49770 transitions. [2024-10-11 03:40:19,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 03:40:19,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:19,666 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:19,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 03:40:19,666 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:19,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:19,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2001168869, now seen corresponding path program 1 times [2024-10-11 03:40:19,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:19,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906782841] [2024-10-11 03:40:19,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:19,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:19,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:19,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906782841] [2024-10-11 03:40:19,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906782841] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:40:19,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572284006] [2024-10-11 03:40:19,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:19,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:19,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:40:19,780 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:40:19,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:40:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:19,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:40:19,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:40:20,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:20,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:40:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:20,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572284006] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:40:20,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:40:20,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-10-11 03:40:20,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128336116] [2024-10-11 03:40:20,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:40:20,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 03:40:20,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:20,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 03:40:20,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:40:20,369 INFO L87 Difference]: Start difference. First operand 41567 states and 49770 transitions. Second operand has 14 states, 14 states have (on average 20.285714285714285) internal successors, (284), 14 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:20,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:20,831 INFO L93 Difference]: Finished difference Result 95565 states and 113819 transitions. [2024-10-11 03:40:20,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:40:20,831 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.285714285714285) internal successors, (284), 14 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-10-11 03:40:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:20,893 INFO L225 Difference]: With dead ends: 95565 [2024-10-11 03:40:20,894 INFO L226 Difference]: Without dead ends: 54523 [2024-10-11 03:40:20,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:40:20,927 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 1176 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:20,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 729 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:40:20,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54523 states. [2024-10-11 03:40:21,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54523 to 46216. [2024-10-11 03:40:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46216 states, 46215 states have (on average 1.1872552201666127) internal successors, (54869), 46215 states have internal predecessors, (54869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46216 states to 46216 states and 54869 transitions. [2024-10-11 03:40:21,657 INFO L78 Accepts]: Start accepts. Automaton has 46216 states and 54869 transitions. Word has length 103 [2024-10-11 03:40:21,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:21,657 INFO L471 AbstractCegarLoop]: Abstraction has 46216 states and 54869 transitions. [2024-10-11 03:40:21,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.285714285714285) internal successors, (284), 14 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 46216 states and 54869 transitions. [2024-10-11 03:40:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:40:21,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:21,663 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:21,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 03:40:21,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-10-11 03:40:21,864 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:21,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:21,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1040601876, now seen corresponding path program 1 times [2024-10-11 03:40:21,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:21,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001562288] [2024-10-11 03:40:21,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:21,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:22,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:22,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001562288] [2024-10-11 03:40:22,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001562288] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:40:22,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324539772] [2024-10-11 03:40:22,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:22,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:22,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:40:22,120 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:40:22,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:40:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:22,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 03:40:22,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:40:23,402 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:23,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:40:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:24,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324539772] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:40:24,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:40:24,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 16] total 36 [2024-10-11 03:40:24,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311479508] [2024-10-11 03:40:24,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:40:24,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-11 03:40:24,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:24,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-11 03:40:24,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1160, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 03:40:24,198 INFO L87 Difference]: Start difference. First operand 46216 states and 54869 transitions. Second operand has 37 states, 37 states have (on average 7.72972972972973) internal successors, (286), 36 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:40:26,509 INFO L93 Difference]: Finished difference Result 163504 states and 194446 transitions. [2024-10-11 03:40:26,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-11 03:40:26,510 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 7.72972972972973) internal successors, (286), 36 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-10-11 03:40:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:40:26,659 INFO L225 Difference]: With dead ends: 163504 [2024-10-11 03:40:26,659 INFO L226 Difference]: Without dead ends: 125472 [2024-10-11 03:40:26,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=808, Invalid=3482, Unknown=0, NotChecked=0, Total=4290 [2024-10-11 03:40:26,711 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 3338 mSDsluCounter, 3129 mSDsCounter, 0 mSdLazyCounter, 2725 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3338 SdHoareTripleChecker+Valid, 3328 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:40:26,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3338 Valid, 3328 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2725 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:40:26,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125472 states. [2024-10-11 03:40:27,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125472 to 47203. [2024-10-11 03:40:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47203 states, 47202 states have (on average 1.1866658192449473) internal successors, (56013), 47202 states have internal predecessors, (56013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47203 states to 47203 states and 56013 transitions. [2024-10-11 03:40:27,794 INFO L78 Accepts]: Start accepts. Automaton has 47203 states and 56013 transitions. Word has length 105 [2024-10-11 03:40:27,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:40:27,794 INFO L471 AbstractCegarLoop]: Abstraction has 47203 states and 56013 transitions. [2024-10-11 03:40:27,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 7.72972972972973) internal successors, (286), 36 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:40:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 47203 states and 56013 transitions. [2024-10-11 03:40:27,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 03:40:27,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:40:27,803 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:40:27,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 03:40:28,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-10-11 03:40:28,004 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:40:28,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:40:28,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1448035695, now seen corresponding path program 1 times [2024-10-11 03:40:28,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:40:28,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126670162] [2024-10-11 03:40:28,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:28,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:40:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:28,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:40:28,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126670162] [2024-10-11 03:40:28,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126670162] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:40:28,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599962580] [2024-10-11 03:40:28,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:40:28,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:40:28,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:40:28,583 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:40:28,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 03:40:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:40:28,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 03:40:28,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:40:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:29,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:40:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:40:30,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599962580] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:40:30,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:40:30,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 13] total 34 [2024-10-11 03:40:30,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083860063] [2024-10-11 03:40:30,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:40:30,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-11 03:40:30,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:40:30,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-11 03:40:30,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 03:40:30,352 INFO L87 Difference]: Start difference. First operand 47203 states and 56013 transitions. Second operand has 34 states, 34 states have (on average 8.558823529411764) internal successors, (291), 34 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)