./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label09.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94406c90b46fed2ba639405486e012fa4ad77124178cc3ef79a472c538020bbf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:40:17,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:40:17,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:40:17,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:40:17,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:40:17,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:40:17,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:40:17,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:40:17,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:40:17,182 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:40:17,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:40:17,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:40:17,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:40:17,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:40:17,183 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:40:17,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:40:17,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:40:17,184 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:40:17,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:40:17,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:40:17,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:40:17,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:40:17,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:40:17,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:40:17,188 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:40:17,189 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:40:17,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:40:17,189 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:40:17,189 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:40:17,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:40:17,189 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:40:17,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:40:17,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:40:17,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:40:17,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:40:17,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:40:17,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:40:17,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:40:17,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:40:17,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:40:17,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:40:17,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:40:17,193 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94406c90b46fed2ba639405486e012fa4ad77124178cc3ef79a472c538020bbf [2024-10-10 23:40:17,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:40:17,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:40:17,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:40:17,415 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:40:17,415 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:40:17,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label09.c [2024-10-10 23:40:18,604 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:40:18,851 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:40:18,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label09.c [2024-10-10 23:40:18,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9dac29f12/1981197ac0be46c4b16ce1155456054c/FLAGd45e56d7f [2024-10-10 23:40:18,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9dac29f12/1981197ac0be46c4b16ce1155456054c [2024-10-10 23:40:18,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:40:18,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:40:18,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:40:18,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:40:18,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:40:18,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:40:18" (1/1) ... [2024-10-10 23:40:18,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a8a664c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:18, skipping insertion in model container [2024-10-10 23:40:18,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:40:18" (1/1) ... [2024-10-10 23:40:18,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:40:19,145 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label09.c[5013,5026] [2024-10-10 23:40:19,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:40:19,386 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:40:19,406 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label09.c[5013,5026] [2024-10-10 23:40:19,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:40:19,542 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:40:19,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:19 WrapperNode [2024-10-10 23:40:19,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:40:19,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:40:19,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:40:19,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:40:19,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:19" (1/1) ... [2024-10-10 23:40:19,581 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:19" (1/1) ... [2024-10-10 23:40:19,663 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-10-10 23:40:19,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:40:19,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:40:19,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:40:19,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:40:19,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:19" (1/1) ... [2024-10-10 23:40:19,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:19" (1/1) ... [2024-10-10 23:40:19,718 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:19" (1/1) ... [2024-10-10 23:40:19,766 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:40:19,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:19" (1/1) ... [2024-10-10 23:40:19,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:19" (1/1) ... [2024-10-10 23:40:19,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:19" (1/1) ... [2024-10-10 23:40:19,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:19" (1/1) ... [2024-10-10 23:40:19,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:19" (1/1) ... [2024-10-10 23:40:19,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:19" (1/1) ... [2024-10-10 23:40:19,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:40:19,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:40:19,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:40:19,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:40:19,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:19" (1/1) ... [2024-10-10 23:40:19,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:40:19,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:40:19,882 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:40:19,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:40:19,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:40:19,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:40:19,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:40:19,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:40:19,969 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:40:19,970 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:40:21,441 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-10-10 23:40:21,442 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:40:21,492 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:40:21,495 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:40:21,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:40:21 BoogieIcfgContainer [2024-10-10 23:40:21,495 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:40:21,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:40:21,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:40:21,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:40:21,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:40:18" (1/3) ... [2024-10-10 23:40:21,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b288781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:40:21, skipping insertion in model container [2024-10-10 23:40:21,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:19" (2/3) ... [2024-10-10 23:40:21,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b288781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:40:21, skipping insertion in model container [2024-10-10 23:40:21,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:40:21" (3/3) ... [2024-10-10 23:40:21,503 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label09.c [2024-10-10 23:40:21,515 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:40:21,516 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:40:21,580 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:40:21,585 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;@71f4df47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:40:21,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:40:21,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:21,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 23:40:21,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:21,597 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] [2024-10-10 23:40:21,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:21,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:21,602 INFO L85 PathProgramCache]: Analyzing trace with hash 934117790, now seen corresponding path program 1 times [2024-10-10 23:40:21,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:21,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381877595] [2024-10-10 23:40:21,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:21,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:21,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:21,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381877595] [2024-10-10 23:40:21,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381877595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:21,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:21,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:40:21,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023068841] [2024-10-10 23:40:21,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:21,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:40:21,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:21,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:40:21,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:40:21,811 INFO L87 Difference]: Start difference. First operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 0 states have call successors, (0), 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 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:21,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:21,908 INFO L93 Difference]: Finished difference Result 667 states and 1321 transitions. [2024-10-10 23:40:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:40:21,910 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-10 23:40:21,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:21,923 INFO L225 Difference]: With dead ends: 667 [2024-10-10 23:40:21,923 INFO L226 Difference]: Without dead ends: 332 [2024-10-10 23:40:21,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:40:21,931 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:21,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:40:21,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-10 23:40:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-10-10 23:40:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2024-10-10 23:40:21,985 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 46 [2024-10-10 23:40:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:21,986 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2024-10-10 23:40:21,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2024-10-10 23:40:21,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 23:40:21,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:21,987 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] [2024-10-10 23:40:21,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:40:21,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:21,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:21,988 INFO L85 PathProgramCache]: Analyzing trace with hash 177399788, now seen corresponding path program 1 times [2024-10-10 23:40:21,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:21,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433942596] [2024-10-10 23:40:21,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:21,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:22,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:22,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433942596] [2024-10-10 23:40:22,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433942596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:22,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:22,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:40:22,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889765879] [2024-10-10 23:40:22,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:22,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:22,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:22,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:22,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:22,117 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:23,585 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2024-10-10 23:40:23,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:23,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-10 23:40:23,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:23,588 INFO L225 Difference]: With dead ends: 992 [2024-10-10 23:40:23,588 INFO L226 Difference]: Without dead ends: 661 [2024-10-10 23:40:23,589 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-10-10 23:40:23,590 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 303 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:23,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 77 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:40:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-10 23:40:23,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2024-10-10 23:40:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.7015151515151514) internal successors, (1123), 660 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1123 transitions. [2024-10-10 23:40:23,608 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1123 transitions. Word has length 46 [2024-10-10 23:40:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:23,608 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1123 transitions. [2024-10-10 23:40:23,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1123 transitions. [2024-10-10 23:40:23,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-10 23:40:23,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:23,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:23,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:40:23,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:23,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:23,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1379329068, now seen corresponding path program 1 times [2024-10-10 23:40:23,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:23,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583657399] [2024-10-10 23:40:23,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:23,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:23,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:23,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583657399] [2024-10-10 23:40:23,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583657399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:23,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:23,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:40:23,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160541773] [2024-10-10 23:40:23,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:23,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:23,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:23,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:23,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:23,753 INFO L87 Difference]: Start difference. First operand 661 states and 1123 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:24,797 INFO L93 Difference]: Finished difference Result 1979 states and 3366 transitions. [2024-10-10 23:40:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:24,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-10-10 23:40:24,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:24,802 INFO L225 Difference]: With dead ends: 1979 [2024-10-10 23:40:24,802 INFO L226 Difference]: Without dead ends: 1319 [2024-10-10 23:40:24,803 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-10-10 23:40:24,804 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 343 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:24,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 75 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:40:24,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2024-10-10 23:40:24,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2024-10-10 23:40:24,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.6206373292867982) internal successors, (2136), 1318 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 2136 transitions. [2024-10-10 23:40:24,835 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 2136 transitions. Word has length 112 [2024-10-10 23:40:24,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:24,836 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 2136 transitions. [2024-10-10 23:40:24,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:24,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 2136 transitions. [2024-10-10 23:40:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-10 23:40:24,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:24,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:24,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:40:24,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:24,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:24,840 INFO L85 PathProgramCache]: Analyzing trace with hash 349901142, now seen corresponding path program 1 times [2024-10-10 23:40:24,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:24,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649706846] [2024-10-10 23:40:24,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:24,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:24,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:24,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649706846] [2024-10-10 23:40:24,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649706846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:24,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:24,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:40:24,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941710390] [2024-10-10 23:40:24,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:24,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:24,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:24,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:24,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:24,969 INFO L87 Difference]: Start difference. First operand 1319 states and 2136 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:26,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:26,055 INFO L93 Difference]: Finished difference Result 3295 states and 5284 transitions. [2024-10-10 23:40:26,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:26,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-10 23:40:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:26,063 INFO L225 Difference]: With dead ends: 3295 [2024-10-10 23:40:26,063 INFO L226 Difference]: Without dead ends: 1977 [2024-10-10 23:40:26,071 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-10-10 23:40:26,072 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 381 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:26,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 153 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:40:26,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2024-10-10 23:40:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1977. [2024-10-10 23:40:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1976 states have (on average 1.33248987854251) internal successors, (2633), 1976 states have internal predecessors, (2633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2633 transitions. [2024-10-10 23:40:26,098 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2633 transitions. Word has length 113 [2024-10-10 23:40:26,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:26,099 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 2633 transitions. [2024-10-10 23:40:26,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:26,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2633 transitions. [2024-10-10 23:40:26,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-10 23:40:26,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:26,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:26,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:40:26,106 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:26,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:26,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1159778044, now seen corresponding path program 1 times [2024-10-10 23:40:26,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:26,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305280627] [2024-10-10 23:40:26,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:26,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:26,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:26,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305280627] [2024-10-10 23:40:26,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305280627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:26,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:26,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:40:26,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198634659] [2024-10-10 23:40:26,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:26,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:26,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:26,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:26,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:26,303 INFO L87 Difference]: Start difference. First operand 1977 states and 2633 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:27,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:27,288 INFO L93 Difference]: Finished difference Result 5927 states and 7896 transitions. [2024-10-10 23:40:27,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:27,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2024-10-10 23:40:27,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:27,298 INFO L225 Difference]: With dead ends: 5927 [2024-10-10 23:40:27,298 INFO L226 Difference]: Without dead ends: 3951 [2024-10-10 23:40:27,301 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-10-10 23:40:27,301 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 181 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:27,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 257 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:40:27,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-10 23:40:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-10 23:40:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.2164556962025317) internal successors, (4805), 3950 states have internal predecessors, (4805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4805 transitions. [2024-10-10 23:40:27,345 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4805 transitions. Word has length 205 [2024-10-10 23:40:27,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:27,346 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4805 transitions. [2024-10-10 23:40:27,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:27,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4805 transitions. [2024-10-10 23:40:27,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-10-10 23:40:27,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:27,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:27,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:40:27,351 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:27,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:27,352 INFO L85 PathProgramCache]: Analyzing trace with hash 358823091, now seen corresponding path program 1 times [2024-10-10 23:40:27,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:27,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132050727] [2024-10-10 23:40:27,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:27,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:27,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:27,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132050727] [2024-10-10 23:40:27,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132050727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:27,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:27,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:27,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141752881] [2024-10-10 23:40:27,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:27,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:40:27,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:27,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:40:27,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:40:27,822 INFO L87 Difference]: Start difference. First operand 3951 states and 4805 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:28,861 INFO L93 Difference]: Finished difference Result 8230 states and 9950 transitions. [2024-10-10 23:40:28,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:40:28,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 291 [2024-10-10 23:40:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:28,872 INFO L225 Difference]: With dead ends: 8230 [2024-10-10 23:40:28,872 INFO L226 Difference]: Without dead ends: 4280 [2024-10-10 23:40:28,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:40:28,876 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 127 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:28,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 318 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:40:28,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2024-10-10 23:40:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2024-10-10 23:40:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 4279 states have (on average 1.2012152372049545) internal successors, (5140), 4279 states have internal predecessors, (5140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5140 transitions. [2024-10-10 23:40:28,922 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5140 transitions. Word has length 291 [2024-10-10 23:40:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:28,922 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 5140 transitions. [2024-10-10 23:40:28,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5140 transitions. [2024-10-10 23:40:28,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-10-10 23:40:28,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:28,926 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:28,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:40:28,926 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:28,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:28,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1697588823, now seen corresponding path program 1 times [2024-10-10 23:40:28,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:28,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839342054] [2024-10-10 23:40:28,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:28,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:29,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:29,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839342054] [2024-10-10 23:40:29,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839342054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:29,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:29,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:40:29,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702973807] [2024-10-10 23:40:29,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:29,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:40:29,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:29,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:40:29,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:40:29,466 INFO L87 Difference]: Start difference. First operand 4280 states and 5140 transitions. Second operand has 7 states, 7 states have (on average 54.0) internal successors, (378), 6 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:30,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:30,702 INFO L93 Difference]: Finished difference Result 8089 states and 9791 transitions. [2024-10-10 23:40:30,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:40:30,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 54.0) internal successors, (378), 6 states have internal predecessors, (378), 0 states have call successors, (0), 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 378 [2024-10-10 23:40:30,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:30,711 INFO L225 Difference]: With dead ends: 8089 [2024-10-10 23:40:30,711 INFO L226 Difference]: Without dead ends: 3951 [2024-10-10 23:40:30,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:40:30,715 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 314 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:30,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 285 Invalid, 2273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:40:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-10 23:40:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-10 23:40:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.080253164556962) internal successors, (4267), 3950 states have internal predecessors, (4267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4267 transitions. [2024-10-10 23:40:30,750 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4267 transitions. Word has length 378 [2024-10-10 23:40:30,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:30,750 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4267 transitions. [2024-10-10 23:40:30,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 54.0) internal successors, (378), 6 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:30,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4267 transitions. [2024-10-10 23:40:30,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2024-10-10 23:40:30,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:30,754 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:30,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:40:30,754 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:30,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash -546499047, now seen corresponding path program 1 times [2024-10-10 23:40:30,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:30,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922042075] [2024-10-10 23:40:30,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:30,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-10 23:40:31,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:31,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922042075] [2024-10-10 23:40:31,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922042075] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:40:31,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194729461] [2024-10-10 23:40:31,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:31,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:40:31,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:40:31,093 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:40:31,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:40:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:31,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:40:31,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:40:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-10 23:40:31,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:40:31,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194729461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:31,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:40:31,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 23:40:31,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184878335] [2024-10-10 23:40:31,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:31,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:31,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:31,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:31,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:40:31,641 INFO L87 Difference]: Start difference. First operand 3951 states and 4267 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:32,234 INFO L93 Difference]: Finished difference Result 4940 states and 5286 transitions. [2024-10-10 23:40:32,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:32,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 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 385 [2024-10-10 23:40:32,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:32,246 INFO L225 Difference]: With dead ends: 4940 [2024-10-10 23:40:32,246 INFO L226 Difference]: Without dead ends: 4938 [2024-10-10 23:40:32,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:40:32,247 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:32,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 81 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:40:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2024-10-10 23:40:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4280. [2024-10-10 23:40:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 4279 states have (on average 1.077120822622108) internal successors, (4609), 4279 states have internal predecessors, (4609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:32,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 4609 transitions. [2024-10-10 23:40:32,289 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 4609 transitions. Word has length 385 [2024-10-10 23:40:32,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:32,290 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 4609 transitions. [2024-10-10 23:40:32,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 4609 transitions. [2024-10-10 23:40:32,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2024-10-10 23:40:32,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:32,298 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:32,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:40:32,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:40:32,499 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:32,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:32,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2002770229, now seen corresponding path program 1 times [2024-10-10 23:40:32,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:32,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638009500] [2024-10-10 23:40:32,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:32,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 567 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-10 23:40:33,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:33,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638009500] [2024-10-10 23:40:33,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638009500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:33,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:33,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:33,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172628] [2024-10-10 23:40:33,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:33,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:40:33,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:33,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:40:33,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:40:33,042 INFO L87 Difference]: Start difference. First operand 4280 states and 4609 transitions. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:34,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:34,038 INFO L93 Difference]: Finished difference Result 12178 states and 13188 transitions. [2024-10-10 23:40:34,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:40:34,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 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 584 [2024-10-10 23:40:34,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:34,056 INFO L225 Difference]: With dead ends: 12178 [2024-10-10 23:40:34,056 INFO L226 Difference]: Without dead ends: 8228 [2024-10-10 23:40:34,059 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-10-10 23:40:34,060 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 401 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:34,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 88 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:40:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8228 states. [2024-10-10 23:40:34,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8228 to 7899. [2024-10-10 23:40:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7899 states, 7898 states have (on average 1.0724233983286908) internal successors, (8470), 7898 states have internal predecessors, (8470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:34,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7899 states to 7899 states and 8470 transitions. [2024-10-10 23:40:34,168 INFO L78 Accepts]: Start accepts. Automaton has 7899 states and 8470 transitions. Word has length 584 [2024-10-10 23:40:34,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:34,170 INFO L471 AbstractCegarLoop]: Abstraction has 7899 states and 8470 transitions. [2024-10-10 23:40:34,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 7899 states and 8470 transitions. [2024-10-10 23:40:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2024-10-10 23:40:34,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:34,181 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:34,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:40:34,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:34,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:34,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1440010828, now seen corresponding path program 1 times [2024-10-10 23:40:34,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:34,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124501497] [2024-10-10 23:40:34,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:34,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-10-10 23:40:34,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:34,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124501497] [2024-10-10 23:40:34,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124501497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:34,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:34,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:34,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674141642] [2024-10-10 23:40:34,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:34,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:34,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:34,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:34,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:34,697 INFO L87 Difference]: Start difference. First operand 7899 states and 8470 transitions. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:35,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:35,289 INFO L93 Difference]: Finished difference Result 18429 states and 19932 transitions. [2024-10-10 23:40:35,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:35,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 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 688 [2024-10-10 23:40:35,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:35,304 INFO L225 Difference]: With dead ends: 18429 [2024-10-10 23:40:35,304 INFO L226 Difference]: Without dead ends: 11189 [2024-10-10 23:40:35,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:35,312 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 223 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:35,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 36 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:40:35,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11189 states. [2024-10-10 23:40:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11189 to 11189. [2024-10-10 23:40:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11189 states, 11188 states have (on average 1.0761530210940293) internal successors, (12040), 11188 states have internal predecessors, (12040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11189 states to 11189 states and 12040 transitions. [2024-10-10 23:40:35,408 INFO L78 Accepts]: Start accepts. Automaton has 11189 states and 12040 transitions. Word has length 688 [2024-10-10 23:40:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:35,409 INFO L471 AbstractCegarLoop]: Abstraction has 11189 states and 12040 transitions. [2024-10-10 23:40:35,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 11189 states and 12040 transitions. [2024-10-10 23:40:35,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2024-10-10 23:40:35,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:35,418 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:35,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:40:35,418 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:35,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:35,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1058467972, now seen corresponding path program 1 times [2024-10-10 23:40:35,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:35,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815138608] [2024-10-10 23:40:35,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:35,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1598 backedges. 978 proven. 0 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2024-10-10 23:40:36,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:36,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815138608] [2024-10-10 23:40:36,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815138608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:36,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:36,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:36,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039653274] [2024-10-10 23:40:36,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:36,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:40:36,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:36,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:40:36,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:40:36,175 INFO L87 Difference]: Start difference. First operand 11189 states and 12040 transitions. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:37,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:37,099 INFO L93 Difference]: Finished difference Result 22048 states and 23748 transitions. [2024-10-10 23:40:37,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:40:37,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 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 807 [2024-10-10 23:40:37,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:37,114 INFO L225 Difference]: With dead ends: 22048 [2024-10-10 23:40:37,114 INFO L226 Difference]: Without dead ends: 11189 [2024-10-10 23:40:37,123 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-10-10 23:40:37,123 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 268 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:37,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 120 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:40:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11189 states. [2024-10-10 23:40:37,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11189 to 11189. [2024-10-10 23:40:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11189 states, 11188 states have (on average 1.0757061136932426) internal successors, (12035), 11188 states have internal predecessors, (12035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11189 states to 11189 states and 12035 transitions. [2024-10-10 23:40:37,286 INFO L78 Accepts]: Start accepts. Automaton has 11189 states and 12035 transitions. Word has length 807 [2024-10-10 23:40:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:37,287 INFO L471 AbstractCegarLoop]: Abstraction has 11189 states and 12035 transitions. [2024-10-10 23:40:37,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 11189 states and 12035 transitions. [2024-10-10 23:40:37,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2024-10-10 23:40:37,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:37,302 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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-10-10 23:40:37,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:40:37,303 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:37,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:37,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1754832480, now seen corresponding path program 1 times [2024-10-10 23:40:37,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:37,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914936399] [2024-10-10 23:40:37,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:37,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1659 backedges. 953 proven. 0 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2024-10-10 23:40:37,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:37,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914936399] [2024-10-10 23:40:37,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914936399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:37,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:37,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:37,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017815262] [2024-10-10 23:40:37,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:37,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:37,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:37,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:37,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:37,738 INFO L87 Difference]: Start difference. First operand 11189 states and 12035 transitions. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:38,342 INFO L93 Difference]: Finished difference Result 24351 states and 26360 transitions. [2024-10-10 23:40:38,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:38,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 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 868 [2024-10-10 23:40:38,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:38,356 INFO L225 Difference]: With dead ends: 24351 [2024-10-10 23:40:38,357 INFO L226 Difference]: Without dead ends: 13821 [2024-10-10 23:40:38,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:38,365 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:38,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 434 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:40:38,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2024-10-10 23:40:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 13163. [2024-10-10 23:40:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13162 states have (on average 1.065491566631211) internal successors, (14024), 13162 states have internal predecessors, (14024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 14024 transitions. [2024-10-10 23:40:38,481 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 14024 transitions. Word has length 868 [2024-10-10 23:40:38,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:38,482 INFO L471 AbstractCegarLoop]: Abstraction has 13163 states and 14024 transitions. [2024-10-10 23:40:38,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 14024 transitions. [2024-10-10 23:40:38,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2024-10-10 23:40:38,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:38,493 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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-10-10 23:40:38,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:40:38,493 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:38,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:38,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1972975999, now seen corresponding path program 1 times [2024-10-10 23:40:38,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:38,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353388127] [2024-10-10 23:40:38,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:38,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 602 proven. 0 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2024-10-10 23:40:38,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:38,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353388127] [2024-10-10 23:40:38,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353388127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:38,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:38,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:38,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609499062] [2024-10-10 23:40:38,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:38,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:38,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:38,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:38,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:38,892 INFO L87 Difference]: Start difference. First operand 13163 states and 14024 transitions. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:39,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:39,502 INFO L93 Difference]: Finished difference Result 30602 states and 32689 transitions. [2024-10-10 23:40:39,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:39,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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 869 [2024-10-10 23:40:39,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:39,518 INFO L225 Difference]: With dead ends: 30602 [2024-10-10 23:40:39,519 INFO L226 Difference]: Without dead ends: 16782 [2024-10-10 23:40:39,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:39,530 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 272 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:39,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 425 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:40:39,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16782 states. [2024-10-10 23:40:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16782 to 16453. [2024-10-10 23:40:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 16452 states have (on average 1.050145878920496) internal successors, (17277), 16452 states have internal predecessors, (17277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 17277 transitions. [2024-10-10 23:40:39,662 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 17277 transitions. Word has length 869 [2024-10-10 23:40:39,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:39,662 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 17277 transitions. [2024-10-10 23:40:39,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:39,663 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 17277 transitions. [2024-10-10 23:40:39,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 882 [2024-10-10 23:40:39,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:39,673 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-10 23:40:39,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:40:39,673 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:39,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:39,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1532715487, now seen corresponding path program 1 times [2024-10-10 23:40:39,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:39,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548284924] [2024-10-10 23:40:39,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:39,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1712 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2024-10-10 23:40:40,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:40,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548284924] [2024-10-10 23:40:40,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548284924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:40,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:40,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:40,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323427506] [2024-10-10 23:40:40,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:40,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:40,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:40,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:40,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:40,058 INFO L87 Difference]: Start difference. First operand 16453 states and 17277 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:40,636 INFO L93 Difference]: Finished difference Result 33563 states and 35283 transitions. [2024-10-10 23:40:40,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:40,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 881 [2024-10-10 23:40:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:40,652 INFO L225 Difference]: With dead ends: 33563 [2024-10-10 23:40:40,652 INFO L226 Difference]: Without dead ends: 17769 [2024-10-10 23:40:40,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:40,708 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 253 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:40,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 422 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:40:40,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17769 states. [2024-10-10 23:40:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17769 to 17111. [2024-10-10 23:40:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17111 states, 17110 states have (on average 1.0423728813559323) internal successors, (17835), 17110 states have internal predecessors, (17835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17111 states to 17111 states and 17835 transitions. [2024-10-10 23:40:40,887 INFO L78 Accepts]: Start accepts. Automaton has 17111 states and 17835 transitions. Word has length 881 [2024-10-10 23:40:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:40,888 INFO L471 AbstractCegarLoop]: Abstraction has 17111 states and 17835 transitions. [2024-10-10 23:40:40,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 17111 states and 17835 transitions. [2024-10-10 23:40:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2024-10-10 23:40:40,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:40,905 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:40,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:40:40,905 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:40,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:40,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1050087831, now seen corresponding path program 1 times [2024-10-10 23:40:40,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:40,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478413786] [2024-10-10 23:40:40,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:40,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:41,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-10-10 23:40:41,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:41,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478413786] [2024-10-10 23:40:41,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478413786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:41,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:41,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:41,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054499157] [2024-10-10 23:40:41,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:41,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:41,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:41,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:41,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:41,646 INFO L87 Difference]: Start difference. First operand 17111 states and 17835 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:42,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:42,189 INFO L93 Difference]: Finished difference Result 33563 states and 35007 transitions. [2024-10-10 23:40:42,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:42,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 895 [2024-10-10 23:40:42,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:42,203 INFO L225 Difference]: With dead ends: 33563 [2024-10-10 23:40:42,204 INFO L226 Difference]: Without dead ends: 17111 [2024-10-10 23:40:42,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:42,213 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 285 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:42,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 374 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:40:42,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17111 states. [2024-10-10 23:40:42,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17111 to 16782. [2024-10-10 23:40:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16782 states, 16781 states have (on average 1.0376020499374292) internal successors, (17412), 16781 states have internal predecessors, (17412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16782 states to 16782 states and 17412 transitions. [2024-10-10 23:40:42,329 INFO L78 Accepts]: Start accepts. Automaton has 16782 states and 17412 transitions. Word has length 895 [2024-10-10 23:40:42,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:42,330 INFO L471 AbstractCegarLoop]: Abstraction has 16782 states and 17412 transitions. [2024-10-10 23:40:42,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:42,330 INFO L276 IsEmpty]: Start isEmpty. Operand 16782 states and 17412 transitions. [2024-10-10 23:40:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2024-10-10 23:40:42,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:42,344 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:42,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:40:42,345 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:42,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:42,345 INFO L85 PathProgramCache]: Analyzing trace with hash 750333196, now seen corresponding path program 1 times [2024-10-10 23:40:42,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:42,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826028519] [2024-10-10 23:40:42,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:42,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3244 backedges. 832 proven. 0 refuted. 0 times theorem prover too weak. 2412 trivial. 0 not checked. [2024-10-10 23:40:42,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:42,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826028519] [2024-10-10 23:40:42,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826028519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:42,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:42,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:42,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478486957] [2024-10-10 23:40:42,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:42,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:42,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:42,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:42,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:42,886 INFO L87 Difference]: Start difference. First operand 16782 states and 17412 transitions. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:43,509 INFO L93 Difference]: Finished difference Result 35537 states and 36958 transitions. [2024-10-10 23:40:43,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:43,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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 1222 [2024-10-10 23:40:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:43,522 INFO L225 Difference]: With dead ends: 35537 [2024-10-10 23:40:43,522 INFO L226 Difference]: Without dead ends: 17111 [2024-10-10 23:40:43,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:43,530 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 273 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:43,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 410 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:40:43,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17111 states. [2024-10-10 23:40:43,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17111 to 17111. [2024-10-10 23:40:43,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17111 states, 17110 states have (on average 1.0328462887200467) internal successors, (17672), 17110 states have internal predecessors, (17672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17111 states to 17111 states and 17672 transitions. [2024-10-10 23:40:43,642 INFO L78 Accepts]: Start accepts. Automaton has 17111 states and 17672 transitions. Word has length 1222 [2024-10-10 23:40:43,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:43,642 INFO L471 AbstractCegarLoop]: Abstraction has 17111 states and 17672 transitions. [2024-10-10 23:40:43,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 17111 states and 17672 transitions. [2024-10-10 23:40:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1355 [2024-10-10 23:40:43,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:43,659 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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-10-10 23:40:43,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:40:43,659 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:43,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash 458135791, now seen corresponding path program 1 times [2024-10-10 23:40:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:43,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303123471] [2024-10-10 23:40:43,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:43,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:44,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4274 backedges. 2876 proven. 0 refuted. 0 times theorem prover too weak. 1398 trivial. 0 not checked. [2024-10-10 23:40:44,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:44,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303123471] [2024-10-10 23:40:44,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303123471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:44,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:44,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:44,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723423371] [2024-10-10 23:40:44,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:44,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:44,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:44,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:44,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:44,298 INFO L87 Difference]: Start difference. First operand 17111 states and 17672 transitions. Second operand has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:44,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:44,920 INFO L93 Difference]: Finished difference Result 33892 states and 35011 transitions. [2024-10-10 23:40:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:44,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 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 1354 [2024-10-10 23:40:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:44,935 INFO L225 Difference]: With dead ends: 33892 [2024-10-10 23:40:44,935 INFO L226 Difference]: Without dead ends: 17111 [2024-10-10 23:40:44,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:44,946 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 192 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:44,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 418 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:40:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17111 states. [2024-10-10 23:40:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17111 to 16782. [2024-10-10 23:40:45,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16782 states, 16781 states have (on average 1.026637268339193) internal successors, (17228), 16781 states have internal predecessors, (17228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:45,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16782 states to 16782 states and 17228 transitions. [2024-10-10 23:40:45,102 INFO L78 Accepts]: Start accepts. Automaton has 16782 states and 17228 transitions. Word has length 1354 [2024-10-10 23:40:45,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:45,103 INFO L471 AbstractCegarLoop]: Abstraction has 16782 states and 17228 transitions. [2024-10-10 23:40:45,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:45,103 INFO L276 IsEmpty]: Start isEmpty. Operand 16782 states and 17228 transitions. [2024-10-10 23:40:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1365 [2024-10-10 23:40:45,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:45,117 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, 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, 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, 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, 5, 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, 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] [2024-10-10 23:40:45,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:40:45,118 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:45,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:45,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2050918627, now seen corresponding path program 1 times [2024-10-10 23:40:45,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:45,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884865280] [2024-10-10 23:40:45,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:45,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3411 backedges. 721 proven. 0 refuted. 0 times theorem prover too weak. 2690 trivial. 0 not checked. [2024-10-10 23:40:46,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:46,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884865280] [2024-10-10 23:40:46,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884865280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:46,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:46,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:46,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998325414] [2024-10-10 23:40:46,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:46,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:46,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:46,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:46,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:46,174 INFO L87 Difference]: Start difference. First operand 16782 states and 17228 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:46,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:46,732 INFO L93 Difference]: Finished difference Result 32905 states and 33793 transitions. [2024-10-10 23:40:46,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:46,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 1364 [2024-10-10 23:40:46,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:46,746 INFO L225 Difference]: With dead ends: 32905 [2024-10-10 23:40:46,746 INFO L226 Difference]: Without dead ends: 16782 [2024-10-10 23:40:46,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:46,757 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 271 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:46,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 361 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:40:46,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16782 states. [2024-10-10 23:40:46,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16782 to 16782. [2024-10-10 23:40:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16782 states, 16781 states have (on average 1.0228234312615458) internal successors, (17164), 16781 states have internal predecessors, (17164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16782 states to 16782 states and 17164 transitions. [2024-10-10 23:40:46,869 INFO L78 Accepts]: Start accepts. Automaton has 16782 states and 17164 transitions. Word has length 1364 [2024-10-10 23:40:46,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:46,870 INFO L471 AbstractCegarLoop]: Abstraction has 16782 states and 17164 transitions. [2024-10-10 23:40:46,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:46,870 INFO L276 IsEmpty]: Start isEmpty. Operand 16782 states and 17164 transitions. [2024-10-10 23:40:46,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1693 [2024-10-10 23:40:46,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:46,889 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:46,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:40:46,889 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:46,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:46,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1445560782, now seen corresponding path program 1 times [2024-10-10 23:40:46,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:46,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984672818] [2024-10-10 23:40:46,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:46,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4773 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 4414 trivial. 0 not checked. [2024-10-10 23:40:47,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:47,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984672818] [2024-10-10 23:40:47,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984672818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:47,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:47,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:47,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549958099] [2024-10-10 23:40:47,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:47,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:47,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:47,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:47,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:47,683 INFO L87 Difference]: Start difference. First operand 16782 states and 17164 transitions. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:48,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:48,237 INFO L93 Difference]: Finished difference Result 32903 states and 33664 transitions. [2024-10-10 23:40:48,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:48,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 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 1692 [2024-10-10 23:40:48,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:48,238 INFO L225 Difference]: With dead ends: 32903 [2024-10-10 23:40:48,238 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:40:48,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:48,248 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 289 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:48,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 404 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:40:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:40:48,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:40:48,249 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-10-10 23:40:48,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:40:48,249 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1692 [2024-10-10 23:40:48,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:48,249 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:40:48,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:48,250 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:40:48,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:40:48,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:40:48,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:40:48,254 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] [2024-10-10 23:40:48,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:40:48,969 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:40:48,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:40:48 BoogieIcfgContainer [2024-10-10 23:40:48,985 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:40:48,985 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:40:48,985 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:40:48,986 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:40:48,986 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:40:21" (3/4) ... [2024-10-10 23:40:48,988 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:40:49,013 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-10 23:40:49,014 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:40:49,016 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:40:49,017 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:40:49,196 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:40:49,196 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:40:49,196 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:40:49,197 INFO L158 Benchmark]: Toolchain (without parser) took 30309.03ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 69.1MB in the beginning and 519.6MB in the end (delta: -450.5MB). Peak memory consumption was 705.6MB. Max. memory is 16.1GB. [2024-10-10 23:40:49,197 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 107.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:40:49,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 652.50ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 68.9MB in the beginning and 117.0MB in the end (delta: -48.0MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-10-10 23:40:49,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.47ms. Allocated memory is still 201.3MB. Free memory was 117.0MB in the beginning and 92.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-10 23:40:49,198 INFO L158 Benchmark]: Boogie Preprocessor took 185.55ms. Allocated memory is still 201.3MB. Free memory was 92.8MB in the beginning and 118.8MB in the end (delta: -26.0MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-10-10 23:40:49,198 INFO L158 Benchmark]: RCFGBuilder took 1644.16ms. Allocated memory was 201.3MB in the beginning and 304.1MB in the end (delta: 102.8MB). Free memory was 118.8MB in the beginning and 230.6MB in the end (delta: -111.8MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. [2024-10-10 23:40:49,198 INFO L158 Benchmark]: TraceAbstraction took 27488.44ms. Allocated memory was 304.1MB in the beginning and 1.3GB in the end (delta: 994.1MB). Free memory was 229.6MB in the beginning and 545.8MB in the end (delta: -316.3MB). Peak memory consumption was 677.8MB. Max. memory is 16.1GB. [2024-10-10 23:40:49,198 INFO L158 Benchmark]: Witness Printer took 211.13ms. Allocated memory is still 1.3GB. Free memory was 545.8MB in the beginning and 519.6MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-10 23:40:49,200 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.12ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 107.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 652.50ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 68.9MB in the beginning and 117.0MB in the end (delta: -48.0MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.47ms. Allocated memory is still 201.3MB. Free memory was 117.0MB in the beginning and 92.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 185.55ms. Allocated memory is still 201.3MB. Free memory was 92.8MB in the beginning and 118.8MB in the end (delta: -26.0MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1644.16ms. Allocated memory was 201.3MB in the beginning and 304.1MB in the end (delta: 102.8MB). Free memory was 118.8MB in the beginning and 230.6MB in the end (delta: -111.8MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. * TraceAbstraction took 27488.44ms. Allocated memory was 304.1MB in the beginning and 1.3GB in the end (delta: 994.1MB). Free memory was 229.6MB in the beginning and 545.8MB in the end (delta: -316.3MB). Peak memory consumption was 677.8MB. Max. memory is 16.1GB. * Witness Printer took 211.13ms. Allocated memory is still 1.3GB. Free memory was 545.8MB in the beginning and 519.6MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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: 158]: 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, 334 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.7s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4704 SdHoareTripleChecker+Valid, 13.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4704 mSDsluCounter, 5334 SdHoareTripleChecker+Invalid, 11.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 2787 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17060 IncrementalHoareTripleChecker+Invalid, 19847 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2787 mSolverCounterUnsat, 5174 mSDtfsCounter, 17060 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 446 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17111occurred in iteration=14, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 3290 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 13185 NumberOfCodeBlocks, 13185 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 13165 ConstructedInterpolants, 0 QuantifiedInterpolants, 26759 SizeOfPredicates, 0 NumberOfNonLiveVariables, 480 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 26377/26413 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: 1783]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a16 == 9) && (7 == a12)) || (((a16 == 8) && (a15 != 3)) && (7 == a12))) || ((a12 == 9) && (a16 == 9))) || ((a12 == 6) && (a16 <= 11))) || (((a16 == 8) && (a15 <= 3)) && (((long long) 87 + a18) <= 0))) || (((0 <= ((long long) 87 + a18)) && (5 == a12)) && (a15 == 3))) || (((0 <= ((long long) 87 + a18)) && (a16 == 9)) && (a15 <= 3))) || (((a12 == 9) && (a15 <= 3)) && (((long long) 87 + a18) <= 0))) || ((a16 == 8) && (a12 <= 6))) || (((5 == a12) && (a15 == 3)) && (11 <= a16))) || ((a16 == 9) && (5 == a12))) || ((a16 == 9) && (a12 == 8))) || ((a16 == 8) && (a12 == 8))) || ((a15 <= 3) && (a12 == 8))) || ((a12 == 9) && (a16 == 8))) || (((a15 <= 3) && (11 <= a16)) && (7 == a12))) || (((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a12 == 6))) || (((a12 <= 5) && (a15 != 3)) && (a16 <= 11))) || (((a12 == 9) && (a15 <= 3)) && (11 <= a16))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:40:49,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE