./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.4.ufo.UNBOUNDED.pals.c.v+cfa-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.4.ufo.UNBOUNDED.pals.c.v+cfa-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 5a6204b8fe11d129da43c7784d578168196f39a9dd912e242b1920607a0dfe2c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:47:27,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:47:27,092 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:47:27,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:47:27,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:47:27,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:47:27,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:47:27,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:47:27,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:47:27,123 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:47:27,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:47:27,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:47:27,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:47:27,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:47:27,128 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:47:27,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:47:27,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:47:27,129 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:47:27,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:47:27,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:47:27,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:47:27,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:47:27,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:47:27,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:47:27,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:47:27,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:47:27,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:47:27,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:47:27,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:47:27,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:47:27,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:47:27,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:47:27,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:47:27,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:47:27,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:47:27,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:47:27,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:47:27,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:47:27,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:47:27,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:47:27,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:47:27,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:47:27,138 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 -> 5a6204b8fe11d129da43c7784d578168196f39a9dd912e242b1920607a0dfe2c [2024-10-11 03:47:27,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:47:27,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:47:27,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:47:27,432 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:47:27,432 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:47:27,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-11 03:47:28,875 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:47:29,092 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:47:29,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-11 03:47:29,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/06e60c4f9/e9066e5f2c3d4c5ba8b629eb3075a706/FLAG0d5f92fd2 [2024-10-11 03:47:29,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/06e60c4f9/e9066e5f2c3d4c5ba8b629eb3075a706 [2024-10-11 03:47:29,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:47:29,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:47:29,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:47:29,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:47:29,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:47:29,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:47:29" (1/1) ... [2024-10-11 03:47:29,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28b515ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:29, skipping insertion in model container [2024-10-11 03:47:29,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:47:29" (1/1) ... [2024-10-11 03:47:29,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:47:29,410 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.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4938,4951] [2024-10-11 03:47:29,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:47:29,470 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:47:29,514 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.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4938,4951] [2024-10-11 03:47:29,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:47:29,553 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:47:29,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:29 WrapperNode [2024-10-11 03:47:29,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:47:29,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:47:29,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:47:29,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:47:29,564 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:47:29" (1/1) ... [2024-10-11 03:47:29,572 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:47:29" (1/1) ... [2024-10-11 03:47:29,603 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 369 [2024-10-11 03:47:29,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:47:29,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:47:29,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:47:29,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:47:29,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:29" (1/1) ... [2024-10-11 03:47:29,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:29" (1/1) ... [2024-10-11 03:47:29,618 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:29" (1/1) ... [2024-10-11 03:47:29,646 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:47:29,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:29" (1/1) ... [2024-10-11 03:47:29,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:29" (1/1) ... [2024-10-11 03:47:29,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:29" (1/1) ... [2024-10-11 03:47:29,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:29" (1/1) ... [2024-10-11 03:47:29,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:29" (1/1) ... [2024-10-11 03:47:29,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:29" (1/1) ... [2024-10-11 03:47:29,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:47:29,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:47:29,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:47:29,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:47:29,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:29" (1/1) ... [2024-10-11 03:47:29,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:47:29,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:47:29,706 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:47:29,709 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:47:29,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:47:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:47:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:47:29,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:47:29,869 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:47:29,871 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:47:30,285 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-10-11 03:47:30,285 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:47:30,322 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:47:30,323 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:47:30,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:47:30 BoogieIcfgContainer [2024-10-11 03:47:30,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:47:30,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:47:30,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:47:30,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:47:30,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:47:29" (1/3) ... [2024-10-11 03:47:30,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372f67e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:47:30, skipping insertion in model container [2024-10-11 03:47:30,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:29" (2/3) ... [2024-10-11 03:47:30,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372f67e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:47:30, skipping insertion in model container [2024-10-11 03:47:30,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:47:30" (3/3) ... [2024-10-11 03:47:30,336 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-11 03:47:30,349 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:47:30,349 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:47:30,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:47:30,411 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;@9d1a74d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:47:30,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:47:30,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 77 states have (on average 1.7272727272727273) internal successors, (133), 78 states have internal predecessors, (133), 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:47:30,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 03:47:30,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:30,424 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:47:30,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:30,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:30,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1629204617, now seen corresponding path program 1 times [2024-10-11 03:47:30,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:30,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13402164] [2024-10-11 03:47:30,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:30,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:30,815 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:47:30,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:30,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13402164] [2024-10-11 03:47:30,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13402164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:30,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:30,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:47:30,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365726575] [2024-10-11 03:47:30,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:30,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:47:30,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:30,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:47:30,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:47:30,842 INFO L87 Difference]: Start difference. First operand has 79 states, 77 states have (on average 1.7272727272727273) internal successors, (133), 78 states have internal predecessors, (133), 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 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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:47:30,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:30,903 INFO L93 Difference]: Finished difference Result 179 states and 288 transitions. [2024-10-11 03:47:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:47:30,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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:47:30,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:30,914 INFO L225 Difference]: With dead ends: 179 [2024-10-11 03:47:30,914 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 03:47:30,917 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:47:30,920 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 83 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:30,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 265 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 03:47:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2024-10-11 03:47:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4745762711864407) internal successors, (174), 118 states have internal predecessors, (174), 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:47:30,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2024-10-11 03:47:30,956 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 174 transitions. Word has length 47 [2024-10-11 03:47:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:30,956 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 174 transitions. [2024-10-11 03:47:30,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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:47:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 174 transitions. [2024-10-11 03:47:30,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:47:30,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:30,959 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] [2024-10-11 03:47:30,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:47:30,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:30,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:30,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1771605490, now seen corresponding path program 1 times [2024-10-11 03:47:30,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:30,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714827483] [2024-10-11 03:47:30,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:30,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:31,099 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:47:31,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:31,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714827483] [2024-10-11 03:47:31,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714827483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:31,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:31,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:47:31,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654162929] [2024-10-11 03:47:31,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:31,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:47:31,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:31,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:47:31,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:47:31,107 INFO L87 Difference]: Start difference. First operand 119 states and 174 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:47:31,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:31,143 INFO L93 Difference]: Finished difference Result 291 states and 446 transitions. [2024-10-11 03:47:31,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:47:31,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2024-10-11 03:47:31,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:31,146 INFO L225 Difference]: With dead ends: 291 [2024-10-11 03:47:31,146 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 03:47:31,147 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:47:31,149 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 62 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:31,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 229 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 03:47:31,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2024-10-11 03:47:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.5154639175257731) internal successors, (294), 194 states have internal predecessors, (294), 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:47:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 294 transitions. [2024-10-11 03:47:31,167 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 294 transitions. Word has length 48 [2024-10-11 03:47:31,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:31,167 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 294 transitions. [2024-10-11 03:47:31,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:47:31,168 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 294 transitions. [2024-10-11 03:47:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:47:31,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:31,169 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] [2024-10-11 03:47:31,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:47:31,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:31,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:31,171 INFO L85 PathProgramCache]: Analyzing trace with hash -445382270, now seen corresponding path program 1 times [2024-10-11 03:47:31,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:31,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814686485] [2024-10-11 03:47:31,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:31,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:31,260 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:47:31,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:31,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814686485] [2024-10-11 03:47:31,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814686485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:31,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:31,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:47:31,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360929967] [2024-10-11 03:47:31,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:31,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:47:31,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:31,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:47:31,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:47:31,268 INFO L87 Difference]: Start difference. First operand 195 states and 294 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:47:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:31,289 INFO L93 Difference]: Finished difference Result 503 states and 780 transitions. [2024-10-11 03:47:31,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:47:31,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 49 [2024-10-11 03:47:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:31,295 INFO L225 Difference]: With dead ends: 503 [2024-10-11 03:47:31,296 INFO L226 Difference]: Without dead ends: 333 [2024-10-11 03:47:31,297 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:47:31,298 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 57 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:31,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 225 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:31,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-11 03:47:31,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2024-10-11 03:47:31,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.5333333333333334) internal successors, (506), 330 states have internal predecessors, (506), 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:47:31,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 506 transitions. [2024-10-11 03:47:31,321 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 506 transitions. Word has length 49 [2024-10-11 03:47:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:31,321 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 506 transitions. [2024-10-11 03:47:31,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:47:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 506 transitions. [2024-10-11 03:47:31,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:47:31,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:31,323 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:47:31,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:47:31,323 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:31,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:31,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1984957637, now seen corresponding path program 1 times [2024-10-11 03:47:31,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:31,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701086434] [2024-10-11 03:47:31,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:31,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:31,583 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:47:31,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:31,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701086434] [2024-10-11 03:47:31,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701086434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:31,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:31,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:47:31,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125436058] [2024-10-11 03:47:31,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:31,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:47:31,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:31,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:47:31,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:47:31,587 INFO L87 Difference]: Start difference. First operand 331 states and 506 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 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:47:31,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:31,784 INFO L93 Difference]: Finished difference Result 2779 states and 4354 transitions. [2024-10-11 03:47:31,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:47:31,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 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:47:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:31,796 INFO L225 Difference]: With dead ends: 2779 [2024-10-11 03:47:31,797 INFO L226 Difference]: Without dead ends: 2473 [2024-10-11 03:47:31,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:47:31,804 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 697 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:31,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1113 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:47:31,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2024-10-11 03:47:31,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 635. [2024-10-11 03:47:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.5299684542586751) internal successors, (970), 634 states have internal predecessors, (970), 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:47:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 970 transitions. [2024-10-11 03:47:31,856 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 970 transitions. Word has length 50 [2024-10-11 03:47:31,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:31,857 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 970 transitions. [2024-10-11 03:47:31,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 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:47:31,857 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 970 transitions. [2024-10-11 03:47:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:47:31,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:31,861 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:47:31,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:47:31,861 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:31,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:31,862 INFO L85 PathProgramCache]: Analyzing trace with hash -322009632, now seen corresponding path program 1 times [2024-10-11 03:47:31,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:31,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255382699] [2024-10-11 03:47:31,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:31,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:32,142 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:47:32,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:32,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255382699] [2024-10-11 03:47:32,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255382699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:32,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:32,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:47:32,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257538822] [2024-10-11 03:47:32,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:32,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:47:32,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:32,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:47:32,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:47:32,144 INFO L87 Difference]: Start difference. First operand 635 states and 970 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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:47:32,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:32,270 INFO L93 Difference]: Finished difference Result 1247 states and 1916 transitions. [2024-10-11 03:47:32,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:47:32,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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:47:32,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:32,274 INFO L225 Difference]: With dead ends: 1247 [2024-10-11 03:47:32,275 INFO L226 Difference]: Without dead ends: 637 [2024-10-11 03:47:32,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:47:32,278 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 116 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:32,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 340 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-11 03:47:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 635. [2024-10-11 03:47:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.5173501577287065) internal successors, (962), 634 states have internal predecessors, (962), 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:47:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 962 transitions. [2024-10-11 03:47:32,295 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 962 transitions. Word has length 52 [2024-10-11 03:47:32,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:32,296 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 962 transitions. [2024-10-11 03:47:32,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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:47:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 962 transitions. [2024-10-11 03:47:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:47:32,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:32,299 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:47:32,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:47:32,300 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:32,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:32,300 INFO L85 PathProgramCache]: Analyzing trace with hash -343012287, now seen corresponding path program 1 times [2024-10-11 03:47:32,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:32,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844118394] [2024-10-11 03:47:32,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:32,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:32,400 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:47:32,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:32,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844118394] [2024-10-11 03:47:32,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844118394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:32,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:32,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:47:32,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522637201] [2024-10-11 03:47:32,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:32,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:47:32,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:32,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:47:32,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:47:32,405 INFO L87 Difference]: Start difference. First operand 635 states and 962 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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:47:32,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:32,437 INFO L93 Difference]: Finished difference Result 1767 states and 2684 transitions. [2024-10-11 03:47:32,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:47:32,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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:47:32,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:32,444 INFO L225 Difference]: With dead ends: 1767 [2024-10-11 03:47:32,444 INFO L226 Difference]: Without dead ends: 1157 [2024-10-11 03:47:32,445 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:47:32,449 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 47 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 179 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:47:32,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 179 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:32,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-10-11 03:47:32,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1139. [2024-10-11 03:47:32,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.4850615114235501) internal successors, (1690), 1138 states have internal predecessors, (1690), 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:47:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1690 transitions. [2024-10-11 03:47:32,474 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1690 transitions. Word has length 52 [2024-10-11 03:47:32,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:32,476 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1690 transitions. [2024-10-11 03:47:32,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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:47:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1690 transitions. [2024-10-11 03:47:32,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:47:32,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:32,477 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] [2024-10-11 03:47:32,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:47:32,478 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:32,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:32,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1394273389, now seen corresponding path program 1 times [2024-10-11 03:47:32,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:32,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305548838] [2024-10-11 03:47:32,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:32,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:32,607 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:47:32,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:32,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305548838] [2024-10-11 03:47:32,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305548838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:32,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:32,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:47:32,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588126754] [2024-10-11 03:47:32,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:32,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:47:32,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:32,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:47:32,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:47:32,610 INFO L87 Difference]: Start difference. First operand 1139 states and 1690 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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:47:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:32,679 INFO L93 Difference]: Finished difference Result 2253 states and 3355 transitions. [2024-10-11 03:47:32,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:47:32,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2024-10-11 03:47:32,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:32,683 INFO L225 Difference]: With dead ends: 2253 [2024-10-11 03:47:32,683 INFO L226 Difference]: Without dead ends: 1139 [2024-10-11 03:47:32,685 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:47:32,685 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 258 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:32,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 84 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:32,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-10-11 03:47:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2024-10-11 03:47:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.4710017574692442) internal successors, (1674), 1138 states have internal predecessors, (1674), 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:47:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1674 transitions. [2024-10-11 03:47:32,708 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1674 transitions. Word has length 53 [2024-10-11 03:47:32,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:32,709 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1674 transitions. [2024-10-11 03:47:32,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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:47:32,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1674 transitions. [2024-10-11 03:47:32,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:47:32,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:32,711 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] [2024-10-11 03:47:32,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:47:32,711 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:32,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:32,712 INFO L85 PathProgramCache]: Analyzing trace with hash -528741000, now seen corresponding path program 1 times [2024-10-11 03:47:32,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:32,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330083258] [2024-10-11 03:47:32,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:32,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:32,810 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:47:32,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:32,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330083258] [2024-10-11 03:47:32,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330083258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:32,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:32,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:47:32,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352458013] [2024-10-11 03:47:32,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:32,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:47:32,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:32,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:47:32,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:47:32,814 INFO L87 Difference]: Start difference. First operand 1139 states and 1674 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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:47:32,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:32,892 INFO L93 Difference]: Finished difference Result 2253 states and 3323 transitions. [2024-10-11 03:47:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:47:32,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2024-10-11 03:47:32,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:32,897 INFO L225 Difference]: With dead ends: 2253 [2024-10-11 03:47:32,897 INFO L226 Difference]: Without dead ends: 1139 [2024-10-11 03:47:32,898 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:47:32,899 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 242 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:32,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 92 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:47:32,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-10-11 03:47:32,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2024-10-11 03:47:32,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.4569420035149385) internal successors, (1658), 1138 states have internal predecessors, (1658), 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:47:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1658 transitions. [2024-10-11 03:47:32,922 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1658 transitions. Word has length 53 [2024-10-11 03:47:32,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:32,922 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1658 transitions. [2024-10-11 03:47:32,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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:47:32,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1658 transitions. [2024-10-11 03:47:32,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:47:32,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:32,923 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] [2024-10-11 03:47:32,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:47:32,924 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:32,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:32,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1058031501, now seen corresponding path program 1 times [2024-10-11 03:47:32,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:32,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455663080] [2024-10-11 03:47:32,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:32,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:33,023 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:47:33,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:33,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455663080] [2024-10-11 03:47:33,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455663080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:33,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:33,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:47:33,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039722860] [2024-10-11 03:47:33,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:33,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:47:33,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:33,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:47:33,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:47:33,026 INFO L87 Difference]: Start difference. First operand 1139 states and 1658 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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:47:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:33,102 INFO L93 Difference]: Finished difference Result 2253 states and 3291 transitions. [2024-10-11 03:47:33,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:47:33,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2024-10-11 03:47:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:33,109 INFO L225 Difference]: With dead ends: 2253 [2024-10-11 03:47:33,109 INFO L226 Difference]: Without dead ends: 1139 [2024-10-11 03:47:33,110 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:47:33,111 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:33,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 76 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:33,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-10-11 03:47:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2024-10-11 03:47:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.4428822495606326) internal successors, (1642), 1138 states have internal predecessors, (1642), 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:47:33,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1642 transitions. [2024-10-11 03:47:33,133 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1642 transitions. Word has length 53 [2024-10-11 03:47:33,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:33,133 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1642 transitions. [2024-10-11 03:47:33,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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:47:33,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1642 transitions. [2024-10-11 03:47:33,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:47:33,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:33,134 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] [2024-10-11 03:47:33,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:47:33,134 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:33,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:33,135 INFO L85 PathProgramCache]: Analyzing trace with hash -929946194, now seen corresponding path program 1 times [2024-10-11 03:47:33,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:33,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474211658] [2024-10-11 03:47:33,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:33,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:33,352 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:47:33,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:33,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474211658] [2024-10-11 03:47:33,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474211658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:33,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:33,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:47:33,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573336425] [2024-10-11 03:47:33,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:33,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:47:33,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:33,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:47:33,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:47:33,355 INFO L87 Difference]: Start difference. First operand 1139 states and 1642 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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:47:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:33,379 INFO L93 Difference]: Finished difference Result 1173 states and 1691 transitions. [2024-10-11 03:47:33,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:47:33,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2024-10-11 03:47:33,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:33,383 INFO L225 Difference]: With dead ends: 1173 [2024-10-11 03:47:33,383 INFO L226 Difference]: Without dead ends: 1171 [2024-10-11 03:47:33,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:47:33,385 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:33,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2024-10-11 03:47:33,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1171. [2024-10-11 03:47:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1170 states have (on average 1.423931623931624) internal successors, (1666), 1170 states have internal predecessors, (1666), 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:47:33,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1666 transitions. [2024-10-11 03:47:33,408 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1666 transitions. Word has length 53 [2024-10-11 03:47:33,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:33,409 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1666 transitions. [2024-10-11 03:47:33,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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:47:33,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1666 transitions. [2024-10-11 03:47:33,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:47:33,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:33,410 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] [2024-10-11 03:47:33,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:47:33,410 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:33,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:33,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1102304960, now seen corresponding path program 1 times [2024-10-11 03:47:33,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:33,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908905716] [2024-10-11 03:47:33,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:33,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:33,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:47:33,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:33,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908905716] [2024-10-11 03:47:33,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908905716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:33,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:33,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:47:33,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681845756] [2024-10-11 03:47:33,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:33,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:47:33,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:33,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:47:33,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:47:33,479 INFO L87 Difference]: Start difference. First operand 1171 states and 1666 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:47:33,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:33,500 INFO L93 Difference]: Finished difference Result 2298 states and 3304 transitions. [2024-10-11 03:47:33,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:47:33,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 53 [2024-10-11 03:47:33,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:33,506 INFO L225 Difference]: With dead ends: 2298 [2024-10-11 03:47:33,506 INFO L226 Difference]: Without dead ends: 1655 [2024-10-11 03:47:33,507 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:47:33,508 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 66 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:33,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 232 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2024-10-11 03:47:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1653. [2024-10-11 03:47:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1652 states have (on average 1.4164648910411621) internal successors, (2340), 1652 states have internal predecessors, (2340), 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:47:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2340 transitions. [2024-10-11 03:47:33,539 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2340 transitions. Word has length 53 [2024-10-11 03:47:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:33,540 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 2340 transitions. [2024-10-11 03:47:33,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:47:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2340 transitions. [2024-10-11 03:47:33,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:47:33,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:33,541 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] [2024-10-11 03:47:33,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:47:33,542 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:33,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:33,542 INFO L85 PathProgramCache]: Analyzing trace with hash -363391418, now seen corresponding path program 1 times [2024-10-11 03:47:33,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:33,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983171116] [2024-10-11 03:47:33,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:33,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 03:47:33,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:33,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983171116] [2024-10-11 03:47:33,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983171116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:33,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:33,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:47:33,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110196019] [2024-10-11 03:47:33,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:33,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:47:33,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:33,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:47:33,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:47:33,673 INFO L87 Difference]: Start difference. First operand 1653 states and 2340 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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:47:33,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:33,788 INFO L93 Difference]: Finished difference Result 8471 states and 12021 transitions. [2024-10-11 03:47:33,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:47:33,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 76 [2024-10-11 03:47:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:33,811 INFO L225 Difference]: With dead ends: 8471 [2024-10-11 03:47:33,812 INFO L226 Difference]: Without dead ends: 6845 [2024-10-11 03:47:33,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:47:33,816 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 489 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:33,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 546 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:47:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6845 states. [2024-10-11 03:47:33,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6845 to 3277. [2024-10-11 03:47:33,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3277 states, 3276 states have (on average 1.4126984126984128) internal successors, (4628), 3276 states have internal predecessors, (4628), 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:47:33,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3277 states to 3277 states and 4628 transitions. [2024-10-11 03:47:33,913 INFO L78 Accepts]: Start accepts. Automaton has 3277 states and 4628 transitions. Word has length 76 [2024-10-11 03:47:33,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:33,913 INFO L471 AbstractCegarLoop]: Abstraction has 3277 states and 4628 transitions. [2024-10-11 03:47:33,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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:47:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3277 states and 4628 transitions. [2024-10-11 03:47:33,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:47:33,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:33,915 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] [2024-10-11 03:47:33,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:47:33,915 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:33,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:33,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1517337524, now seen corresponding path program 1 times [2024-10-11 03:47:33,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:33,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955299686] [2024-10-11 03:47:33,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:33,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 03:47:34,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:34,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955299686] [2024-10-11 03:47:34,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955299686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:34,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:34,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:47:34,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567976032] [2024-10-11 03:47:34,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:34,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:47:34,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:34,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:47:34,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:47:34,074 INFO L87 Difference]: Start difference. First operand 3277 states and 4628 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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:47:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:34,196 INFO L93 Difference]: Finished difference Result 10095 states and 14309 transitions. [2024-10-11 03:47:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:47:34,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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 76 [2024-10-11 03:47:34,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:34,232 INFO L225 Difference]: With dead ends: 10095 [2024-10-11 03:47:34,232 INFO L226 Difference]: Without dead ends: 8469 [2024-10-11 03:47:34,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:47:34,237 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 472 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:34,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 575 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:47:34,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8469 states. [2024-10-11 03:47:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8469 to 5717. [2024-10-11 03:47:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5717 states, 5716 states have (on average 1.4065780265920225) internal successors, (8040), 5716 states have internal predecessors, (8040), 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:47:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5717 states to 5717 states and 8040 transitions. [2024-10-11 03:47:34,354 INFO L78 Accepts]: Start accepts. Automaton has 5717 states and 8040 transitions. Word has length 76 [2024-10-11 03:47:34,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:34,355 INFO L471 AbstractCegarLoop]: Abstraction has 5717 states and 8040 transitions. [2024-10-11 03:47:34,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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:47:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 5717 states and 8040 transitions. [2024-10-11 03:47:34,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:47:34,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:34,356 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] [2024-10-11 03:47:34,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:47:34,357 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:34,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:34,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1221292096, now seen corresponding path program 1 times [2024-10-11 03:47:34,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:34,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680865968] [2024-10-11 03:47:34,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:34,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 03:47:34,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:34,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680865968] [2024-10-11 03:47:34,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680865968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:34,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:34,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:47:34,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192675517] [2024-10-11 03:47:34,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:34,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:47:34,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:34,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:47:34,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:47:34,483 INFO L87 Difference]: Start difference. First operand 5717 states and 8040 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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:47:34,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:34,597 INFO L93 Difference]: Finished difference Result 11719 states and 16597 transitions. [2024-10-11 03:47:34,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:47:34,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 76 [2024-10-11 03:47:34,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:34,644 INFO L225 Difference]: With dead ends: 11719 [2024-10-11 03:47:34,644 INFO L226 Difference]: Without dead ends: 10093 [2024-10-11 03:47:34,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:47:34,647 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 441 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:34,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 643 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:47:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2024-10-11 03:47:34,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 7341. [2024-10-11 03:47:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7341 states, 7340 states have (on average 1.40708446866485) internal successors, (10328), 7340 states have internal predecessors, (10328), 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:47:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7341 states to 7341 states and 10328 transitions. [2024-10-11 03:47:34,758 INFO L78 Accepts]: Start accepts. Automaton has 7341 states and 10328 transitions. Word has length 76 [2024-10-11 03:47:34,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:34,758 INFO L471 AbstractCegarLoop]: Abstraction has 7341 states and 10328 transitions. [2024-10-11 03:47:34,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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:47:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 7341 states and 10328 transitions. [2024-10-11 03:47:34,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:47:34,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:34,760 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] [2024-10-11 03:47:34,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:47:34,761 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:34,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:34,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1706727076, now seen corresponding path program 1 times [2024-10-11 03:47:34,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:34,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788389782] [2024-10-11 03:47:34,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:34,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:47:34,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:34,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788389782] [2024-10-11 03:47:34,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788389782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:34,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:34,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:47:34,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106087939] [2024-10-11 03:47:34,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:34,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:47:34,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:34,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:47:34,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:47:34,888 INFO L87 Difference]: Start difference. First operand 7341 states and 10328 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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:47:35,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:35,007 INFO L93 Difference]: Finished difference Result 12335 states and 17493 transitions. [2024-10-11 03:47:35,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:47:35,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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 77 [2024-10-11 03:47:35,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:35,025 INFO L225 Difference]: With dead ends: 12335 [2024-10-11 03:47:35,026 INFO L226 Difference]: Without dead ends: 11213 [2024-10-11 03:47:35,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:47:35,062 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 432 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:35,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 600 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:47:35,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11213 states. [2024-10-11 03:47:35,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11213 to 8461. [2024-10-11 03:47:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8461 states, 8460 states have (on average 1.4099290780141844) internal successors, (11928), 8460 states have internal predecessors, (11928), 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:47:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 11928 transitions. [2024-10-11 03:47:35,179 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 11928 transitions. Word has length 77 [2024-10-11 03:47:35,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:35,180 INFO L471 AbstractCegarLoop]: Abstraction has 8461 states and 11928 transitions. [2024-10-11 03:47:35,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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:47:35,181 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 11928 transitions. [2024-10-11 03:47:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:47:35,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:35,183 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-10-11 03:47:35,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:47:35,184 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:35,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:35,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2067346209, now seen corresponding path program 1 times [2024-10-11 03:47:35,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:35,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347979140] [2024-10-11 03:47:35,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:35,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:35,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:35,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347979140] [2024-10-11 03:47:35,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347979140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:35,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:35,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:47:35,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222446898] [2024-10-11 03:47:35,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:35,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:47:35,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:35,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:47:35,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:47:35,277 INFO L87 Difference]: Start difference. First operand 8461 states and 11928 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:47:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:35,318 INFO L93 Difference]: Finished difference Result 14657 states and 20768 transitions. [2024-10-11 03:47:35,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:47:35,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2024-10-11 03:47:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:35,327 INFO L225 Difference]: With dead ends: 14657 [2024-10-11 03:47:35,328 INFO L226 Difference]: Without dead ends: 6223 [2024-10-11 03:47:35,335 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:47:35,335 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 48 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:35,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:47:35,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6223 states. [2024-10-11 03:47:35,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6223 to 6221. [2024-10-11 03:47:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6221 states, 6220 states have (on average 1.4110932475884244) internal successors, (8777), 6220 states have internal predecessors, (8777), 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:47:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 8777 transitions. [2024-10-11 03:47:35,468 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 8777 transitions. Word has length 78 [2024-10-11 03:47:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:35,468 INFO L471 AbstractCegarLoop]: Abstraction has 6221 states and 8777 transitions. [2024-10-11 03:47:35,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:47:35,469 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 8777 transitions. [2024-10-11 03:47:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:47:35,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:35,471 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:47:35,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:47:35,471 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:35,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:35,472 INFO L85 PathProgramCache]: Analyzing trace with hash 652706646, now seen corresponding path program 1 times [2024-10-11 03:47:35,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:35,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952302081] [2024-10-11 03:47:35,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:35,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:35,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:35,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952302081] [2024-10-11 03:47:35,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952302081] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:47:35,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847005579] [2024-10-11 03:47:35,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:35,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:47:35,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:47:35,945 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:47:35,947 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:47:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:36,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 03:47:36,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:47:36,765 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:36,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:47:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:37,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847005579] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:47:37,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:47:37,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 27 [2024-10-11 03:47:37,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239811001] [2024-10-11 03:47:37,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:47:37,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 03:47:37,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:37,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 03:47:37,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:47:37,615 INFO L87 Difference]: Start difference. First operand 6221 states and 8777 transitions. Second operand has 28 states, 28 states have (on average 7.285714285714286) internal successors, (204), 27 states have internal predecessors, (204), 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:47:47,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:47,813 INFO L93 Difference]: Finished difference Result 118850 states and 165178 transitions. [2024-10-11 03:47:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2024-10-11 03:47:47,815 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.285714285714286) internal successors, (204), 27 states have internal predecessors, (204), 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 78 [2024-10-11 03:47:47,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:48,071 INFO L225 Difference]: With dead ends: 118850 [2024-10-11 03:47:48,072 INFO L226 Difference]: Without dead ends: 112658 [2024-10-11 03:47:48,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25974 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=7534, Invalid=56222, Unknown=0, NotChecked=0, Total=63756 [2024-10-11 03:47:48,113 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 5293 mSDsluCounter, 1962 mSDsCounter, 0 mSdLazyCounter, 2910 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5293 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:48,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5293 Valid, 2080 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2910 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 03:47:48,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112658 states. [2024-10-11 03:47:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112658 to 69942. [2024-10-11 03:47:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69942 states, 69941 states have (on average 1.3927167183769178) internal successors, (97408), 69941 states have internal predecessors, (97408), 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:47:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69942 states to 69942 states and 97408 transitions. [2024-10-11 03:47:49,559 INFO L78 Accepts]: Start accepts. Automaton has 69942 states and 97408 transitions. Word has length 78 [2024-10-11 03:47:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:49,559 INFO L471 AbstractCegarLoop]: Abstraction has 69942 states and 97408 transitions. [2024-10-11 03:47:49,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.285714285714286) internal successors, (204), 27 states have internal predecessors, (204), 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:47:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 69942 states and 97408 transitions. [2024-10-11 03:47:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 03:47:49,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:49,565 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] [2024-10-11 03:47:49,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 03:47:49,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 03:47:49,766 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:47:49,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:49,766 INFO L85 PathProgramCache]: Analyzing trace with hash 282670764, now seen corresponding path program 1 times [2024-10-11 03:47:49,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:49,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227765083] [2024-10-11 03:47:49,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:49,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:50,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:50,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227765083] [2024-10-11 03:47:50,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227765083] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:47:50,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606555741] [2024-10-11 03:47:50,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:50,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:47:50,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:47:50,545 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:47:50,546 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:47:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:50,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 03:47:50,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:47:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:51,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:47:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:52,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606555741] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:47:52,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:47:52,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2024-10-11 03:47:52,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011179685] [2024-10-11 03:47:52,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:47:52,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 03:47:52,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:52,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 03:47:52,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2024-10-11 03:47:52,475 INFO L87 Difference]: Start difference. First operand 69942 states and 97408 transitions. Second operand has 29 states, 29 states have (on average 7.068965517241379) internal successors, (205), 28 states have internal predecessors, (205), 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:47:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:59,858 INFO L93 Difference]: Finished difference Result 299845 states and 414369 transitions. [2024-10-11 03:47:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2024-10-11 03:47:59,859 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.068965517241379) internal successors, (205), 28 states have internal predecessors, (205), 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 79 [2024-10-11 03:47:59,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:00,287 INFO L225 Difference]: With dead ends: 299845 [2024-10-11 03:48:00,288 INFO L226 Difference]: Without dead ends: 230037 [2024-10-11 03:48:00,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6577 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3015, Invalid=16725, Unknown=0, NotChecked=0, Total=19740 [2024-10-11 03:48:00,376 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 4771 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4771 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 2475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:00,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4771 Valid, 1996 Invalid, 2475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 03:48:00,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230037 states. [2024-10-11 03:48:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230037 to 159636. [2024-10-11 03:48:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159636 states, 159635 states have (on average 1.385122310270304) internal successors, (221114), 159635 states have internal predecessors, (221114), 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:48:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159636 states to 159636 states and 221114 transitions. [2024-10-11 03:48:03,679 INFO L78 Accepts]: Start accepts. Automaton has 159636 states and 221114 transitions. Word has length 79 [2024-10-11 03:48:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:03,680 INFO L471 AbstractCegarLoop]: Abstraction has 159636 states and 221114 transitions. [2024-10-11 03:48:03,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.068965517241379) internal successors, (205), 28 states have internal predecessors, (205), 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:48:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 159636 states and 221114 transitions. [2024-10-11 03:48:03,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 03:48:03,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:03,685 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] [2024-10-11 03:48:03,699 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:48:03,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 03:48:03,885 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:48:03,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:03,886 INFO L85 PathProgramCache]: Analyzing trace with hash -777962760, now seen corresponding path program 1 times [2024-10-11 03:48:03,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:03,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879254141] [2024-10-11 03:48:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:03,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:04,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:04,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879254141] [2024-10-11 03:48:04,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879254141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:48:04,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499294912] [2024-10-11 03:48:04,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:04,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:48:04,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:48:04,447 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:48:04,448 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:48:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:04,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 03:48:04,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:48:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:06,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:48:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:07,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499294912] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:48:07,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:48:07,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 17] total 39 [2024-10-11 03:48:07,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245645334] [2024-10-11 03:48:07,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:48:07,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-11 03:48:07,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:07,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-11 03:48:07,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1386, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 03:48:07,903 INFO L87 Difference]: Start difference. First operand 159636 states and 221114 transitions. Second operand has 40 states, 40 states have (on average 5.45) internal successors, (218), 39 states have internal predecessors, (218), 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)