./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label22.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label22.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 782212e92ca4a15b07e81f4c0ca47da63585acb1e5a128bc81275e5c438e9fe1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:10:58,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:10:58,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:10:58,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:10:58,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:10:58,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:10:58,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:10:58,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:10:58,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:10:58,478 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:10:58,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:10:58,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:10:58,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:10:58,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:10:58,481 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:10:58,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:10:58,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:10:58,482 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:10:58,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:10:58,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:10:58,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:10:58,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:10:58,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:10:58,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:10:58,485 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:10:58,486 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:10:58,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:10:58,486 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:10:58,486 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:10:58,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:10:58,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:10:58,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:10:58,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:10:58,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:10:58,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:10:58,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:10:58,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:10:58,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:10:58,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:10:58,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:10:58,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:10:58,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:10:58,489 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/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/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 -> 782212e92ca4a15b07e81f4c0ca47da63585acb1e5a128bc81275e5c438e9fe1 [2024-11-08 11:10:58,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:10:58,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:10:58,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:10:58,709 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:10:58,709 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:10:58,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label22.c [2024-11-08 11:10:59,866 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:11:00,092 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:11:00,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label22.c [2024-11-08 11:11:00,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81308444c/b66b345299d342acb35711f15eaace03/FLAG3dd5e94ca [2024-11-08 11:11:00,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81308444c/b66b345299d342acb35711f15eaace03 [2024-11-08 11:11:00,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:11:00,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:11:00,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:11:00,438 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:11:00,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:11:00,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:00" (1/1) ... [2024-11-08 11:11:00,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b677127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00, skipping insertion in model container [2024-11-08 11:11:00,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:00" (1/1) ... [2024-11-08 11:11:00,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:11:00,671 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label22.c[8004,8017] [2024-11-08 11:11:00,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:11:00,833 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:11:00,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label22.c[8004,8017] [2024-11-08 11:11:00,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:11:00,969 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:11:00,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00 WrapperNode [2024-11-08 11:11:00,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:11:00,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:11:00,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:11:00,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:11:00,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 11:11:00,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 11:11:01,058 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-08 11:11:01,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:11:01,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:11:01,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:11:01,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:11:01,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 11:11:01,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 11:11:01,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 11:11:01,169 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-11-08 11:11:01,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 11:11:01,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 11:11:01,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 11:11:01,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 11:11:01,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 11:11:01,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 11:11:01,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:11:01,250 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:11:01,250 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:11:01,250 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:11:01,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (1/1) ... [2024-11-08 11:11:01,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:11:01,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:11:01,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:11:01,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:11:01,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:11:01,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:11:01,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:11:01,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:11:01,370 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:11:01,372 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:11:02,473 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-08 11:11:02,473 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:11:02,490 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:11:02,491 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:11:02,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:02 BoogieIcfgContainer [2024-11-08 11:11:02,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:11:02,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:11:02,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:11:02,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:11:02,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:11:00" (1/3) ... [2024-11-08 11:11:02,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77202ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:11:02, skipping insertion in model container [2024-11-08 11:11:02,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:00" (2/3) ... [2024-11-08 11:11:02,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77202ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:11:02, skipping insertion in model container [2024-11-08 11:11:02,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:02" (3/3) ... [2024-11-08 11:11:02,498 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label22.c [2024-11-08 11:11:02,511 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:11:02,511 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:11:02,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:11:02,574 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;@7f4a7c68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:11:02,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:11:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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-11-08 11:11:02,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 11:11:02,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:02,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:11:02,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:02,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:02,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1246856209, now seen corresponding path program 1 times [2024-11-08 11:11:02,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:02,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777623881] [2024-11-08 11:11:02,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:02,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:11:02,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:02,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777623881] [2024-11-08 11:11:02,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777623881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:02,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:02,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:11:02,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907588461] [2024-11-08 11:11:02,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:02,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:02,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:02,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:02,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:02,904 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:03,770 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2024-11-08 11:11:03,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:03,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-08 11:11:03,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:03,780 INFO L225 Difference]: With dead ends: 761 [2024-11-08 11:11:03,781 INFO L226 Difference]: Without dead ends: 413 [2024-11-08 11:11:03,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-08 11:11:03,785 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 173 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:03,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:11:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-08 11:11:03,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2024-11-08 11:11:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 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-11-08 11:11:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2024-11-08 11:11:03,836 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 55 [2024-11-08 11:11:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:03,837 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2024-11-08 11:11:03,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2024-11-08 11:11:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 11:11:03,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:03,841 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:03,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:11:03,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:03,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:03,842 INFO L85 PathProgramCache]: Analyzing trace with hash -149441032, now seen corresponding path program 1 times [2024-11-08 11:11:03,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:03,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906597194] [2024-11-08 11:11:03,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:03,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:11:04,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:04,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906597194] [2024-11-08 11:11:04,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906597194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:04,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:04,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:11:04,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211636921] [2024-11-08 11:11:04,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:04,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:04,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:04,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:04,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:04,010 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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-11-08 11:11:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:04,561 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2024-11-08 11:11:04,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:04,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 123 [2024-11-08 11:11:04,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:04,565 INFO L225 Difference]: With dead ends: 1211 [2024-11-08 11:11:04,565 INFO L226 Difference]: Without dead ends: 800 [2024-11-08 11:11:04,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-08 11:11:04,571 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:04,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:11:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-08 11:11:04,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2024-11-08 11:11:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 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-11-08 11:11:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2024-11-08 11:11:04,595 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 123 [2024-11-08 11:11:04,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:04,595 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2024-11-08 11:11:04,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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-11-08 11:11:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2024-11-08 11:11:04,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 11:11:04,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:04,598 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:04,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:11:04,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:04,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:04,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1649165251, now seen corresponding path program 1 times [2024-11-08 11:11:04,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:04,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087778414] [2024-11-08 11:11:04,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:04,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:11:04,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:04,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087778414] [2024-11-08 11:11:04,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087778414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:04,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:04,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:11:04,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038547557] [2024-11-08 11:11:04,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:04,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:04,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:04,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:04,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:04,864 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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-11-08 11:11:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:05,403 INFO L93 Difference]: Finished difference Result 1945 states and 2612 transitions. [2024-11-08 11:11:05,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:05,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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 125 [2024-11-08 11:11:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:05,407 INFO L225 Difference]: With dead ends: 1945 [2024-11-08 11:11:05,407 INFO L226 Difference]: Without dead ends: 1158 [2024-11-08 11:11:05,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-08 11:11:05,409 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:05,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:11:05,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-08 11:11:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2024-11-08 11:11:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2707612456747406) internal successors, (1469), 1156 states have internal predecessors, (1469), 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-11-08 11:11:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1469 transitions. [2024-11-08 11:11:05,426 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1469 transitions. Word has length 125 [2024-11-08 11:11:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:05,426 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1469 transitions. [2024-11-08 11:11:05,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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-11-08 11:11:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1469 transitions. [2024-11-08 11:11:05,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-08 11:11:05,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:05,428 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 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-11-08 11:11:05,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:11:05,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:05,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:05,429 INFO L85 PathProgramCache]: Analyzing trace with hash 693126941, now seen corresponding path program 1 times [2024-11-08 11:11:05,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:05,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827493861] [2024-11-08 11:11:05,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:05,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:11:05,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:05,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827493861] [2024-11-08 11:11:05,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827493861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:05,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:05,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:05,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027208991] [2024-11-08 11:11:05,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:05,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:05,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:05,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:05,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:05,670 INFO L87 Difference]: Start difference. First operand 1157 states and 1469 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-11-08 11:11:06,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:06,254 INFO L93 Difference]: Finished difference Result 2519 states and 3349 transitions. [2024-11-08 11:11:06,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:06,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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 182 [2024-11-08 11:11:06,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:06,259 INFO L225 Difference]: With dead ends: 2519 [2024-11-08 11:11:06,259 INFO L226 Difference]: Without dead ends: 1548 [2024-11-08 11:11:06,260 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-11-08 11:11:06,261 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 180 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:06,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:11:06,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2024-11-08 11:11:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1545. [2024-11-08 11:11:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.2933937823834196) internal successors, (1997), 1544 states have internal predecessors, (1997), 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-11-08 11:11:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1997 transitions. [2024-11-08 11:11:06,288 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1997 transitions. Word has length 182 [2024-11-08 11:11:06,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:06,288 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1997 transitions. [2024-11-08 11:11:06,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-11-08 11:11:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1997 transitions. [2024-11-08 11:11:06,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-08 11:11:06,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:06,291 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:06,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:11:06,291 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:06,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:06,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1614618080, now seen corresponding path program 1 times [2024-11-08 11:11:06,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:06,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131109733] [2024-11-08 11:11:06,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:06,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 11:11:06,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:06,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131109733] [2024-11-08 11:11:06,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131109733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:06,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:06,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:06,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396506233] [2024-11-08 11:11:06,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:06,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:06,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:06,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:06,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:06,497 INFO L87 Difference]: Start difference. First operand 1545 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-11-08 11:11:07,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:07,126 INFO L93 Difference]: Finished difference Result 3650 states and 4815 transitions. [2024-11-08 11:11:07,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:07,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 237 [2024-11-08 11:11:07,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:07,132 INFO L225 Difference]: With dead ends: 3650 [2024-11-08 11:11:07,132 INFO L226 Difference]: Without dead ends: 2291 [2024-11-08 11:11:07,133 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-11-08 11:11:07,134 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:07,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 392 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:11:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2024-11-08 11:11:07,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2098. [2024-11-08 11:11:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2097 states have (on average 1.2675250357653791) internal successors, (2658), 2097 states have internal predecessors, (2658), 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-11-08 11:11:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2658 transitions. [2024-11-08 11:11:07,157 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2658 transitions. Word has length 237 [2024-11-08 11:11:07,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:07,158 INFO L471 AbstractCegarLoop]: Abstraction has 2098 states and 2658 transitions. [2024-11-08 11:11:07,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-11-08 11:11:07,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2658 transitions. [2024-11-08 11:11:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-08 11:11:07,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:07,161 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:07,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:11:07,161 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:07,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1116092079, now seen corresponding path program 1 times [2024-11-08 11:11:07,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:07,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039497145] [2024-11-08 11:11:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:07,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 91 proven. 14 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-08 11:11:07,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:07,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039497145] [2024-11-08 11:11:07,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039497145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:11:07,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267295140] [2024-11-08 11:11:07,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:07,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:11:07,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:11:07,561 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:11:07,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:11:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:07,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:11:07,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:11:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-08 11:11:07,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:11:07,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267295140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:07,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:11:07,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-08 11:11:07,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029178842] [2024-11-08 11:11:07,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:07,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:07,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:07,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:07,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:11:07,761 INFO L87 Difference]: Start difference. First operand 2098 states and 2658 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-11-08 11:11:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:08,410 INFO L93 Difference]: Finished difference Result 5671 states and 7287 transitions. [2024-11-08 11:11:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:08,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 243 [2024-11-08 11:11:08,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:08,422 INFO L225 Difference]: With dead ends: 5671 [2024-11-08 11:11:08,422 INFO L226 Difference]: Without dead ends: 3575 [2024-11-08 11:11:08,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:11:08,428 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 175 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:08,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 270 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:11:08,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3575 states. [2024-11-08 11:11:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3575 to 3572. [2024-11-08 11:11:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3572 states, 3571 states have (on average 1.2509101092131056) internal successors, (4467), 3571 states have internal predecessors, (4467), 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-11-08 11:11:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 4467 transitions. [2024-11-08 11:11:08,471 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 4467 transitions. Word has length 243 [2024-11-08 11:11:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:08,471 INFO L471 AbstractCegarLoop]: Abstraction has 3572 states and 4467 transitions. [2024-11-08 11:11:08,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-11-08 11:11:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 4467 transitions. [2024-11-08 11:11:08,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-11-08 11:11:08,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:08,475 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:08,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 11:11:08,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 11:11:08,680 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:08,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:08,680 INFO L85 PathProgramCache]: Analyzing trace with hash 741694043, now seen corresponding path program 1 times [2024-11-08 11:11:08,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:08,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232016179] [2024-11-08 11:11:08,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:08,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:11:08,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:08,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232016179] [2024-11-08 11:11:08,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232016179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:08,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:08,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:08,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986244918] [2024-11-08 11:11:08,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:08,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:11:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:08,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:11:08,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:11:08,893 INFO L87 Difference]: Start difference. First operand 3572 states and 4467 transitions. Second operand has 4 states, 4 states have (on average 70.5) internal successors, (282), 3 states have internal predecessors, (282), 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-11-08 11:11:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:09,895 INFO L93 Difference]: Finished difference Result 11413 states and 14584 transitions. [2024-11-08 11:11:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:11:09,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.5) internal successors, (282), 3 states have internal predecessors, (282), 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 282 [2024-11-08 11:11:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:09,915 INFO L225 Difference]: With dead ends: 11413 [2024-11-08 11:11:09,915 INFO L226 Difference]: Without dead ends: 8027 [2024-11-08 11:11:09,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:11:09,920 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 288 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:09,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 89 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 11:11:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8027 states. [2024-11-08 11:11:09,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8027 to 8025. [2024-11-08 11:11:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8025 states, 8024 states have (on average 1.2534895314057826) internal successors, (10058), 8024 states have internal predecessors, (10058), 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-11-08 11:11:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8025 states to 8025 states and 10058 transitions. [2024-11-08 11:11:10,014 INFO L78 Accepts]: Start accepts. Automaton has 8025 states and 10058 transitions. Word has length 282 [2024-11-08 11:11:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:10,015 INFO L471 AbstractCegarLoop]: Abstraction has 8025 states and 10058 transitions. [2024-11-08 11:11:10,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.5) internal successors, (282), 3 states have internal predecessors, (282), 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-11-08 11:11:10,015 INFO L276 IsEmpty]: Start isEmpty. Operand 8025 states and 10058 transitions. [2024-11-08 11:11:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-11-08 11:11:10,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:10,019 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:10,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:11:10,020 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:10,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:10,020 INFO L85 PathProgramCache]: Analyzing trace with hash 81123789, now seen corresponding path program 1 times [2024-11-08 11:11:10,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:10,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21184176] [2024-11-08 11:11:10,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:10,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-08 11:11:10,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:10,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21184176] [2024-11-08 11:11:10,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21184176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:10,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:10,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:10,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124970737] [2024-11-08 11:11:10,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:10,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:10,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:10,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:10,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:10,210 INFO L87 Difference]: Start difference. First operand 8025 states and 10058 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-11-08 11:11:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:10,818 INFO L93 Difference]: Finished difference Result 18085 states and 22879 transitions. [2024-11-08 11:11:10,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:10,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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 291 [2024-11-08 11:11:10,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:10,839 INFO L225 Difference]: With dead ends: 18085 [2024-11-08 11:11:10,840 INFO L226 Difference]: Without dead ends: 10246 [2024-11-08 11:11:10,847 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-11-08 11:11:10,848 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 141 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:10,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 384 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:11:10,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10246 states. [2024-11-08 11:11:10,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10246 to 10232. [2024-11-08 11:11:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10232 states, 10231 states have (on average 1.221385983774802) internal successors, (12496), 10231 states have internal predecessors, (12496), 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-11-08 11:11:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10232 states to 10232 states and 12496 transitions. [2024-11-08 11:11:10,982 INFO L78 Accepts]: Start accepts. Automaton has 10232 states and 12496 transitions. Word has length 291 [2024-11-08 11:11:10,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:10,983 INFO L471 AbstractCegarLoop]: Abstraction has 10232 states and 12496 transitions. [2024-11-08 11:11:10,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-11-08 11:11:10,983 INFO L276 IsEmpty]: Start isEmpty. Operand 10232 states and 12496 transitions. [2024-11-08 11:11:10,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-08 11:11:10,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:10,991 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2024-11-08 11:11:10,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:11:10,991 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:10,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:10,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1228370302, now seen corresponding path program 1 times [2024-11-08 11:11:10,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:10,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691534400] [2024-11-08 11:11:10,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:10,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 173 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:11:11,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:11,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691534400] [2024-11-08 11:11:11,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691534400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:11:11,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388594258] [2024-11-08 11:11:11,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:11,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:11:11,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:11:11,477 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:11:11,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 11:11:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:11,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 11:11:11,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:11:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 173 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:11:12,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:11:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 173 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:11:14,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388594258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 11:11:14,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 11:11:14,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-08 11:11:14,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45466780] [2024-11-08 11:11:14,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 11:11:14,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 11:11:14,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:14,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 11:11:14,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-08 11:11:14,215 INFO L87 Difference]: Start difference. First operand 10232 states and 12496 transitions. Second operand has 8 states, 8 states have (on average 72.625) internal successors, (581), 7 states have internal predecessors, (581), 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-11-08 11:11:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:16,172 INFO L93 Difference]: Finished difference Result 23641 states and 29105 transitions. [2024-11-08 11:11:16,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 11:11:16,173 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 72.625) internal successors, (581), 7 states have internal predecessors, (581), 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 329 [2024-11-08 11:11:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:16,191 INFO L225 Difference]: With dead ends: 23641 [2024-11-08 11:11:16,192 INFO L226 Difference]: Without dead ends: 14148 [2024-11-08 11:11:16,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-08 11:11:16,200 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 897 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2768 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 3173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 2768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:16,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 199 Invalid, 3173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 2768 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 11:11:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14148 states. [2024-11-08 11:11:16,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14148 to 10943. [2024-11-08 11:11:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10943 states, 10942 states have (on average 1.1883567903491135) internal successors, (13003), 10942 states have internal predecessors, (13003), 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-11-08 11:11:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10943 states to 10943 states and 13003 transitions. [2024-11-08 11:11:16,317 INFO L78 Accepts]: Start accepts. Automaton has 10943 states and 13003 transitions. Word has length 329 [2024-11-08 11:11:16,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:16,317 INFO L471 AbstractCegarLoop]: Abstraction has 10943 states and 13003 transitions. [2024-11-08 11:11:16,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 72.625) internal successors, (581), 7 states have internal predecessors, (581), 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-11-08 11:11:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 10943 states and 13003 transitions. [2024-11-08 11:11:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-11-08 11:11:16,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:16,326 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:16,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 11:11:16,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-08 11:11:16,527 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:16,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:16,527 INFO L85 PathProgramCache]: Analyzing trace with hash -333660676, now seen corresponding path program 1 times [2024-11-08 11:11:16,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:16,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081231458] [2024-11-08 11:11:16,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:16,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-08 11:11:16,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:16,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081231458] [2024-11-08 11:11:16,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081231458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:16,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:16,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:16,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022449849] [2024-11-08 11:11:16,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:16,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:16,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:16,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:16,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:16,838 INFO L87 Difference]: Start difference. First operand 10943 states and 13003 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-11-08 11:11:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:17,467 INFO L93 Difference]: Finished difference Result 27057 states and 32311 transitions. [2024-11-08 11:11:17,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:17,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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 349 [2024-11-08 11:11:17,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:17,490 INFO L225 Difference]: With dead ends: 27057 [2024-11-08 11:11:17,490 INFO L226 Difference]: Without dead ends: 16852 [2024-11-08 11:11:17,501 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-11-08 11:11:17,501 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 139 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:17,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 141 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:11:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16852 states. [2024-11-08 11:11:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16852 to 16848. [2024-11-08 11:11:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16848 states, 16847 states have (on average 1.167388852614709) internal successors, (19667), 16847 states have internal predecessors, (19667), 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-11-08 11:11:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16848 states to 16848 states and 19667 transitions. [2024-11-08 11:11:17,659 INFO L78 Accepts]: Start accepts. Automaton has 16848 states and 19667 transitions. Word has length 349 [2024-11-08 11:11:17,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:17,659 INFO L471 AbstractCegarLoop]: Abstraction has 16848 states and 19667 transitions. [2024-11-08 11:11:17,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-11-08 11:11:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand 16848 states and 19667 transitions. [2024-11-08 11:11:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-11-08 11:11:17,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:17,671 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2024-11-08 11:11:17,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:11:17,671 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:17,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:17,672 INFO L85 PathProgramCache]: Analyzing trace with hash 413217873, now seen corresponding path program 1 times [2024-11-08 11:11:17,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:17,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704973015] [2024-11-08 11:11:17,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:17,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:11:17,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:17,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704973015] [2024-11-08 11:11:17,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704973015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:17,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:17,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:17,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035949209] [2024-11-08 11:11:17,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:17,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:17,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:17,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:17,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:17,921 INFO L87 Difference]: Start difference. First operand 16848 states and 19667 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-11-08 11:11:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:18,469 INFO L93 Difference]: Finished difference Result 35910 states and 41957 transitions. [2024-11-08 11:11:18,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:18,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 357 [2024-11-08 11:11:18,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:18,496 INFO L225 Difference]: With dead ends: 35910 [2024-11-08 11:11:18,496 INFO L226 Difference]: Without dead ends: 20168 [2024-11-08 11:11:18,510 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-11-08 11:11:18,511 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 58 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:18,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 75 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:11:18,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20168 states. [2024-11-08 11:11:18,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20168 to 20160. [2024-11-08 11:11:18,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20160 states, 20159 states have (on average 1.155960117069299) internal successors, (23303), 20159 states have internal predecessors, (23303), 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-11-08 11:11:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20160 states to 20160 states and 23303 transitions. [2024-11-08 11:11:18,695 INFO L78 Accepts]: Start accepts. Automaton has 20160 states and 23303 transitions. Word has length 357 [2024-11-08 11:11:18,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:18,696 INFO L471 AbstractCegarLoop]: Abstraction has 20160 states and 23303 transitions. [2024-11-08 11:11:18,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-11-08 11:11:18,697 INFO L276 IsEmpty]: Start isEmpty. Operand 20160 states and 23303 transitions. [2024-11-08 11:11:18,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-08 11:11:18,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:18,706 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:18,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:11:18,706 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:18,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:18,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1498658965, now seen corresponding path program 1 times [2024-11-08 11:11:18,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:18,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38345563] [2024-11-08 11:11:18,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:18,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-08 11:11:19,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:19,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38345563] [2024-11-08 11:11:19,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38345563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:19,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:19,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:19,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854620052] [2024-11-08 11:11:19,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:19,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:11:19,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:19,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:11:19,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:11:19,071 INFO L87 Difference]: Start difference. First operand 20160 states and 23303 transitions. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 3 states have internal predecessors, (279), 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-11-08 11:11:20,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:20,047 INFO L93 Difference]: Finished difference Result 44218 states and 51655 transitions. [2024-11-08 11:11:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:11:20,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 3 states have internal predecessors, (279), 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 359 [2024-11-08 11:11:20,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:20,066 INFO L225 Difference]: With dead ends: 44218 [2024-11-08 11:11:20,066 INFO L226 Difference]: Without dead ends: 26086 [2024-11-08 11:11:20,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:11:20,073 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 259 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:20,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 102 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:11:20,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26086 states. [2024-11-08 11:11:20,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26086 to 22201. [2024-11-08 11:11:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22201 states, 22200 states have (on average 1.1554054054054055) internal successors, (25650), 22200 states have internal predecessors, (25650), 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-11-08 11:11:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22201 states to 22201 states and 25650 transitions. [2024-11-08 11:11:20,263 INFO L78 Accepts]: Start accepts. Automaton has 22201 states and 25650 transitions. Word has length 359 [2024-11-08 11:11:20,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:20,263 INFO L471 AbstractCegarLoop]: Abstraction has 22201 states and 25650 transitions. [2024-11-08 11:11:20,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 3 states have internal predecessors, (279), 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-11-08 11:11:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 22201 states and 25650 transitions. [2024-11-08 11:11:20,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-11-08 11:11:20,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:20,272 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:20,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:11:20,273 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:20,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:20,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1694407671, now seen corresponding path program 1 times [2024-11-08 11:11:20,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:20,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901319652] [2024-11-08 11:11:20,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:20,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-08 11:11:20,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:20,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901319652] [2024-11-08 11:11:20,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901319652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:11:20,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662717646] [2024-11-08 11:11:20,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:20,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:11:20,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:11:20,915 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:11:20,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 11:11:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:21,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:11:21,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:11:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-08 11:11:21,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:11:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-08 11:11:24,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662717646] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 11:11:24,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 11:11:24,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-11-08 11:11:24,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453961876] [2024-11-08 11:11:24,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:24,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:11:24,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:24,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:11:24,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:11:24,308 INFO L87 Difference]: Start difference. First operand 22201 states and 25650 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 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-11-08 11:11:25,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:25,343 INFO L93 Difference]: Finished difference Result 50703 states and 59095 transitions. [2024-11-08 11:11:25,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:11:25,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 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 360 [2024-11-08 11:11:25,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:25,371 INFO L225 Difference]: With dead ends: 50703 [2024-11-08 11:11:25,372 INFO L226 Difference]: Without dead ends: 30530 [2024-11-08 11:11:25,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 721 GetRequests, 716 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:11:25,387 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 313 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:25,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 179 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 11:11:25,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30530 states. [2024-11-08 11:11:25,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30530 to 22753. [2024-11-08 11:11:25,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22753 states, 22752 states have (on average 1.1521184950773558) internal successors, (26213), 22752 states have internal predecessors, (26213), 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-11-08 11:11:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22753 states to 22753 states and 26213 transitions. [2024-11-08 11:11:25,607 INFO L78 Accepts]: Start accepts. Automaton has 22753 states and 26213 transitions. Word has length 360 [2024-11-08 11:11:25,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:25,607 INFO L471 AbstractCegarLoop]: Abstraction has 22753 states and 26213 transitions. [2024-11-08 11:11:25,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 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-11-08 11:11:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand 22753 states and 26213 transitions. [2024-11-08 11:11:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2024-11-08 11:11:25,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:25,619 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:25,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 11:11:25,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:11:25,819 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:25,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:25,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1780645049, now seen corresponding path program 1 times [2024-11-08 11:11:25,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:25,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504884891] [2024-11-08 11:11:25,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:25,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-08 11:11:26,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:26,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504884891] [2024-11-08 11:11:26,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504884891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:26,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:26,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:26,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527083891] [2024-11-08 11:11:26,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:26,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:26,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:26,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:26,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:26,162 INFO L87 Difference]: Start difference. First operand 22753 states and 26213 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-11-08 11:11:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:26,698 INFO L93 Difference]: Finished difference Result 44958 states and 51822 transitions. [2024-11-08 11:11:26,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:26,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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 430 [2024-11-08 11:11:26,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:26,736 INFO L225 Difference]: With dead ends: 44958 [2024-11-08 11:11:26,736 INFO L226 Difference]: Without dead ends: 24233 [2024-11-08 11:11:26,751 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-11-08 11:11:26,752 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 141 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:26,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 144 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:11:26,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24233 states. [2024-11-08 11:11:26,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24233 to 22755. [2024-11-08 11:11:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22755 states, 22754 states have (on average 1.1518414344730596) internal successors, (26209), 22754 states have internal predecessors, (26209), 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-11-08 11:11:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22755 states to 22755 states and 26209 transitions. [2024-11-08 11:11:26,959 INFO L78 Accepts]: Start accepts. Automaton has 22755 states and 26209 transitions. Word has length 430 [2024-11-08 11:11:26,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:26,959 INFO L471 AbstractCegarLoop]: Abstraction has 22755 states and 26209 transitions. [2024-11-08 11:11:26,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-11-08 11:11:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand 22755 states and 26209 transitions. [2024-11-08 11:11:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2024-11-08 11:11:26,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:26,970 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2024-11-08 11:11:26,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 11:11:26,970 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:26,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:26,970 INFO L85 PathProgramCache]: Analyzing trace with hash 767467316, now seen corresponding path program 1 times [2024-11-08 11:11:26,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:26,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331396710] [2024-11-08 11:11:26,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:26,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 487 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-08 11:11:27,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:27,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331396710] [2024-11-08 11:11:27,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331396710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:27,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:27,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:27,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651560486] [2024-11-08 11:11:27,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:27,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:27,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:27,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:27,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:27,191 INFO L87 Difference]: Start difference. First operand 22755 states and 26209 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-11-08 11:11:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:27,732 INFO L93 Difference]: Finished difference Result 42206 states and 48741 transitions. [2024-11-08 11:11:27,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:27,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 433 [2024-11-08 11:11:27,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:27,752 INFO L225 Difference]: With dead ends: 42206 [2024-11-08 11:11:27,753 INFO L226 Difference]: Without dead ends: 21479 [2024-11-08 11:11:27,766 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-11-08 11:11:27,767 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 137 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:27,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 334 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:11:27,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21479 states. [2024-11-08 11:11:27,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21479 to 21461. [2024-11-08 11:11:27,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21461 states, 21460 states have (on average 1.1256756756756756) internal successors, (24157), 21460 states have internal predecessors, (24157), 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-11-08 11:11:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21461 states to 21461 states and 24157 transitions. [2024-11-08 11:11:27,932 INFO L78 Accepts]: Start accepts. Automaton has 21461 states and 24157 transitions. Word has length 433 [2024-11-08 11:11:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:27,932 INFO L471 AbstractCegarLoop]: Abstraction has 21461 states and 24157 transitions. [2024-11-08 11:11:27,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-11-08 11:11:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 21461 states and 24157 transitions. [2024-11-08 11:11:27,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2024-11-08 11:11:27,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:27,941 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:27,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 11:11:27,941 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:27,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:27,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1966731224, now seen corresponding path program 1 times [2024-11-08 11:11:27,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:27,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373132423] [2024-11-08 11:11:27,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:27,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-11-08 11:11:28,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:28,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373132423] [2024-11-08 11:11:28,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373132423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:28,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:28,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:11:28,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810635409] [2024-11-08 11:11:28,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:28,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:28,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:28,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:28,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:28,098 INFO L87 Difference]: Start difference. First operand 21461 states and 24157 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:28,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:28,442 INFO L93 Difference]: Finished difference Result 40143 states and 45235 transitions. [2024-11-08 11:11:28,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:28,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 437 [2024-11-08 11:11:28,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:28,458 INFO L225 Difference]: With dead ends: 40143 [2024-11-08 11:11:28,458 INFO L226 Difference]: Without dead ends: 20710 [2024-11-08 11:11:28,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-08 11:11:28,468 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:28,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 40 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 11:11:28,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20710 states. [2024-11-08 11:11:28,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20710 to 20701. [2024-11-08 11:11:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20701 states, 20700 states have (on average 1.123864734299517) internal successors, (23264), 20700 states have internal predecessors, (23264), 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-11-08 11:11:28,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20701 states to 20701 states and 23264 transitions. [2024-11-08 11:11:28,703 INFO L78 Accepts]: Start accepts. Automaton has 20701 states and 23264 transitions. Word has length 437 [2024-11-08 11:11:28,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:28,704 INFO L471 AbstractCegarLoop]: Abstraction has 20701 states and 23264 transitions. [2024-11-08 11:11:28,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:28,704 INFO L276 IsEmpty]: Start isEmpty. Operand 20701 states and 23264 transitions. [2024-11-08 11:11:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2024-11-08 11:11:28,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:28,716 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2024-11-08 11:11:28,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 11:11:28,716 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:28,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:28,716 INFO L85 PathProgramCache]: Analyzing trace with hash 753967230, now seen corresponding path program 1 times [2024-11-08 11:11:28,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:28,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15803035] [2024-11-08 11:11:28,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:28,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 357 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-08 11:11:28,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:28,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15803035] [2024-11-08 11:11:28,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15803035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:28,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:28,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:28,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146336362] [2024-11-08 11:11:28,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:28,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:28,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:28,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:28,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:28,918 INFO L87 Difference]: Start difference. First operand 20701 states and 23264 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-11-08 11:11:29,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:29,360 INFO L93 Difference]: Finished difference Result 36034 states and 40329 transitions. [2024-11-08 11:11:29,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:29,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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 453 [2024-11-08 11:11:29,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:29,372 INFO L225 Difference]: With dead ends: 36034 [2024-11-08 11:11:29,373 INFO L226 Difference]: Without dead ends: 17175 [2024-11-08 11:11:29,380 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-11-08 11:11:29,381 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:29,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 135 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:11:29,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17175 states. [2024-11-08 11:11:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17175 to 16991. [2024-11-08 11:11:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16991 states, 16990 states have (on average 1.1065921130076515) internal successors, (18801), 16990 states have internal predecessors, (18801), 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-11-08 11:11:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16991 states to 16991 states and 18801 transitions. [2024-11-08 11:11:29,501 INFO L78 Accepts]: Start accepts. Automaton has 16991 states and 18801 transitions. Word has length 453 [2024-11-08 11:11:29,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:29,501 INFO L471 AbstractCegarLoop]: Abstraction has 16991 states and 18801 transitions. [2024-11-08 11:11:29,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-11-08 11:11:29,501 INFO L276 IsEmpty]: Start isEmpty. Operand 16991 states and 18801 transitions. [2024-11-08 11:11:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2024-11-08 11:11:29,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:29,509 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:11:29,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 11:11:29,509 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:29,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1527728535, now seen corresponding path program 1 times [2024-11-08 11:11:29,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:29,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011870202] [2024-11-08 11:11:29,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:29,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-08 11:11:29,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:29,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011870202] [2024-11-08 11:11:29,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011870202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:29,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:29,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:11:29,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283512173] [2024-11-08 11:11:29,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:29,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 11:11:29,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:29,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 11:11:29,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:11:29,962 INFO L87 Difference]: Start difference. First operand 16991 states and 18801 transitions. Second operand has 5 states, 5 states have (on average 73.6) internal successors, (368), 4 states have internal predecessors, (368), 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-11-08 11:11:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:30,684 INFO L93 Difference]: Finished difference Result 32217 states and 35694 transitions. [2024-11-08 11:11:30,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 11:11:30,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 4 states have internal predecessors, (368), 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 491 [2024-11-08 11:11:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:30,698 INFO L225 Difference]: With dead ends: 32217 [2024-11-08 11:11:30,698 INFO L226 Difference]: Without dead ends: 17254 [2024-11-08 11:11:30,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:11:30,707 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 268 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:30,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 55 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:11:30,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17254 states. [2024-11-08 11:11:30,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17254 to 17176. [2024-11-08 11:11:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17176 states, 17175 states have (on average 1.1050946142649198) internal successors, (18980), 17175 states have internal predecessors, (18980), 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-11-08 11:11:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17176 states to 17176 states and 18980 transitions. [2024-11-08 11:11:30,830 INFO L78 Accepts]: Start accepts. Automaton has 17176 states and 18980 transitions. Word has length 491 [2024-11-08 11:11:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:30,831 INFO L471 AbstractCegarLoop]: Abstraction has 17176 states and 18980 transitions. [2024-11-08 11:11:30,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 4 states have internal predecessors, (368), 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-11-08 11:11:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 17176 states and 18980 transitions. [2024-11-08 11:11:30,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2024-11-08 11:11:30,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:30,840 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:11:30,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 11:11:30,841 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:30,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:30,841 INFO L85 PathProgramCache]: Analyzing trace with hash 762254319, now seen corresponding path program 1 times [2024-11-08 11:11:30,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:30,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965846475] [2024-11-08 11:11:30,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:30,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 685 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-08 11:11:31,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:31,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965846475] [2024-11-08 11:11:31,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965846475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:31,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:31,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:31,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047700690] [2024-11-08 11:11:31,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:31,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:31,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:31,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:31,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:31,095 INFO L87 Difference]: Start difference. First operand 17176 states and 18980 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-11-08 11:11:31,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:31,539 INFO L93 Difference]: Finished difference Result 34902 states and 38588 transitions. [2024-11-08 11:11:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:31,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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 513 [2024-11-08 11:11:31,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:31,557 INFO L225 Difference]: With dead ends: 34902 [2024-11-08 11:11:31,557 INFO L226 Difference]: Without dead ends: 18832 [2024-11-08 11:11:31,567 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-11-08 11:11:31,567 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 63 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:31,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 368 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:11:31,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18832 states. [2024-11-08 11:11:31,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18832 to 17912. [2024-11-08 11:11:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17912 states, 17911 states have (on average 1.1027859974317458) internal successors, (19752), 17911 states have internal predecessors, (19752), 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-11-08 11:11:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17912 states to 17912 states and 19752 transitions. [2024-11-08 11:11:31,707 INFO L78 Accepts]: Start accepts. Automaton has 17912 states and 19752 transitions. Word has length 513 [2024-11-08 11:11:31,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:31,707 INFO L471 AbstractCegarLoop]: Abstraction has 17912 states and 19752 transitions. [2024-11-08 11:11:31,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-11-08 11:11:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 17912 states and 19752 transitions. [2024-11-08 11:11:31,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2024-11-08 11:11:31,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:31,719 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:31,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 11:11:31,719 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:31,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:31,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1316469261, now seen corresponding path program 1 times [2024-11-08 11:11:31,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:31,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190779674] [2024-11-08 11:11:31,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:31,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-08 11:11:32,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:32,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190779674] [2024-11-08 11:11:32,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190779674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:32,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:32,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:32,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487506448] [2024-11-08 11:11:32,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:32,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:32,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:32,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:32,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:32,058 INFO L87 Difference]: Start difference. First operand 17912 states and 19752 transitions. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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-11-08 11:11:32,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:32,590 INFO L93 Difference]: Finished difference Result 37482 states and 41348 transitions. [2024-11-08 11:11:32,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:32,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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 545 [2024-11-08 11:11:32,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:32,606 INFO L225 Difference]: With dead ends: 37482 [2024-11-08 11:11:32,606 INFO L226 Difference]: Without dead ends: 20676 [2024-11-08 11:11:32,615 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-11-08 11:11:32,616 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 55 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:32,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 64 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:11:32,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20676 states. [2024-11-08 11:11:32,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20676 to 18096. [2024-11-08 11:11:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18096 states, 18095 states have (on average 1.102072395689417) internal successors, (19942), 18095 states have internal predecessors, (19942), 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-11-08 11:11:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18096 states to 18096 states and 19942 transitions. [2024-11-08 11:11:32,755 INFO L78 Accepts]: Start accepts. Automaton has 18096 states and 19942 transitions. Word has length 545 [2024-11-08 11:11:32,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:32,756 INFO L471 AbstractCegarLoop]: Abstraction has 18096 states and 19942 transitions. [2024-11-08 11:11:32,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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-11-08 11:11:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 18096 states and 19942 transitions. [2024-11-08 11:11:32,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2024-11-08 11:11:32,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:32,766 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2024-11-08 11:11:32,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 11:11:32,766 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:32,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:32,767 INFO L85 PathProgramCache]: Analyzing trace with hash 50467656, now seen corresponding path program 1 times [2024-11-08 11:11:32,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:32,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931943577] [2024-11-08 11:11:32,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:32,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:33,753 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-08 11:11:33,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:33,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931943577] [2024-11-08 11:11:33,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931943577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:33,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:33,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 11:11:33,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731232029] [2024-11-08 11:11:33,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:33,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 11:11:33,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:33,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 11:11:33,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:11:33,755 INFO L87 Difference]: Start difference. First operand 18096 states and 19942 transitions. Second operand has 7 states, 7 states have (on average 57.714285714285715) internal successors, (404), 6 states have internal predecessors, (404), 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-11-08 11:11:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:34,691 INFO L93 Difference]: Finished difference Result 36747 states and 40475 transitions. [2024-11-08 11:11:34,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 11:11:34,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 57.714285714285715) internal successors, (404), 6 states have internal predecessors, (404), 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 555 [2024-11-08 11:11:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:34,708 INFO L225 Difference]: With dead ends: 36747 [2024-11-08 11:11:34,709 INFO L226 Difference]: Without dead ends: 21047 [2024-11-08 11:11:34,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:11:34,718 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 274 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:34,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 207 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1942 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:11:34,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21047 states. [2024-11-08 11:11:34,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21047 to 18648. [2024-11-08 11:11:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18648 states, 18647 states have (on average 1.1025902289912586) internal successors, (20560), 18647 states have internal predecessors, (20560), 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-11-08 11:11:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18648 states to 18648 states and 20560 transitions. [2024-11-08 11:11:34,861 INFO L78 Accepts]: Start accepts. Automaton has 18648 states and 20560 transitions. Word has length 555 [2024-11-08 11:11:34,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:34,861 INFO L471 AbstractCegarLoop]: Abstraction has 18648 states and 20560 transitions. [2024-11-08 11:11:34,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 57.714285714285715) internal successors, (404), 6 states have internal predecessors, (404), 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-11-08 11:11:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 18648 states and 20560 transitions. [2024-11-08 11:11:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2024-11-08 11:11:34,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:34,872 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:11:34,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 11:11:34,872 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:34,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:34,872 INFO L85 PathProgramCache]: Analyzing trace with hash -304859615, now seen corresponding path program 1 times [2024-11-08 11:11:34,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:34,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40427181] [2024-11-08 11:11:34,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:34,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 665 proven. 8 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-08 11:11:35,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:35,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40427181] [2024-11-08 11:11:35,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40427181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:11:35,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029693356] [2024-11-08 11:11:35,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:35,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:11:35,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:11:35,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:11:35,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 11:11:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:35,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 11:11:35,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:11:36,265 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 311 proven. 447 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-08 11:11:36,265 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:11:36,473 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-08 11:11:36,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029693356] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 11:11:36,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 11:11:36,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 12 [2024-11-08 11:11:36,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537472375] [2024-11-08 11:11:36,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:36,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:11:36,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:36,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:11:36,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-08 11:11:36,476 INFO L87 Difference]: Start difference. First operand 18648 states and 20560 transitions. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 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-11-08 11:11:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:37,370 INFO L93 Difference]: Finished difference Result 40794 states and 45019 transitions. [2024-11-08 11:11:37,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:11:37,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 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 565 [2024-11-08 11:11:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:37,392 INFO L225 Difference]: With dead ends: 40794 [2024-11-08 11:11:37,392 INFO L226 Difference]: Without dead ends: 24542 [2024-11-08 11:11:37,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1135 GetRequests, 1125 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-08 11:11:37,403 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 227 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:37,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 55 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:11:37,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24542 states. [2024-11-08 11:11:37,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24542 to 19369. [2024-11-08 11:11:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19369 states, 19368 states have (on average 1.1001652209830648) internal successors, (21308), 19368 states have internal predecessors, (21308), 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-11-08 11:11:37,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19369 states to 19369 states and 21308 transitions. [2024-11-08 11:11:37,562 INFO L78 Accepts]: Start accepts. Automaton has 19369 states and 21308 transitions. Word has length 565 [2024-11-08 11:11:37,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:37,562 INFO L471 AbstractCegarLoop]: Abstraction has 19369 states and 21308 transitions. [2024-11-08 11:11:37,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 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-11-08 11:11:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 19369 states and 21308 transitions. [2024-11-08 11:11:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2024-11-08 11:11:37,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:37,575 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:11:37,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 11:11:37,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:11:37,775 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:37,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:37,776 INFO L85 PathProgramCache]: Analyzing trace with hash 967909587, now seen corresponding path program 1 times [2024-11-08 11:11:37,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:37,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398114583] [2024-11-08 11:11:37,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:37,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-11-08 11:11:38,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:38,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398114583] [2024-11-08 11:11:38,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398114583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:38,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:38,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:38,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201850569] [2024-11-08 11:11:38,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:38,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:38,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:38,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:38,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:38,100 INFO L87 Difference]: Start difference. First operand 19369 states and 21308 transitions. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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-11-08 11:11:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:38,685 INFO L93 Difference]: Finished difference Result 40036 states and 44096 transitions. [2024-11-08 11:11:38,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:38,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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 778 [2024-11-08 11:11:38,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:38,702 INFO L225 Difference]: With dead ends: 40036 [2024-11-08 11:11:38,702 INFO L226 Difference]: Without dead ends: 22325 [2024-11-08 11:11:38,708 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-11-08 11:11:38,708 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 103 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:38,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 167 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:11:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22325 states. [2024-11-08 11:11:38,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22325 to 21209. [2024-11-08 11:11:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21209 states, 21208 states have (on average 1.0917578272350057) internal successors, (23154), 21208 states have internal predecessors, (23154), 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-11-08 11:11:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21209 states to 21209 states and 23154 transitions. [2024-11-08 11:11:38,863 INFO L78 Accepts]: Start accepts. Automaton has 21209 states and 23154 transitions. Word has length 778 [2024-11-08 11:11:38,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:38,863 INFO L471 AbstractCegarLoop]: Abstraction has 21209 states and 23154 transitions. [2024-11-08 11:11:38,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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-11-08 11:11:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 21209 states and 23154 transitions. [2024-11-08 11:11:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2024-11-08 11:11:38,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:38,877 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:11:38,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 11:11:38,877 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:38,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:38,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1055284622, now seen corresponding path program 1 times [2024-11-08 11:11:38,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:38,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548047107] [2024-11-08 11:11:38,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:38,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 1500 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-08 11:11:39,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:39,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548047107] [2024-11-08 11:11:39,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548047107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:39,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:39,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:11:39,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101686119] [2024-11-08 11:11:39,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:39,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:11:39,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:39,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:11:39,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:11:39,435 INFO L87 Difference]: Start difference. First operand 21209 states and 23154 transitions. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 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-11-08 11:11:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:40,360 INFO L93 Difference]: Finished difference Result 46296 states and 50516 transitions. [2024-11-08 11:11:40,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:11:40,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 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 779 [2024-11-08 11:11:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:40,385 INFO L225 Difference]: With dead ends: 46296 [2024-11-08 11:11:40,385 INFO L226 Difference]: Without dead ends: 27297 [2024-11-08 11:11:40,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:11:40,400 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 244 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:40,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 67 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:11:40,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27297 states. [2024-11-08 11:11:40,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27297 to 21957. [2024-11-08 11:11:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21957 states, 21956 states have (on average 1.090408088905083) internal successors, (23941), 21956 states have internal predecessors, (23941), 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-11-08 11:11:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21957 states to 21957 states and 23941 transitions. [2024-11-08 11:11:40,675 INFO L78 Accepts]: Start accepts. Automaton has 21957 states and 23941 transitions. Word has length 779 [2024-11-08 11:11:40,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:40,676 INFO L471 AbstractCegarLoop]: Abstraction has 21957 states and 23941 transitions. [2024-11-08 11:11:40,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 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-11-08 11:11:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 21957 states and 23941 transitions. [2024-11-08 11:11:40,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2024-11-08 11:11:40,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:40,690 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:40,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 11:11:40,690 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:40,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:40,691 INFO L85 PathProgramCache]: Analyzing trace with hash 754659544, now seen corresponding path program 1 times [2024-11-08 11:11:40,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:40,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686618549] [2024-11-08 11:11:40,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:40,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1895 backedges. 1572 proven. 0 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2024-11-08 11:11:41,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:41,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686618549] [2024-11-08 11:11:41,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686618549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:41,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:41,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:11:41,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154937763] [2024-11-08 11:11:41,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:41,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:11:41,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:41,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:11:41,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:11:41,334 INFO L87 Difference]: Start difference. First operand 21957 states and 23941 transitions. Second operand has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 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-11-08 11:11:42,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:42,124 INFO L93 Difference]: Finished difference Result 47056 states and 51274 transitions. [2024-11-08 11:11:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:11:42,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 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 826 [2024-11-08 11:11:42,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:42,145 INFO L225 Difference]: With dead ends: 47056 [2024-11-08 11:11:42,145 INFO L226 Difference]: Without dead ends: 25101 [2024-11-08 11:11:42,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:11:42,156 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 244 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:42,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 72 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:11:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25101 states. [2024-11-08 11:11:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25101 to 16609. [2024-11-08 11:11:42,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16609 states, 16608 states have (on average 1.0930274566473988) internal successors, (18153), 16608 states have internal predecessors, (18153), 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-11-08 11:11:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16609 states to 16609 states and 18153 transitions. [2024-11-08 11:11:42,305 INFO L78 Accepts]: Start accepts. Automaton has 16609 states and 18153 transitions. Word has length 826 [2024-11-08 11:11:42,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:42,306 INFO L471 AbstractCegarLoop]: Abstraction has 16609 states and 18153 transitions. [2024-11-08 11:11:42,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 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-11-08 11:11:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand 16609 states and 18153 transitions. [2024-11-08 11:11:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2024-11-08 11:11:42,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:42,318 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:11:42,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 11:11:42,319 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:42,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:42,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1645325847, now seen corresponding path program 1 times [2024-11-08 11:11:42,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:42,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118068462] [2024-11-08 11:11:42,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:42,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2571 backedges. 1734 proven. 0 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2024-11-08 11:11:42,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:42,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118068462] [2024-11-08 11:11:42,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118068462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:42,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:42,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:42,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693282628] [2024-11-08 11:11:42,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:42,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:42,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:42,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:42,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:42,571 INFO L87 Difference]: Start difference. First operand 16609 states and 18153 transitions. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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-11-08 11:11:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:43,043 INFO L93 Difference]: Finished difference Result 33952 states and 37066 transitions. [2024-11-08 11:11:43,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:43,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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 920 [2024-11-08 11:11:43,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:43,061 INFO L225 Difference]: With dead ends: 33952 [2024-11-08 11:11:43,061 INFO L226 Difference]: Without dead ends: 17345 [2024-11-08 11:11:43,068 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-11-08 11:11:43,068 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 132 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:43,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 100 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:11:43,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17345 states. [2024-11-08 11:11:43,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17345 to 15317. [2024-11-08 11:11:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15317 states, 15316 states have (on average 1.0920605902324367) internal successors, (16726), 15316 states have internal predecessors, (16726), 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-11-08 11:11:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15317 states to 15317 states and 16726 transitions. [2024-11-08 11:11:43,186 INFO L78 Accepts]: Start accepts. Automaton has 15317 states and 16726 transitions. Word has length 920 [2024-11-08 11:11:43,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:43,186 INFO L471 AbstractCegarLoop]: Abstraction has 15317 states and 16726 transitions. [2024-11-08 11:11:43,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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-11-08 11:11:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 15317 states and 16726 transitions. [2024-11-08 11:11:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1071 [2024-11-08 11:11:43,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:43,199 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:43,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 11:11:43,199 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:43,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:43,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1307367328, now seen corresponding path program 1 times [2024-11-08 11:11:43,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:43,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560910913] [2024-11-08 11:11:43,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:43,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3347 backedges. 1791 proven. 969 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2024-11-08 11:11:44,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:44,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560910913] [2024-11-08 11:11:44,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560910913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:11:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797301973] [2024-11-08 11:11:44,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:44,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:11:44,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:11:44,704 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:11:44,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 11:11:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:44,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:11:44,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:11:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3347 backedges. 1949 proven. 0 refuted. 0 times theorem prover too weak. 1398 trivial. 0 not checked. [2024-11-08 11:11:45,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:11:45,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797301973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:45,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:11:45,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-08 11:11:45,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207244389] [2024-11-08 11:11:45,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:45,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:45,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:45,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:45,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 11:11:45,107 INFO L87 Difference]: Start difference. First operand 15317 states and 16726 transitions. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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-11-08 11:11:45,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:45,527 INFO L93 Difference]: Finished difference Result 31007 states and 33853 transitions. [2024-11-08 11:11:45,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:45,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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 1070 [2024-11-08 11:11:45,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:45,539 INFO L225 Difference]: With dead ends: 31007 [2024-11-08 11:11:45,539 INFO L226 Difference]: Without dead ends: 15692 [2024-11-08 11:11:45,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1077 GetRequests, 1071 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 11:11:45,547 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 104 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:45,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 333 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:11:45,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15692 states. [2024-11-08 11:11:45,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15692 to 15317. [2024-11-08 11:11:45,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15317 states, 15316 states have (on average 1.0905588926612693) internal successors, (16703), 15316 states have internal predecessors, (16703), 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-11-08 11:11:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15317 states to 15317 states and 16703 transitions. [2024-11-08 11:11:45,658 INFO L78 Accepts]: Start accepts. Automaton has 15317 states and 16703 transitions. Word has length 1070 [2024-11-08 11:11:45,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:45,659 INFO L471 AbstractCegarLoop]: Abstraction has 15317 states and 16703 transitions. [2024-11-08 11:11:45,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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-11-08 11:11:45,659 INFO L276 IsEmpty]: Start isEmpty. Operand 15317 states and 16703 transitions. [2024-11-08 11:11:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1097 [2024-11-08 11:11:45,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:45,671 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2024-11-08 11:11:45,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 11:11:45,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-08 11:11:45,872 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:45,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:45,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1750744226, now seen corresponding path program 1 times [2024-11-08 11:11:45,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:45,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401836212] [2024-11-08 11:11:45,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:45,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4031 backedges. 2183 proven. 0 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2024-11-08 11:11:46,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:46,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401836212] [2024-11-08 11:11:46,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401836212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:46,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:46,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:46,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881951005] [2024-11-08 11:11:46,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:46,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:46,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:46,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:46,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:46,317 INFO L87 Difference]: Start difference. First operand 15317 states and 16703 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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-11-08 11:11:46,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:46,799 INFO L93 Difference]: Finished difference Result 31743 states and 34652 transitions. [2024-11-08 11:11:46,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:46,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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 1096 [2024-11-08 11:11:46,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:46,812 INFO L225 Difference]: With dead ends: 31743 [2024-11-08 11:11:46,812 INFO L226 Difference]: Without dead ends: 16428 [2024-11-08 11:11:46,821 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-11-08 11:11:46,822 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 84 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:46,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 345 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:11:46,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16428 states. [2024-11-08 11:11:46,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16428 to 16426. [2024-11-08 11:11:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16426 states, 16425 states have (on average 1.0877321156773212) internal successors, (17866), 16425 states have internal predecessors, (17866), 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-11-08 11:11:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16426 states to 16426 states and 17866 transitions. [2024-11-08 11:11:46,948 INFO L78 Accepts]: Start accepts. Automaton has 16426 states and 17866 transitions. Word has length 1096 [2024-11-08 11:11:46,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:46,948 INFO L471 AbstractCegarLoop]: Abstraction has 16426 states and 17866 transitions. [2024-11-08 11:11:46,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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-11-08 11:11:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand 16426 states and 17866 transitions. [2024-11-08 11:11:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1111 [2024-11-08 11:11:46,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:46,962 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2024-11-08 11:11:46,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 11:11:46,962 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:46,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:46,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1094636434, now seen corresponding path program 1 times [2024-11-08 11:11:46,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:46,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34880977] [2024-11-08 11:11:46,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:46,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4105 backedges. 2511 proven. 0 refuted. 0 times theorem prover too weak. 1594 trivial. 0 not checked. [2024-11-08 11:11:47,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:47,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34880977] [2024-11-08 11:11:47,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34880977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:47,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:47,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:47,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098914078] [2024-11-08 11:11:47,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:47,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:47,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:47,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:47,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:47,638 INFO L87 Difference]: Start difference. First operand 16426 states and 17866 transitions. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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-11-08 11:11:48,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:48,085 INFO L93 Difference]: Finished difference Result 33770 states and 36704 transitions. [2024-11-08 11:11:48,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:48,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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 1110 [2024-11-08 11:11:48,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:48,098 INFO L225 Difference]: With dead ends: 33770 [2024-11-08 11:11:48,098 INFO L226 Difference]: Without dead ends: 17162 [2024-11-08 11:11:48,106 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-11-08 11:11:48,106 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 101 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:48,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 348 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:11:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17162 states. [2024-11-08 11:11:48,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17162 to 15690. [2024-11-08 11:11:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15690 states, 15689 states have (on average 1.085091465357894) internal successors, (17024), 15689 states have internal predecessors, (17024), 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-11-08 11:11:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15690 states to 15690 states and 17024 transitions. [2024-11-08 11:11:48,221 INFO L78 Accepts]: Start accepts. Automaton has 15690 states and 17024 transitions. Word has length 1110 [2024-11-08 11:11:48,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:48,221 INFO L471 AbstractCegarLoop]: Abstraction has 15690 states and 17024 transitions. [2024-11-08 11:11:48,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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-11-08 11:11:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 15690 states and 17024 transitions. [2024-11-08 11:11:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1184 [2024-11-08 11:11:48,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:48,235 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2024-11-08 11:11:48,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 11:11:48,235 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:48,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:48,235 INFO L85 PathProgramCache]: Analyzing trace with hash -659694717, now seen corresponding path program 1 times [2024-11-08 11:11:48,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:48,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266650588] [2024-11-08 11:11:48,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:48,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:50,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4814 backedges. 3060 proven. 810 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2024-11-08 11:11:50,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:50,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266650588] [2024-11-08 11:11:50,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266650588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:11:50,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375532244] [2024-11-08 11:11:50,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:50,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:11:50,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:11:50,900 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:11:50,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 11:11:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:51,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:11:51,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:11:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4814 backedges. 3002 proven. 0 refuted. 0 times theorem prover too weak. 1812 trivial. 0 not checked. [2024-11-08 11:11:51,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:11:51,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375532244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:51,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:11:51,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2024-11-08 11:11:51,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979971114] [2024-11-08 11:11:51,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:51,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:51,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:51,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:51,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-08 11:11:51,329 INFO L87 Difference]: Start difference. First operand 15690 states and 17024 transitions. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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-11-08 11:11:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:51,720 INFO L93 Difference]: Finished difference Result 25285 states and 27359 transitions. [2024-11-08 11:11:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:51,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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 1183 [2024-11-08 11:11:51,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:51,722 INFO L225 Difference]: With dead ends: 25285 [2024-11-08 11:11:51,722 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:11:51,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1196 GetRequests, 1185 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-08 11:11:51,729 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 98 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:51,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 278 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:11:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:11:51,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:11:51,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-11-08 11:11:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:11:51,730 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1183 [2024-11-08 11:11:51,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:51,730 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:11:51,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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-11-08 11:11:51,731 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:11:51,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:11:51,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:11:51,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 11:11:51,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:11:51,937 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-08 11:11:51,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:11:57,533 WARN L286 SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 619 DAG size of output: 744 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-08 11:11:59,913 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:11:59,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:11:59 BoogieIcfgContainer [2024-11-08 11:11:59,937 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:11:59,937 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:11:59,937 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:11:59,938 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:11:59,938 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:02" (3/4) ... [2024-11-08 11:11:59,940 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:11:59,956 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:11:59,956 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:11:59,957 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:11:59,958 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:12:00,084 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:12:00,084 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:12:00,084 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:12:00,085 INFO L158 Benchmark]: Toolchain (without parser) took 59649.27ms. Allocated memory was 182.5MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 122.5MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 185.8MB. Max. memory is 16.1GB. [2024-11-08 11:12:00,085 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 182.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:12:00,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.16ms. Allocated memory is still 182.5MB. Free memory was 122.5MB in the beginning and 75.4MB in the end (delta: 47.1MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-08 11:12:00,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.16ms. Allocated memory is still 182.5MB. Free memory was 75.4MB in the beginning and 57.5MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 11:12:00,085 INFO L158 Benchmark]: Boogie Preprocessor took 189.08ms. Allocated memory was 182.5MB in the beginning and 287.3MB in the end (delta: 104.9MB). Free memory was 57.5MB in the beginning and 229.3MB in the end (delta: -171.8MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2024-11-08 11:12:00,085 INFO L158 Benchmark]: RCFGBuilder took 1241.52ms. Allocated memory is still 287.3MB. Free memory was 229.3MB in the beginning and 185.3MB in the end (delta: 44.0MB). Peak memory consumption was 121.6MB. Max. memory is 16.1GB. [2024-11-08 11:12:00,085 INFO L158 Benchmark]: TraceAbstraction took 57442.87ms. Allocated memory was 287.3MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 184.2MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-08 11:12:00,085 INFO L158 Benchmark]: Witness Printer took 146.91ms. Allocated memory is still 2.1GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 11:12:00,089 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 182.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 532.16ms. Allocated memory is still 182.5MB. Free memory was 122.5MB in the beginning and 75.4MB in the end (delta: 47.1MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.16ms. Allocated memory is still 182.5MB. Free memory was 75.4MB in the beginning and 57.5MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 189.08ms. Allocated memory was 182.5MB in the beginning and 287.3MB in the end (delta: 104.9MB). Free memory was 57.5MB in the beginning and 229.3MB in the end (delta: -171.8MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1241.52ms. Allocated memory is still 287.3MB. Free memory was 229.3MB in the beginning and 185.3MB in the end (delta: 44.0MB). Peak memory consumption was 121.6MB. Max. memory is 16.1GB. * TraceAbstraction took 57442.87ms. Allocated memory was 287.3MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 184.2MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 146.91ms. Allocated memory is still 2.1GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 181]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.4s, OverallIterations: 30, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5625 SdHoareTripleChecker+Valid, 18.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5625 mSDsluCounter, 5797 SdHoareTripleChecker+Invalid, 15.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 790 mSDsCounter, 3354 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23250 IncrementalHoareTripleChecker+Invalid, 26604 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3354 mSolverCounterUnsat, 5007 mSDtfsCounter, 23250 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5122 GetRequests, 5034 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22755occurred in iteration=14, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 30 MinimizatonAttempts, 46770 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 19.9s InterpolantComputationTime, 19226 NumberOfCodeBlocks, 19226 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 20441 ConstructedInterpolants, 0 QuantifiedInterpolants, 77879 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4820 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 39 InterpolantComputations, 29 PerfectInterpolantSequences, 41315/43902 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (((long long) a29 + 554036) <= 0)) && (a25 == 9)) && (a3 == 1)) && (a8 == 15)) || (((((a25 <= 10) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((((a23 <= 600000) && (a25 <= 10)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((((long long) a23 + 55) <= 0) && (a25 == 12)) && (a4 == 0)) && (((long long) a29 + 554036) <= 0)) && (a3 == 1)) && (a8 == 15))) || ((((((a25 == 12) && (139 <= a23)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((((a25 == 13) && (a23 <= 599997)) && (307 <= a23)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a29 <= 275) && (a25 == 12)) && (a4 == 0)) && (141 <= a29)) && (a3 == 1)) && (a8 == 15))) || (((((((a29 <= 275) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a25 <= 9)) && (a8 == 15))) || (((((a23 <= 599997) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || (((((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 274)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 == 11)) && (a3 == 1)) && (a29 <= 220)) && (a8 == 15))) || ((((((a23 <= 600000) && (a25 == 11)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a29 <= 245) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || (((((((a23 <= 600000) && (a25 == 12)) && (307 <= a23)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((a25 == 13) && (a29 <= 245)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15))) || ((((((((long long) a23 + 55) <= 0) && (a4 == 0)) && (a3 == 1)) && (a29 <= 220)) && (a8 == 15)) && (a25 == 10))) || ((((((a25 == 11) && (a29 <= 274)) && (141 <= a29)) && (((long long) 119992 + a23) <= 0)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 13) && (141 <= a29)) && (a3 == 1)) && (((long long) a23 + 599772) <= 0)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 13) && (a29 <= 240)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((((a29 <= 275) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 600261)) && (312 <= a23)) && (a8 == 15)) && (a25 == 10))) || (((((((a25 == 12) && (a23 <= 599997)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15)) && (a29 <= 130))) || ((((((a25 == 13) && (139 <= a23)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (141 <= a29)) && (a25 == 9)) && (a3 == 1)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:12:00,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE