./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label25.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 699ecca4c05e82af9ddaf76f64fe18abd85263cf30f7f15e631a0ddff4b0faf4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:09:12,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:09:12,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:09:12,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:09:12,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:09:12,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:09:12,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:09:12,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:09:12,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:09:12,791 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:09:12,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:09:12,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:09:12,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:09:12,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:09:12,793 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:09:12,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:09:12,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:09:12,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:09:12,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:09:12,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:09:12,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:09:12,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:09:12,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:09:12,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:09:12,800 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:09:12,801 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:09:12,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:09:12,801 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:09:12,801 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:09:12,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:09:12,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:09:12,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:09:12,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:09:12,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:09:12,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:09:12,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:09:12,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:09:12,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:09:12,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:09:12,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:09:12,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:09:12,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:09:12,806 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 699ecca4c05e82af9ddaf76f64fe18abd85263cf30f7f15e631a0ddff4b0faf4 [2024-11-08 11:09:13,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:09:13,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:09:13,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:09:13,105 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:09:13,105 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:09:13,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label25.c [2024-11-08 11:09:14,549 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:09:14,813 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:09:14,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label25.c [2024-11-08 11:09:14,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16cd8d6f/d1ae6adc62a6456395c06d961b0de683/FLAG14ed0981d [2024-11-08 11:09:15,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16cd8d6f/d1ae6adc62a6456395c06d961b0de683 [2024-11-08 11:09:15,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:09:15,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:09:15,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:09:15,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:09:15,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:09:15,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:09:15" (1/1) ... [2024-11-08 11:09:15,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68bcca6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:15, skipping insertion in model container [2024-11-08 11:09:15,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:09:15" (1/1) ... [2024-11-08 11:09:15,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:09:15,495 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label25.c[7284,7297] [2024-11-08 11:09:15,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:09:15,656 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:09:15,696 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label25.c[7284,7297] [2024-11-08 11:09:15,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:09:15,789 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:09:15,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:15 WrapperNode [2024-11-08 11:09:15,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:09:15,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:09:15,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:09:15,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:09:15,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:15" (1/1) ... [2024-11-08 11:09:15,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:15" (1/1) ... [2024-11-08 11:09:15,877 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-08 11:09:15,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:09:15,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:09:15,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:09:15,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:09:15,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:15" (1/1) ... [2024-11-08 11:09:15,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:15" (1/1) ... [2024-11-08 11:09:15,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:15" (1/1) ... [2024-11-08 11:09:15,950 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:09:15,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:15" (1/1) ... [2024-11-08 11:09:15,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:15" (1/1) ... [2024-11-08 11:09:16,009 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:15" (1/1) ... [2024-11-08 11:09:16,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:15" (1/1) ... [2024-11-08 11:09:16,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:15" (1/1) ... [2024-11-08 11:09:16,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:15" (1/1) ... [2024-11-08 11:09:16,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:09:16,054 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:09:16,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:09:16,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:09:16,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:15" (1/1) ... [2024-11-08 11:09:16,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:09:16,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:09:16,111 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:09:16,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:09:16,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:09:16,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:09:16,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:09:16,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:09:16,248 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:09:16,250 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:09:17,444 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-08 11:09:17,444 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:09:17,470 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:09:17,471 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:09:17,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:17 BoogieIcfgContainer [2024-11-08 11:09:17,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:09:17,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:09:17,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:09:17,478 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:09:17,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:09:15" (1/3) ... [2024-11-08 11:09:17,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2160118b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:09:17, skipping insertion in model container [2024-11-08 11:09:17,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:15" (2/3) ... [2024-11-08 11:09:17,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2160118b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:09:17, skipping insertion in model container [2024-11-08 11:09:17,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:17" (3/3) ... [2024-11-08 11:09:17,482 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label25.c [2024-11-08 11:09:17,503 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:09:17,503 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:09:17,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:09:17,586 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;@cee413a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:09:17,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:09:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 11:09:17,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:17,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:17,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:17,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:17,610 INFO L85 PathProgramCache]: Analyzing trace with hash -107486446, now seen corresponding path program 1 times [2024-11-08 11:09:17,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:17,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117211333] [2024-11-08 11:09:17,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:17,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:18,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:18,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117211333] [2024-11-08 11:09:18,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117211333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:18,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:18,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:09:18,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116121951] [2024-11-08 11:09:18,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:18,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:18,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:18,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:18,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:18,153 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:18,953 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-08 11:09:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:18,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-08 11:09:18,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:18,971 INFO L225 Difference]: With dead ends: 552 [2024-11-08 11:09:18,971 INFO L226 Difference]: Without dead ends: 282 [2024-11-08 11:09:18,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:18,979 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:18,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 120 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:09:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-08 11:09:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-08 11:09:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 281 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2024-11-08 11:09:19,033 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 64 [2024-11-08 11:09:19,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:19,034 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2024-11-08 11:09:19,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:19,035 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2024-11-08 11:09:19,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 11:09:19,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:19,039 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:19,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:09:19,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:19,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:19,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1447096606, now seen corresponding path program 1 times [2024-11-08 11:09:19,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:19,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99446614] [2024-11-08 11:09:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:19,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:19,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:19,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99446614] [2024-11-08 11:09:19,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99446614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:19,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:19,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:19,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948314658] [2024-11-08 11:09:19,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:19,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:19,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:19,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:19,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:19,386 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:19,909 INFO L93 Difference]: Finished difference Result 701 states and 967 transitions. [2024-11-08 11:09:19,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:19,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-11-08 11:09:19,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:19,913 INFO L225 Difference]: With dead ends: 701 [2024-11-08 11:09:19,914 INFO L226 Difference]: Without dead ends: 421 [2024-11-08 11:09:19,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:19,916 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 82 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:19,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 215 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:09:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-08 11:09:19,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-08 11:09:19,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.2523809523809524) internal successors, (526), 420 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 526 transitions. [2024-11-08 11:09:19,947 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 526 transitions. Word has length 130 [2024-11-08 11:09:19,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:19,952 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 526 transitions. [2024-11-08 11:09:19,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:19,952 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2024-11-08 11:09:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 11:09:19,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:19,955 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:09:19,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:09:19,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:19,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:19,958 INFO L85 PathProgramCache]: Analyzing trace with hash 845275185, now seen corresponding path program 1 times [2024-11-08 11:09:19,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:19,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250372805] [2024-11-08 11:09:19,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:19,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:20,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:20,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250372805] [2024-11-08 11:09:20,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250372805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:20,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:20,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:09:20,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104858275] [2024-11-08 11:09:20,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:20,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:20,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:20,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:20,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:20,268 INFO L87 Difference]: Start difference. First operand 421 states and 526 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:20,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:20,702 INFO L93 Difference]: Finished difference Result 979 states and 1209 transitions. [2024-11-08 11:09:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:20,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-11-08 11:09:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:20,705 INFO L225 Difference]: With dead ends: 979 [2024-11-08 11:09:20,706 INFO L226 Difference]: Without dead ends: 560 [2024-11-08 11:09:20,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:20,708 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:20,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 77 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:09:20,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-08 11:09:20,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-08 11:09:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.2075134168157424) internal successors, (675), 559 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 675 transitions. [2024-11-08 11:09:20,727 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 675 transitions. Word has length 137 [2024-11-08 11:09:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:20,727 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 675 transitions. [2024-11-08 11:09:20,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:20,727 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2024-11-08 11:09:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 11:09:20,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:20,730 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:20,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:09:20,731 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:20,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:20,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1963860308, now seen corresponding path program 1 times [2024-11-08 11:09:20,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:20,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207396504] [2024-11-08 11:09:20,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:20,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:21,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:21,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207396504] [2024-11-08 11:09:21,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207396504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:21,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:21,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 11:09:21,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170744697] [2024-11-08 11:09:21,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:21,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 11:09:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:21,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 11:09:21,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:09:21,276 INFO L87 Difference]: Start difference. First operand 560 states and 675 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:21,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:21,815 INFO L93 Difference]: Finished difference Result 1034 states and 1254 transitions. [2024-11-08 11:09:21,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 11:09:21,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2024-11-08 11:09:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:21,820 INFO L225 Difference]: With dead ends: 1034 [2024-11-08 11:09:21,821 INFO L226 Difference]: Without dead ends: 560 [2024-11-08 11:09:21,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:09:21,823 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:21,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 22 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:09:21,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-08 11:09:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-08 11:09:21,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.2021466905187836) internal successors, (672), 559 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 672 transitions. [2024-11-08 11:09:21,842 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 672 transitions. Word has length 139 [2024-11-08 11:09:21,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:21,843 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 672 transitions. [2024-11-08 11:09:21,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:21,844 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 672 transitions. [2024-11-08 11:09:21,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 11:09:21,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:21,849 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:21,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:09:21,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:21,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:21,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1763631748, now seen corresponding path program 1 times [2024-11-08 11:09:21,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:21,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539642544] [2024-11-08 11:09:21,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:21,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:21,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:21,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539642544] [2024-11-08 11:09:21,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539642544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:21,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:21,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:09:21,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837732879] [2024-11-08 11:09:21,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:21,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:21,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:21,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:21,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:21,985 INFO L87 Difference]: Start difference. First operand 560 states and 672 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:22,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:22,472 INFO L93 Difference]: Finished difference Result 1257 states and 1566 transitions. [2024-11-08 11:09:22,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:22,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2024-11-08 11:09:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:22,476 INFO L225 Difference]: With dead ends: 1257 [2024-11-08 11:09:22,477 INFO L226 Difference]: Without dead ends: 838 [2024-11-08 11:09:22,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:22,482 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:22,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 34 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:09:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-08 11:09:22,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-08 11:09:22,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.1995221027479093) internal successors, (1004), 837 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1004 transitions. [2024-11-08 11:09:22,520 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1004 transitions. Word has length 155 [2024-11-08 11:09:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:22,521 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1004 transitions. [2024-11-08 11:09:22,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1004 transitions. [2024-11-08 11:09:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 11:09:22,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:22,523 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:22,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:09:22,524 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:22,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:22,525 INFO L85 PathProgramCache]: Analyzing trace with hash -461516974, now seen corresponding path program 1 times [2024-11-08 11:09:22,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:22,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903356663] [2024-11-08 11:09:22,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:22,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 11:09:22,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:22,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903356663] [2024-11-08 11:09:22,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903356663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:09:22,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639129811] [2024-11-08 11:09:22,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:22,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:09:22,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:09:22,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:09:22,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:09:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:22,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:09:22,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:09:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-08 11:09:23,211 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:09:23,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639129811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:23,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:09:23,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-08 11:09:23,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818603110] [2024-11-08 11:09:23,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:23,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:23,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:23,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:23,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:09:23,214 INFO L87 Difference]: Start difference. First operand 838 states and 1004 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:23,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:23,717 INFO L93 Difference]: Finished difference Result 1257 states and 1491 transitions. [2024-11-08 11:09:23,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:23,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 175 [2024-11-08 11:09:23,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:23,725 INFO L225 Difference]: With dead ends: 1257 [2024-11-08 11:09:23,726 INFO L226 Difference]: Without dead ends: 1255 [2024-11-08 11:09:23,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 174 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-11-08 11:09:23,727 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:23,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 11 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:09:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-08 11:09:23,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 977. [2024-11-08 11:09:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.2202868852459017) internal successors, (1191), 976 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1191 transitions. [2024-11-08 11:09:23,745 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1191 transitions. Word has length 175 [2024-11-08 11:09:23,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:23,745 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1191 transitions. [2024-11-08 11:09:23,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1191 transitions. [2024-11-08 11:09:23,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-08 11:09:23,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:23,749 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:23,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 11:09:23,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 11:09:23,954 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:23,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:23,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1888354560, now seen corresponding path program 1 times [2024-11-08 11:09:23,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:23,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371643449] [2024-11-08 11:09:23,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:23,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:24,202 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:24,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:24,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371643449] [2024-11-08 11:09:24,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371643449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:24,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:24,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:24,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370455884] [2024-11-08 11:09:24,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:24,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:24,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:24,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:24,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:24,204 INFO L87 Difference]: Start difference. First operand 977 states and 1191 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:24,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:24,715 INFO L93 Difference]: Finished difference Result 2091 states and 2614 transitions. [2024-11-08 11:09:24,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:24,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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 253 [2024-11-08 11:09:24,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:24,720 INFO L225 Difference]: With dead ends: 2091 [2024-11-08 11:09:24,720 INFO L226 Difference]: Without dead ends: 1255 [2024-11-08 11:09:24,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:24,722 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 76 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:24,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 189 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:09:24,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-08 11:09:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-08 11:09:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1650717703349283) internal successors, (1461), 1254 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:24,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1461 transitions. [2024-11-08 11:09:24,746 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1461 transitions. Word has length 253 [2024-11-08 11:09:24,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:24,747 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1461 transitions. [2024-11-08 11:09:24,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1461 transitions. [2024-11-08 11:09:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-08 11:09:24,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:24,752 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:24,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:09:24,755 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:24,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:24,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1346063185, now seen corresponding path program 1 times [2024-11-08 11:09:24,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:24,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933825765] [2024-11-08 11:09:24,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:24,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 77 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:25,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:25,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933825765] [2024-11-08 11:09:25,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933825765] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:09:25,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104715504] [2024-11-08 11:09:25,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:25,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:09:25,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:09:25,310 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:09:25,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 11:09:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:25,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:09:25,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:09:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-08 11:09:25,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:09:25,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104715504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:25,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:09:25,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-08 11:09:25,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099667191] [2024-11-08 11:09:25,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:25,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:25,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:25,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:25,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:09:25,554 INFO L87 Difference]: Start difference. First operand 1255 states and 1461 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:26,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:26,049 INFO L93 Difference]: Finished difference Result 1674 states and 1948 transitions. [2024-11-08 11:09:26,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:26,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 312 [2024-11-08 11:09:26,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:26,055 INFO L225 Difference]: With dead ends: 1674 [2024-11-08 11:09:26,055 INFO L226 Difference]: Without dead ends: 1672 [2024-11-08 11:09:26,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:09:26,057 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 120 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:26,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 11 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:09:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2024-11-08 11:09:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1255. [2024-11-08 11:09:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1650717703349283) internal successors, (1461), 1254 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1461 transitions. [2024-11-08 11:09:26,080 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1461 transitions. Word has length 312 [2024-11-08 11:09:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:26,081 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1461 transitions. [2024-11-08 11:09:26,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1461 transitions. [2024-11-08 11:09:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-08 11:09:26,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:26,085 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:26,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 11:09:26,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-08 11:09:26,291 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:26,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash -63999649, now seen corresponding path program 1 times [2024-11-08 11:09:26,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:26,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93391886] [2024-11-08 11:09:26,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:26,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-08 11:09:26,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:26,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93391886] [2024-11-08 11:09:26,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93391886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:26,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:26,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:26,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373535568] [2024-11-08 11:09:26,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:26,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:26,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:26,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:26,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:26,550 INFO L87 Difference]: Start difference. First operand 1255 states and 1461 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:27,012 INFO L93 Difference]: Finished difference Result 2647 states and 3154 transitions. [2024-11-08 11:09:27,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:27,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 326 [2024-11-08 11:09:27,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:27,019 INFO L225 Difference]: With dead ends: 2647 [2024-11-08 11:09:27,019 INFO L226 Difference]: Without dead ends: 1533 [2024-11-08 11:09:27,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:27,024 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 63 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:27,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 215 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:09:27,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2024-11-08 11:09:27,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1394. [2024-11-08 11:09:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.1593682699210337) internal successors, (1615), 1393 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1615 transitions. [2024-11-08 11:09:27,071 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1615 transitions. Word has length 326 [2024-11-08 11:09:27,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:27,072 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1615 transitions. [2024-11-08 11:09:27,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:27,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1615 transitions. [2024-11-08 11:09:27,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-08 11:09:27,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:27,077 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:27,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:09:27,077 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:27,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:27,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1075041914, now seen corresponding path program 1 times [2024-11-08 11:09:27,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:27,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711471616] [2024-11-08 11:09:27,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:27,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2024-11-08 11:09:27,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:27,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711471616] [2024-11-08 11:09:27,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711471616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:27,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:27,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:27,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043713046] [2024-11-08 11:09:27,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:27,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:27,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:27,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:27,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:27,371 INFO L87 Difference]: Start difference. First operand 1394 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:27,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:27,881 INFO L93 Difference]: Finished difference Result 3759 states and 4365 transitions. [2024-11-08 11:09:27,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:27,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 336 [2024-11-08 11:09:27,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:27,890 INFO L225 Difference]: With dead ends: 3759 [2024-11-08 11:09:27,890 INFO L226 Difference]: Without dead ends: 2506 [2024-11-08 11:09:27,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:27,893 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 80 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:27,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 51 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:09:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2024-11-08 11:09:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1811. [2024-11-08 11:09:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.1414364640883978) internal successors, (2066), 1810 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2066 transitions. [2024-11-08 11:09:27,930 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2066 transitions. Word has length 336 [2024-11-08 11:09:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:27,930 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2066 transitions. [2024-11-08 11:09:27,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:27,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2066 transitions. [2024-11-08 11:09:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-11-08 11:09:27,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:27,937 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:27,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:09:27,938 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:27,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:27,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1108958479, now seen corresponding path program 1 times [2024-11-08 11:09:27,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:27,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176604248] [2024-11-08 11:09:27,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:27,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-11-08 11:09:28,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:28,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176604248] [2024-11-08 11:09:28,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176604248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:28,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:28,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:28,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116403307] [2024-11-08 11:09:28,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:28,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:09:28,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:28,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:09:28,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:09:28,571 INFO L87 Difference]: Start difference. First operand 1811 states and 2066 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:28,961 INFO L93 Difference]: Finished difference Result 3354 states and 3845 transitions. [2024-11-08 11:09:28,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:09:28,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 370 [2024-11-08 11:09:28,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:28,963 INFO L225 Difference]: With dead ends: 3354 [2024-11-08 11:09:28,963 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:09:28,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:09:28,967 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 93 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:28,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 12 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:09:28,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:09:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:09:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:09:28,968 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 370 [2024-11-08 11:09:28,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:28,968 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:09:28,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:09:28,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:09:28,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:09:28,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:09:28,975 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:28,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:09:29,210 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:09:29,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:09:29 BoogieIcfgContainer [2024-11-08 11:09:29,232 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:09:29,233 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:09:29,233 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:09:29,233 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:09:29,234 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:17" (3/4) ... [2024-11-08 11:09:29,237 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:09:29,258 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:09:29,258 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:09:29,259 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:09:29,260 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:09:29,393 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:09:29,394 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:09:29,394 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:09:29,395 INFO L158 Benchmark]: Toolchain (without parser) took 14250.21ms. Allocated memory was 180.4MB in the beginning and 408.9MB in the end (delta: 228.6MB). Free memory was 121.1MB in the beginning and 186.0MB in the end (delta: -64.9MB). Peak memory consumption was 166.3MB. Max. memory is 16.1GB. [2024-11-08 11:09:29,395 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 180.4MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:09:29,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 644.44ms. Allocated memory is still 180.4MB. Free memory was 120.8MB in the beginning and 91.2MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 11:09:29,396 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.59ms. Allocated memory is still 180.4MB. Free memory was 90.9MB in the beginning and 82.9MB in the end (delta: 8.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 11:09:29,396 INFO L158 Benchmark]: Boogie Preprocessor took 174.51ms. Allocated memory is still 180.4MB. Free memory was 82.9MB in the beginning and 142.4MB in the end (delta: -59.6MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2024-11-08 11:09:29,396 INFO L158 Benchmark]: RCFGBuilder took 1417.85ms. Allocated memory was 180.4MB in the beginning and 234.9MB in the end (delta: 54.5MB). Free memory was 142.4MB in the beginning and 106.3MB in the end (delta: 36.1MB). Peak memory consumption was 99.6MB. Max. memory is 16.1GB. [2024-11-08 11:09:29,397 INFO L158 Benchmark]: TraceAbstraction took 11758.47ms. Allocated memory was 234.9MB in the beginning and 408.9MB in the end (delta: 174.1MB). Free memory was 106.3MB in the beginning and 197.6MB in the end (delta: -91.3MB). Peak memory consumption was 81.7MB. Max. memory is 16.1GB. [2024-11-08 11:09:29,397 INFO L158 Benchmark]: Witness Printer took 161.27ms. Allocated memory is still 408.9MB. Free memory was 197.6MB in the beginning and 186.0MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 11:09:29,399 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.16ms. Allocated memory is still 180.4MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 644.44ms. Allocated memory is still 180.4MB. Free memory was 120.8MB in the beginning and 91.2MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.59ms. Allocated memory is still 180.4MB. Free memory was 90.9MB in the beginning and 82.9MB in the end (delta: 8.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 174.51ms. Allocated memory is still 180.4MB. Free memory was 82.9MB in the beginning and 142.4MB in the end (delta: -59.6MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1417.85ms. Allocated memory was 180.4MB in the beginning and 234.9MB in the end (delta: 54.5MB). Free memory was 142.4MB in the beginning and 106.3MB in the end (delta: 36.1MB). Peak memory consumption was 99.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11758.47ms. Allocated memory was 234.9MB in the beginning and 408.9MB in the end (delta: 174.1MB). Free memory was 106.3MB in the beginning and 197.6MB in the end (delta: -91.3MB). Peak memory consumption was 81.7MB. Max. memory is 16.1GB. * Witness Printer took 161.27ms. Allocated memory is still 408.9MB. Free memory was 197.6MB in the beginning and 186.0MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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: 206]: 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, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 979 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 979 mSDsluCounter, 957 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 607 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4409 IncrementalHoareTripleChecker+Invalid, 5016 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 607 mSolverCounterUnsat, 900 mSDtfsCounter, 4409 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1811occurred in iteration=10, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1529 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2884 NumberOfCodeBlocks, 2884 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2871 ConstructedInterpolants, 0 QuantifiedInterpolants, 10601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 671 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 2128/2309 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: 592]: Loop Invariant Derived loop invariant: ((((((((((a19 <= 9) && (8 <= a19)) && (14 == a4)) && (a12 == 0)) || ((((a19 <= 9) && (14 == a4)) && (a12 == 0)) && (a1 <= 33))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || (((((a10 == 1) && (221 <= a1)) && (14 == a4)) && (a12 == 0)) && (7 == a19))) || ((((a19 <= 9) && (a10 == 3)) && (14 == a4)) && (a12 == 0))) || (((a10 <= 0) && (14 == a4)) && (a12 == 0))) || ((((a10 == 1) && (14 == a4)) && (a12 == 0)) && (9 <= a19))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:09:29,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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