./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label05.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 6998e746c84ec80cbdf636f88f142c2942fd045c8cffd9bc8881e887e07cd119 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:10:04,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:10:04,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:10:04,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:10:04,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:10:04,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:10:04,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:10:04,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:10:04,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:10:04,677 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:10:04,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:10:04,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:10:04,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:10:04,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:10:04,680 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:10:04,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:10:04,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:10:04,681 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:10:04,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:10:04,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:10:04,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:10:04,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:10:04,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:10:04,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:10:04,682 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:10:04,682 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:10:04,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:10:04,683 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:10:04,683 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:10:04,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:10:04,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:10:04,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:10:04,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:10:04,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:10:04,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:10:04,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:10:04,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:10:04,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:10:04,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:10:04,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:10:04,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:10:04,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:10:04,687 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 -> 6998e746c84ec80cbdf636f88f142c2942fd045c8cffd9bc8881e887e07cd119 [2024-11-08 11:10:04,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:10:04,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:10:04,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:10:04,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:10:04,934 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:10:04,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label05.c [2024-11-08 11:10:06,348 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:10:06,582 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:10:06,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label05.c [2024-11-08 11:10:06,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0dce0c4/f9d9ec68db164311bbf866883e635517/FLAGb8cbf843c [2024-11-08 11:10:06,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0dce0c4/f9d9ec68db164311bbf866883e635517 [2024-11-08 11:10:06,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:10:06,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:10:06,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:10:06,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:10:06,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:10:06,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:10:06" (1/1) ... [2024-11-08 11:10:06,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c86066e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:06, skipping insertion in model container [2024-11-08 11:10:06,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:10:06" (1/1) ... [2024-11-08 11:10:06,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:10:07,168 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label05.c[9225,9238] [2024-11-08 11:10:07,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:10:07,331 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:10:07,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label05.c[9225,9238] [2024-11-08 11:10:07,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:10:07,479 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:10:07,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07 WrapperNode [2024-11-08 11:10:07,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:10:07,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:10:07,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:10:07,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:10:07,486 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:10:07" (1/1) ... [2024-11-08 11:10:07,512 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:10:07" (1/1) ... [2024-11-08 11:10:07,590 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-08 11:10:07,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:10:07,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:10:07,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:10:07,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:10:07,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,659 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:10:07,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,696 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:10:07,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:10:07,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:10:07,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:10:07,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (1/1) ... [2024-11-08 11:10:07,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:10:07,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:10:07,770 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:10:07,772 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:10:07,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:10:07,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:10:07,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:10:07,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:10:07,876 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:10:07,877 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:10:09,066 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-08 11:10:09,066 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:10:09,080 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:10:09,080 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:10:09,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:10:09 BoogieIcfgContainer [2024-11-08 11:10:09,081 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:10:09,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:10:09,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:10:09,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:10:09,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:10:06" (1/3) ... [2024-11-08 11:10:09,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59af3154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:10:09, skipping insertion in model container [2024-11-08 11:10:09,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:07" (2/3) ... [2024-11-08 11:10:09,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59af3154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:10:09, skipping insertion in model container [2024-11-08 11:10:09,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:10:09" (3/3) ... [2024-11-08 11:10:09,087 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label05.c [2024-11-08 11:10:09,099 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:10:09,100 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:10:09,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:10:09,151 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;@2424da3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:10:09,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:10:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 11:10:09,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:09,163 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:10:09,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:09,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:09,167 INFO L85 PathProgramCache]: Analyzing trace with hash -107486446, now seen corresponding path program 1 times [2024-11-08 11:10:09,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:09,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656110677] [2024-11-08 11:10:09,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:09,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:09,459 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:10:09,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:09,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656110677] [2024-11-08 11:10:09,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656110677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:09,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:09,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:09,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947809700] [2024-11-08 11:10:09,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:09,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:09,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:09,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:09,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:09,493 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 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:10:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:10,388 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2024-11-08 11:10:10,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:10,394 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:10:10,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:10,408 INFO L225 Difference]: With dead ends: 761 [2024-11-08 11:10:10,409 INFO L226 Difference]: Without dead ends: 413 [2024-11-08 11:10:10,412 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:10:10,414 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 164 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:10,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:10:10,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-08 11:10:10,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2024-11-08 11:10:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2024-11-08 11:10:10,461 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 64 [2024-11-08 11:10:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:10,462 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2024-11-08 11:10:10,462 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:10:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2024-11-08 11:10:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 11:10:10,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:10,466 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] [2024-11-08 11:10:10,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:10:10,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:10,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash -355691958, now seen corresponding path program 1 times [2024-11-08 11:10:10,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:10,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005773507] [2024-11-08 11:10:10,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:10,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:10,651 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:10:10,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:10,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005773507] [2024-11-08 11:10:10,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005773507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:10,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:10,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:10,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757477896] [2024-11-08 11:10:10,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:10,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:10,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:10,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:10,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:10,654 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:10:11,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:11,328 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2024-11-08 11:10:11,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:11,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2024-11-08 11:10:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:11,332 INFO L225 Difference]: With dead ends: 1211 [2024-11-08 11:10:11,332 INFO L226 Difference]: Without dead ends: 800 [2024-11-08 11:10:11,335 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:10:11,336 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:11,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 118 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:10:11,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-08 11:10:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2024-11-08 11:10:11,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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:10:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2024-11-08 11:10:11,375 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 132 [2024-11-08 11:10:11,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:11,376 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2024-11-08 11:10:11,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:10:11,376 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2024-11-08 11:10:11,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 11:10:11,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:11,380 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] [2024-11-08 11:10:11,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:10:11,381 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:11,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:11,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1592760116, now seen corresponding path program 1 times [2024-11-08 11:10:11,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:11,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649363212] [2024-11-08 11:10:11,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:11,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:11,723 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:10:11,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:11,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649363212] [2024-11-08 11:10:11,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649363212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:11,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:11,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:11,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315481140] [2024-11-08 11:10:11,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:11,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:11,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:11,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:11,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:11,726 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:12,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:12,283 INFO L93 Difference]: Finished difference Result 1945 states and 2614 transitions. [2024-11-08 11:10:12,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:12,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-11-08 11:10:12,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:12,287 INFO L225 Difference]: With dead ends: 1945 [2024-11-08 11:10:12,287 INFO L226 Difference]: Without dead ends: 1158 [2024-11-08 11:10:12,288 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:10:12,289 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:12,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:10:12,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-08 11:10:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2024-11-08 11:10:12,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2716262975778547) internal successors, (1470), 1156 states have internal predecessors, (1470), 0 states have call successors, (0), 0 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:10:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1470 transitions. [2024-11-08 11:10:12,304 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1470 transitions. Word has length 133 [2024-11-08 11:10:12,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:12,305 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1470 transitions. [2024-11-08 11:10:12,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1470 transitions. [2024-11-08 11:10:12,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 11:10:12,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:12,310 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:12,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:10:12,310 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:12,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:12,311 INFO L85 PathProgramCache]: Analyzing trace with hash 491130087, now seen corresponding path program 1 times [2024-11-08 11:10:12,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:12,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406341039] [2024-11-08 11:10:12,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:12,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:12,596 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:10:12,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:12,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406341039] [2024-11-08 11:10:12,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406341039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:12,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:12,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:12,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219185414] [2024-11-08 11:10:12,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:12,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:12,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:12,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:12,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:12,598 INFO L87 Difference]: Start difference. First operand 1157 states and 1470 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 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:10:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:13,204 INFO L93 Difference]: Finished difference Result 2519 states and 3352 transitions. [2024-11-08 11:10:13,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:13,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 191 [2024-11-08 11:10:13,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:13,209 INFO L225 Difference]: With dead ends: 2519 [2024-11-08 11:10:13,209 INFO L226 Difference]: Without dead ends: 1548 [2024-11-08 11:10:13,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:13,211 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 171 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:13,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:10:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2024-11-08 11:10:13,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1545. [2024-11-08 11:10:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.294041450777202) internal successors, (1998), 1544 states have internal predecessors, (1998), 0 states have call successors, (0), 0 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:10:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1998 transitions. [2024-11-08 11:10:13,230 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1998 transitions. Word has length 191 [2024-11-08 11:10:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:13,231 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1998 transitions. [2024-11-08 11:10:13,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 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:10:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1998 transitions. [2024-11-08 11:10:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 11:10:13,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:13,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:13,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:10:13,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:13,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:13,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1941392826, now seen corresponding path program 1 times [2024-11-08 11:10:13,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:13,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111195046] [2024-11-08 11:10:13,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:13,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:13,439 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:13,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:13,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111195046] [2024-11-08 11:10:13,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111195046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:13,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:13,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:13,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238077661] [2024-11-08 11:10:13,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:13,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:13,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:13,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:13,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:13,443 INFO L87 Difference]: Start difference. First operand 1545 states and 1998 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 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:10:14,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:14,609 INFO L93 Difference]: Finished difference Result 3656 states and 4826 transitions. [2024-11-08 11:10:14,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:14,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2024-11-08 11:10:14,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:14,615 INFO L225 Difference]: With dead ends: 3656 [2024-11-08 11:10:14,616 INFO L226 Difference]: Without dead ends: 2297 [2024-11-08 11:10:14,618 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:10:14,618 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:14,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 340 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:10:14,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2024-11-08 11:10:14,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2100. [2024-11-08 11:10:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.2706050500238208) internal successors, (2667), 2099 states have internal predecessors, (2667), 0 states have call successors, (0), 0 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:10:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2667 transitions. [2024-11-08 11:10:14,646 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2667 transitions. Word has length 244 [2024-11-08 11:10:14,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:14,647 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2667 transitions. [2024-11-08 11:10:14,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 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:10:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2667 transitions. [2024-11-08 11:10:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-08 11:10:14,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:14,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:14,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:10:14,650 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:14,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:14,651 INFO L85 PathProgramCache]: Analyzing trace with hash 790120528, now seen corresponding path program 1 times [2024-11-08 11:10:14,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:14,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292522655] [2024-11-08 11:10:14,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:14,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-08 11:10:14,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:14,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292522655] [2024-11-08 11:10:14,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292522655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:14,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:14,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:14,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608334897] [2024-11-08 11:10:14,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:14,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:14,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:14,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:14,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:14,854 INFO L87 Difference]: Start difference. First operand 2100 states and 2667 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:10:15,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:15,419 INFO L93 Difference]: Finished difference Result 4765 states and 6075 transitions. [2024-11-08 11:10:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:15,420 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 245 [2024-11-08 11:10:15,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:15,426 INFO L225 Difference]: With dead ends: 4765 [2024-11-08 11:10:15,426 INFO L226 Difference]: Without dead ends: 2667 [2024-11-08 11:10:15,428 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:10:15,429 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 138 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:15,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 345 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:10:15,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2024-11-08 11:10:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2652. [2024-11-08 11:10:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 2651 states have (on average 1.2572614107883817) internal successors, (3333), 2651 states have internal predecessors, (3333), 0 states have call successors, (0), 0 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:10:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 3333 transitions. [2024-11-08 11:10:15,461 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 3333 transitions. Word has length 245 [2024-11-08 11:10:15,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:15,464 INFO L471 AbstractCegarLoop]: Abstraction has 2652 states and 3333 transitions. [2024-11-08 11:10:15,464 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:10:15,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 3333 transitions. [2024-11-08 11:10:15,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 11:10:15,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:15,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:15,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:10:15,467 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:15,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:15,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1579189985, now seen corresponding path program 1 times [2024-11-08 11:10:15,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:15,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942241346] [2024-11-08 11:10:15,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:15,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:15,661 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 11:10:15,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:15,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942241346] [2024-11-08 11:10:15,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942241346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:15,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:15,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:15,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352456290] [2024-11-08 11:10:15,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:15,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:15,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:15,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:15,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:15,664 INFO L87 Difference]: Start difference. First operand 2652 states and 3333 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:10:16,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:16,290 INFO L93 Difference]: Finished difference Result 6047 states and 7676 transitions. [2024-11-08 11:10:16,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:16,291 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 246 [2024-11-08 11:10:16,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:16,299 INFO L225 Difference]: With dead ends: 6047 [2024-11-08 11:10:16,299 INFO L226 Difference]: Without dead ends: 3397 [2024-11-08 11:10:16,302 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:10:16,304 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 133 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:16,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 379 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:10:16,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3397 states. [2024-11-08 11:10:16,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3397 to 3204. [2024-11-08 11:10:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3204 states, 3203 states have (on average 1.2466437714642522) internal successors, (3993), 3203 states have internal predecessors, (3993), 0 states have call successors, (0), 0 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:10:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 3993 transitions. [2024-11-08 11:10:16,348 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 3993 transitions. Word has length 246 [2024-11-08 11:10:16,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:16,348 INFO L471 AbstractCegarLoop]: Abstraction has 3204 states and 3993 transitions. [2024-11-08 11:10:16,349 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:10:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 3993 transitions. [2024-11-08 11:10:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-08 11:10:16,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:16,351 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, 1, 1, 1, 1, 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:10:16,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:10:16,352 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:16,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:16,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1141889263, now seen corresponding path program 1 times [2024-11-08 11:10:16,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:16,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421758895] [2024-11-08 11:10:16,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:16,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:16,656 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:16,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:16,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421758895] [2024-11-08 11:10:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421758895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:16,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:16,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:10:16,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143025053] [2024-11-08 11:10:16,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:16,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:10:16,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:16,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:10:16,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:10:16,660 INFO L87 Difference]: Start difference. First operand 3204 states and 3993 transitions. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 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:10:17,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:17,727 INFO L93 Difference]: Finished difference Result 11048 states and 13849 transitions. [2024-11-08 11:10:17,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:10:17,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 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 266 [2024-11-08 11:10:17,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:17,746 INFO L225 Difference]: With dead ends: 11048 [2024-11-08 11:10:17,747 INFO L226 Difference]: Without dead ends: 7846 [2024-11-08 11:10:17,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:10:17,753 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 270 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:17,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 206 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:10:17,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7846 states. [2024-11-08 11:10:17,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7846 to 7473. [2024-11-08 11:10:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7473 states, 7472 states have (on average 1.2011509635974305) internal successors, (8975), 7472 states have internal predecessors, (8975), 0 states have call successors, (0), 0 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:10:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7473 states to 7473 states and 8975 transitions. [2024-11-08 11:10:17,861 INFO L78 Accepts]: Start accepts. Automaton has 7473 states and 8975 transitions. Word has length 266 [2024-11-08 11:10:17,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:17,861 INFO L471 AbstractCegarLoop]: Abstraction has 7473 states and 8975 transitions. [2024-11-08 11:10:17,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 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:10:17,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7473 states and 8975 transitions. [2024-11-08 11:10:17,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-08 11:10:17,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:17,865 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:17,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:10:17,866 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:17,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:17,866 INFO L85 PathProgramCache]: Analyzing trace with hash -33415155, now seen corresponding path program 1 times [2024-11-08 11:10:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:17,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298207486] [2024-11-08 11:10:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:17,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-08 11:10:17,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:17,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298207486] [2024-11-08 11:10:17,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298207486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:17,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:17,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:17,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494029363] [2024-11-08 11:10:17,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:17,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:17,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:17,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:17,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:17,963 INFO L87 Difference]: Start difference. First operand 7473 states and 8975 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 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:10:18,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:18,475 INFO L93 Difference]: Finished difference Result 14540 states and 17486 transitions. [2024-11-08 11:10:18,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:18,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 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 267 [2024-11-08 11:10:18,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:18,508 INFO L225 Difference]: With dead ends: 14540 [2024-11-08 11:10:18,508 INFO L226 Difference]: Without dead ends: 7069 [2024-11-08 11:10:18,516 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:10:18,516 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 114 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:18,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 152 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:10:18,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7069 states. [2024-11-08 11:10:18,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7069 to 7068. [2024-11-08 11:10:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7068 states, 7067 states have (on average 1.144757322767794) internal successors, (8090), 7067 states have internal predecessors, (8090), 0 states have call successors, (0), 0 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:10:18,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7068 states to 7068 states and 8090 transitions. [2024-11-08 11:10:18,645 INFO L78 Accepts]: Start accepts. Automaton has 7068 states and 8090 transitions. Word has length 267 [2024-11-08 11:10:18,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:18,646 INFO L471 AbstractCegarLoop]: Abstraction has 7068 states and 8090 transitions. [2024-11-08 11:10:18,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 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:10:18,646 INFO L276 IsEmpty]: Start isEmpty. Operand 7068 states and 8090 transitions. [2024-11-08 11:10:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-11-08 11:10:18,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:18,651 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:18,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:10:18,652 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:18,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:18,652 INFO L85 PathProgramCache]: Analyzing trace with hash 726597686, now seen corresponding path program 1 times [2024-11-08 11:10:18,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:18,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344484529] [2024-11-08 11:10:18,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:18,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:18,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:18,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344484529] [2024-11-08 11:10:18,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344484529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:18,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:18,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:10:18,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632326688] [2024-11-08 11:10:18,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:18,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:10:18,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:18,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:10:18,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:10:18,997 INFO L87 Difference]: Start difference. First operand 7068 states and 8090 transitions. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 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:10:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:20,044 INFO L93 Difference]: Finished difference Result 18561 states and 21349 transitions. [2024-11-08 11:10:20,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:10:20,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 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 276 [2024-11-08 11:10:20,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:20,064 INFO L225 Difference]: With dead ends: 18561 [2024-11-08 11:10:20,064 INFO L226 Difference]: Without dead ends: 11495 [2024-11-08 11:10:20,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:10:20,071 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 294 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:20,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 106 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:10:20,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11495 states. [2024-11-08 11:10:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11495 to 10199. [2024-11-08 11:10:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10199 states, 10198 states have (on average 1.1447342616199254) internal successors, (11674), 10198 states have internal predecessors, (11674), 0 states have call successors, (0), 0 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:10:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10199 states to 10199 states and 11674 transitions. [2024-11-08 11:10:20,180 INFO L78 Accepts]: Start accepts. Automaton has 10199 states and 11674 transitions. Word has length 276 [2024-11-08 11:10:20,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:20,181 INFO L471 AbstractCegarLoop]: Abstraction has 10199 states and 11674 transitions. [2024-11-08 11:10:20,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 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:10:20,182 INFO L276 IsEmpty]: Start isEmpty. Operand 10199 states and 11674 transitions. [2024-11-08 11:10:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-08 11:10:20,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:20,187 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:20,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:10:20,187 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:20,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:20,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1197973930, now seen corresponding path program 1 times [2024-11-08 11:10:20,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:20,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789599522] [2024-11-08 11:10:20,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:20,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 185 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:20,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:20,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789599522] [2024-11-08 11:10:20,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789599522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:10:20,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792496241] [2024-11-08 11:10:20,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:20,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:10:20,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:10:20,882 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:10:20,885 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:10:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:20,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 11:10:20,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:10:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 74 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:22,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:10:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 74 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:23,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792496241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 11:10:23,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 11:10:23,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-08 11:10:23,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146022196] [2024-11-08 11:10:23,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 11:10:23,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 11:10:23,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:23,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 11:10:23,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 11:10:23,113 INFO L87 Difference]: Start difference. First operand 10199 states and 11674 transitions. Second operand has 11 states, 11 states have (on average 45.81818181818182) internal successors, (504), 10 states have internal predecessors, (504), 0 states have call successors, (0), 0 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:10:26,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:26,124 INFO L93 Difference]: Finished difference Result 23200 states and 26569 transitions. [2024-11-08 11:10:26,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 11:10:26,124 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 45.81818181818182) internal successors, (504), 10 states have internal predecessors, (504), 0 states have call successors, (0), 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 278 [2024-11-08 11:10:26,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:26,138 INFO L225 Difference]: With dead ends: 23200 [2024-11-08 11:10:26,138 INFO L226 Difference]: Without dead ends: 12991 [2024-11-08 11:10:26,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2024-11-08 11:10:26,143 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1728 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4310 mSolverCounterSat, 838 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1728 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 5148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 838 IncrementalHoareTripleChecker+Valid, 4310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:26,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1728 Valid, 148 Invalid, 5148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [838 Valid, 4310 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 11:10:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12991 states. [2024-11-08 11:10:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12991 to 11277. [2024-11-08 11:10:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11277 states, 11276 states have (on average 1.1097020219936147) internal successors, (12513), 11276 states have internal predecessors, (12513), 0 states have call successors, (0), 0 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:10:26,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11277 states to 11277 states and 12513 transitions. [2024-11-08 11:10:26,231 INFO L78 Accepts]: Start accepts. Automaton has 11277 states and 12513 transitions. Word has length 278 [2024-11-08 11:10:26,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:26,231 INFO L471 AbstractCegarLoop]: Abstraction has 11277 states and 12513 transitions. [2024-11-08 11:10:26,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 45.81818181818182) internal successors, (504), 10 states have internal predecessors, (504), 0 states have call successors, (0), 0 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:10:26,231 INFO L276 IsEmpty]: Start isEmpty. Operand 11277 states and 12513 transitions. [2024-11-08 11:10:26,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-11-08 11:10:26,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:26,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:26,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 11:10:26,440 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,SelfDestructingSolverStorable10 [2024-11-08 11:10:26,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:26,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:26,441 INFO L85 PathProgramCache]: Analyzing trace with hash -927901590, now seen corresponding path program 1 times [2024-11-08 11:10:26,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:26,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420748124] [2024-11-08 11:10:26,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:26,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 179 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:27,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:27,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420748124] [2024-11-08 11:10:27,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420748124] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:10:27,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137504439] [2024-11-08 11:10:27,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:27,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:10:27,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:10:27,010 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:10:27,014 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:10:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:27,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:10:27,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:10:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:27,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:10:27,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137504439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:27,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:10:27,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:10:27,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166338758] [2024-11-08 11:10:27,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:27,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:10:27,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:27,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:10:27,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:10:27,426 INFO L87 Difference]: Start difference. First operand 11277 states and 12513 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:28,188 INFO L93 Difference]: Finished difference Result 23108 states and 25622 transitions. [2024-11-08 11:10:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:10:28,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 297 [2024-11-08 11:10:28,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:28,206 INFO L225 Difference]: With dead ends: 23108 [2024-11-08 11:10:28,206 INFO L226 Difference]: Without dead ends: 11833 [2024-11-08 11:10:28,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:10:28,215 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 183 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:28,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 150 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:10:28,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11833 states. [2024-11-08 11:10:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11833 to 11645. [2024-11-08 11:10:28,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11645 states, 11644 states have (on average 1.1072655444864308) internal successors, (12893), 11644 states have internal predecessors, (12893), 0 states have call successors, (0), 0 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:10:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11645 states to 11645 states and 12893 transitions. [2024-11-08 11:10:28,360 INFO L78 Accepts]: Start accepts. Automaton has 11645 states and 12893 transitions. Word has length 297 [2024-11-08 11:10:28,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:28,361 INFO L471 AbstractCegarLoop]: Abstraction has 11645 states and 12893 transitions. [2024-11-08 11:10:28,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:28,361 INFO L276 IsEmpty]: Start isEmpty. Operand 11645 states and 12893 transitions. [2024-11-08 11:10:28,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-08 11:10:28,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:28,368 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, 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] [2024-11-08 11:10:28,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 11:10:28,572 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,SelfDestructingSolverStorable11 [2024-11-08 11:10:28,573 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:28,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:28,574 INFO L85 PathProgramCache]: Analyzing trace with hash 955474353, now seen corresponding path program 1 times [2024-11-08 11:10:28,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:28,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834621632] [2024-11-08 11:10:28,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:28,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 342 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:29,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:29,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834621632] [2024-11-08 11:10:29,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834621632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:10:29,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194923571] [2024-11-08 11:10:29,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:29,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:10:29,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:10:29,057 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:10:29,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 11:10:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:29,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 11:10:29,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:10:29,355 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-08 11:10:29,355 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:10:29,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194923571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:29,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:10:29,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-08 11:10:29,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626737767] [2024-11-08 11:10:29,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:29,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:29,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:29,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:29,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:10:29,357 INFO L87 Difference]: Start difference. First operand 11645 states and 12893 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 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:10:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:29,880 INFO L93 Difference]: Finished difference Result 24028 states and 26574 transitions. [2024-11-08 11:10:29,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:29,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 335 [2024-11-08 11:10:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:29,893 INFO L225 Difference]: With dead ends: 24028 [2024-11-08 11:10:29,893 INFO L226 Difference]: Without dead ends: 12201 [2024-11-08 11:10:29,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:10:29,903 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 98 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:29,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 348 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:10:29,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12201 states. [2024-11-08 11:10:29,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12201 to 11829. [2024-11-08 11:10:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11829 states, 11828 states have (on average 1.1045823469732838) internal successors, (13065), 11828 states have internal predecessors, (13065), 0 states have call successors, (0), 0 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:10:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11829 states to 11829 states and 13065 transitions. [2024-11-08 11:10:30,008 INFO L78 Accepts]: Start accepts. Automaton has 11829 states and 13065 transitions. Word has length 335 [2024-11-08 11:10:30,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:30,008 INFO L471 AbstractCegarLoop]: Abstraction has 11829 states and 13065 transitions. [2024-11-08 11:10:30,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 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:10:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 11829 states and 13065 transitions. [2024-11-08 11:10:30,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-08 11:10:30,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:30,014 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, 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] [2024-11-08 11:10:30,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 11:10:30,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:10:30,218 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:30,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:30,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2007425143, now seen corresponding path program 1 times [2024-11-08 11:10:30,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:30,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419915142] [2024-11-08 11:10:30,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:30,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 174 proven. 185 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-08 11:10:30,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:30,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419915142] [2024-11-08 11:10:30,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419915142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:10:30,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571739842] [2024-11-08 11:10:30,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:30,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:10:30,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:10:30,975 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:10:30,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 11:10:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:31,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:10:31,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:10:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-08 11:10:31,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:10:31,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571739842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:31,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:10:31,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-08 11:10:31,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189873577] [2024-11-08 11:10:31,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:31,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:10:31,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:31,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:10:31,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:10:31,453 INFO L87 Difference]: Start difference. First operand 11829 states and 13065 transitions. Second operand has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 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:10:32,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:32,217 INFO L93 Difference]: Finished difference Result 24027 states and 26511 transitions. [2024-11-08 11:10:32,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:10:32,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 351 [2024-11-08 11:10:32,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:32,229 INFO L225 Difference]: With dead ends: 24027 [2024-11-08 11:10:32,229 INFO L226 Difference]: Without dead ends: 12200 [2024-11-08 11:10:32,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:10:32,238 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 290 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:32,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 145 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:10:32,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12200 states. [2024-11-08 11:10:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12200 to 11277. [2024-11-08 11:10:32,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11277 states, 11276 states have (on average 1.1049130897481376) internal successors, (12459), 11276 states have internal predecessors, (12459), 0 states have call successors, (0), 0 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:10:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11277 states to 11277 states and 12459 transitions. [2024-11-08 11:10:32,331 INFO L78 Accepts]: Start accepts. Automaton has 11277 states and 12459 transitions. Word has length 351 [2024-11-08 11:10:32,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:32,331 INFO L471 AbstractCegarLoop]: Abstraction has 11277 states and 12459 transitions. [2024-11-08 11:10:32,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 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:10:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 11277 states and 12459 transitions. [2024-11-08 11:10:32,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-11-08 11:10:32,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:32,336 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, 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] [2024-11-08 11:10:32,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 11:10:32,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:10:32,541 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:32,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:32,541 INFO L85 PathProgramCache]: Analyzing trace with hash -199405277, now seen corresponding path program 1 times [2024-11-08 11:10:32,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:32,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749625283] [2024-11-08 11:10:32,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:32,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 123 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:33,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:33,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749625283] [2024-11-08 11:10:33,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749625283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:10:33,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567757240] [2024-11-08 11:10:33,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:33,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:10:33,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:10:33,035 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:10:33,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 11:10:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:33,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 11:10:33,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:10:33,480 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 123 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:33,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:10:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 123 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:34,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567757240] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 11:10:34,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 11:10:34,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2024-11-08 11:10:34,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497565504] [2024-11-08 11:10:34,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 11:10:34,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 11:10:34,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:34,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 11:10:34,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-11-08 11:10:34,613 INFO L87 Difference]: Start difference. First operand 11277 states and 12459 transitions. Second operand has 10 states, 10 states have (on average 78.8) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:36,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:36,950 INFO L93 Difference]: Finished difference Result 37293 states and 41051 transitions. [2024-11-08 11:10:36,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 11:10:36,951 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 78.8) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 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 362 [2024-11-08 11:10:36,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:36,978 INFO L225 Difference]: With dead ends: 37293 [2024-11-08 11:10:36,978 INFO L226 Difference]: Without dead ends: 26018 [2024-11-08 11:10:36,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 726 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-11-08 11:10:36,989 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 950 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2954 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 2954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:36,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 114 Invalid, 3383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 2954 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 11:10:37,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26018 states. [2024-11-08 11:10:37,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26018 to 23435. [2024-11-08 11:10:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23435 states, 23434 states have (on average 1.0960570111803363) internal successors, (25685), 23434 states have internal predecessors, (25685), 0 states have call successors, (0), 0 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:10:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23435 states to 23435 states and 25685 transitions. [2024-11-08 11:10:37,253 INFO L78 Accepts]: Start accepts. Automaton has 23435 states and 25685 transitions. Word has length 362 [2024-11-08 11:10:37,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:37,254 INFO L471 AbstractCegarLoop]: Abstraction has 23435 states and 25685 transitions. [2024-11-08 11:10:37,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 78.8) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:10:37,254 INFO L276 IsEmpty]: Start isEmpty. Operand 23435 states and 25685 transitions. [2024-11-08 11:10:37,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-11-08 11:10:37,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:37,261 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:37,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 11:10:37,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 11:10:37,465 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:37,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:37,466 INFO L85 PathProgramCache]: Analyzing trace with hash -664639836, now seen corresponding path program 1 times [2024-11-08 11:10:37,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:37,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906349249] [2024-11-08 11:10:37,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:37,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 370 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:38,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:38,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906349249] [2024-11-08 11:10:38,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906349249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:10:38,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880700269] [2024-11-08 11:10:38,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:38,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:10:38,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:10:38,304 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:10:38,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 11:10:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:38,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 11:10:38,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:10:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 185 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-08 11:10:39,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:10:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-08 11:10:40,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880700269] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 11:10:40,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 11:10:40,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 8 [2024-11-08 11:10:40,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061290988] [2024-11-08 11:10:40,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:40,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:40,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:40,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:40,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 11:10:40,643 INFO L87 Difference]: Start difference. First operand 23435 states and 25685 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 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:10:41,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:41,298 INFO L93 Difference]: Finished difference Result 48349 states and 53032 transitions. [2024-11-08 11:10:41,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:41,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 373 [2024-11-08 11:10:41,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:41,323 INFO L225 Difference]: With dead ends: 48349 [2024-11-08 11:10:41,323 INFO L226 Difference]: Without dead ends: 24916 [2024-11-08 11:10:41,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 743 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 11:10:41,338 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 124 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:41,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 52 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:10:41,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24916 states. [2024-11-08 11:10:41,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24916 to 17543. [2024-11-08 11:10:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17543 states, 17542 states have (on average 1.0860221183445444) internal successors, (19051), 17542 states have internal predecessors, (19051), 0 states have call successors, (0), 0 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:10:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17543 states to 17543 states and 19051 transitions. [2024-11-08 11:10:41,574 INFO L78 Accepts]: Start accepts. Automaton has 17543 states and 19051 transitions. Word has length 373 [2024-11-08 11:10:41,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:41,574 INFO L471 AbstractCegarLoop]: Abstraction has 17543 states and 19051 transitions. [2024-11-08 11:10:41,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 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:10:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 17543 states and 19051 transitions. [2024-11-08 11:10:41,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2024-11-08 11:10:41,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:41,583 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:41,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 11:10:41,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 11:10:41,786 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:41,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:41,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1437509171, now seen corresponding path program 1 times [2024-11-08 11:10:41,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:41,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548378887] [2024-11-08 11:10:41,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:41,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 283 proven. 205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:42,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:42,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548378887] [2024-11-08 11:10:42,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548378887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:10:42,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099467585] [2024-11-08 11:10:42,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:42,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:10:42,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:10:42,375 INFO L229 MonitoredProcess]: Starting monitored process 8 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:10:42,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 11:10:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:42,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 11:10:42,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:10:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 283 proven. 205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:43,535 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:10:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 283 proven. 205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:45,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099467585] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 11:10:45,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 11:10:45,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-08 11:10:45,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469759651] [2024-11-08 11:10:45,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 11:10:45,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 11:10:45,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:45,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 11:10:45,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-08 11:10:45,322 INFO L87 Difference]: Start difference. First operand 17543 states and 19051 transitions. Second operand has 10 states, 10 states have (on average 73.4) internal successors, (734), 9 states have internal predecessors, (734), 0 states have call successors, (0), 0 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:10:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:47,817 INFO L93 Difference]: Finished difference Result 36222 states and 39282 transitions. [2024-11-08 11:10:47,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 11:10:47,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 73.4) internal successors, (734), 9 states have internal predecessors, (734), 0 states have call successors, (0), 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 415 [2024-11-08 11:10:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:47,836 INFO L225 Difference]: With dead ends: 36222 [2024-11-08 11:10:47,837 INFO L226 Difference]: Without dead ends: 19049 [2024-11-08 11:10:47,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 826 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-11-08 11:10:47,849 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1051 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 3686 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 4096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 3686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:47,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 115 Invalid, 4096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 3686 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 11:10:47,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19049 states. [2024-11-08 11:10:47,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19049 to 14047. [2024-11-08 11:10:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14047 states, 14046 states have (on average 1.0810195073330486) internal successors, (15184), 14046 states have internal predecessors, (15184), 0 states have call successors, (0), 0 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:10:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14047 states to 14047 states and 15184 transitions. [2024-11-08 11:10:47,986 INFO L78 Accepts]: Start accepts. Automaton has 14047 states and 15184 transitions. Word has length 415 [2024-11-08 11:10:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:47,987 INFO L471 AbstractCegarLoop]: Abstraction has 14047 states and 15184 transitions. [2024-11-08 11:10:47,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 73.4) internal successors, (734), 9 states have internal predecessors, (734), 0 states have call successors, (0), 0 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:10:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 14047 states and 15184 transitions. [2024-11-08 11:10:48,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2024-11-08 11:10:48,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:48,043 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:10:48,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 11:10:48,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:10:48,244 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:48,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:48,244 INFO L85 PathProgramCache]: Analyzing trace with hash -576802177, now seen corresponding path program 1 times [2024-11-08 11:10:48,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:48,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983212863] [2024-11-08 11:10:48,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:48,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-08 11:10:48,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:48,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983212863] [2024-11-08 11:10:48,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983212863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:48,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:48,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:48,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277856295] [2024-11-08 11:10:48,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:48,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:10:48,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:48,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:10:48,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:10:48,542 INFO L87 Difference]: Start difference. First operand 14047 states and 15184 transitions. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 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:10:49,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:49,433 INFO L93 Difference]: Finished difference Result 34180 states and 36948 transitions. [2024-11-08 11:10:49,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:10:49,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 416 [2024-11-08 11:10:49,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:49,452 INFO L225 Difference]: With dead ends: 34180 [2024-11-08 11:10:49,452 INFO L226 Difference]: Without dead ends: 20135 [2024-11-08 11:10:49,462 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:10:49,462 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 206 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:49,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 68 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:10:49,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20135 states. [2024-11-08 11:10:49,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20135 to 19023. [2024-11-08 11:10:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19023 states, 19022 states have (on average 1.080643465461045) internal successors, (20556), 19022 states have internal predecessors, (20556), 0 states have call successors, (0), 0 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:10:49,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19023 states to 19023 states and 20556 transitions. [2024-11-08 11:10:49,634 INFO L78 Accepts]: Start accepts. Automaton has 19023 states and 20556 transitions. Word has length 416 [2024-11-08 11:10:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:49,634 INFO L471 AbstractCegarLoop]: Abstraction has 19023 states and 20556 transitions. [2024-11-08 11:10:49,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 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:10:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 19023 states and 20556 transitions. [2024-11-08 11:10:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2024-11-08 11:10:49,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:49,643 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:49,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 11:10:49,643 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:49,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1569054232, now seen corresponding path program 1 times [2024-11-08 11:10:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:49,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090198589] [2024-11-08 11:10:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:49,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 154 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:50,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:50,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090198589] [2024-11-08 11:10:50,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090198589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:10:50,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995268403] [2024-11-08 11:10:50,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:50,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:10:50,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:10:50,404 INFO L229 MonitoredProcess]: Starting monitored process 9 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:10:50,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 11:10:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:50,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 11:10:50,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:10:51,656 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 154 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:51,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:10:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 275 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:53,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995268403] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 11:10:53,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 11:10:53,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-08 11:10:53,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426738508] [2024-11-08 11:10:53,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 11:10:53,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 11:10:53,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:53,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 11:10:53,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2024-11-08 11:10:53,895 INFO L87 Difference]: Start difference. First operand 19023 states and 20556 transitions. Second operand has 13 states, 13 states have (on average 104.92307692307692) internal successors, (1364), 12 states have internal predecessors, (1364), 0 states have call successors, (0), 0 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:10:58,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:58,308 INFO L93 Difference]: Finished difference Result 40984 states and 44511 transitions. [2024-11-08 11:10:58,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 11:10:58,309 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 104.92307692307692) internal successors, (1364), 12 states have internal predecessors, (1364), 0 states have call successors, (0), 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 476 [2024-11-08 11:10:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:58,330 INFO L225 Difference]: With dead ends: 40984 [2024-11-08 11:10:58,330 INFO L226 Difference]: Without dead ends: 21595 [2024-11-08 11:10:58,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 958 GetRequests, 944 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-11-08 11:10:58,342 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 988 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 8823 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 9261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 8823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:58,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 248 Invalid, 9261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 8823 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 11:10:58,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21595 states. [2024-11-08 11:10:58,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21595 to 18828. [2024-11-08 11:10:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18828 states, 18827 states have (on average 1.0701651882934085) internal successors, (20148), 18827 states have internal predecessors, (20148), 0 states have call successors, (0), 0 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:10:58,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18828 states to 18828 states and 20148 transitions. [2024-11-08 11:10:58,519 INFO L78 Accepts]: Start accepts. Automaton has 18828 states and 20148 transitions. Word has length 476 [2024-11-08 11:10:58,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:58,519 INFO L471 AbstractCegarLoop]: Abstraction has 18828 states and 20148 transitions. [2024-11-08 11:10:58,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 104.92307692307692) internal successors, (1364), 12 states have internal predecessors, (1364), 0 states have call successors, (0), 0 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:10:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 18828 states and 20148 transitions. [2024-11-08 11:10:58,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2024-11-08 11:10:58,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:58,535 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:58,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 11:10:58,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:10:58,736 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:58,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:58,736 INFO L85 PathProgramCache]: Analyzing trace with hash -203478354, now seen corresponding path program 1 times [2024-11-08 11:10:58,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:58,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426613030] [2024-11-08 11:10:58,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:58,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 186 proven. 942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:59,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:59,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426613030] [2024-11-08 11:10:59,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426613030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:10:59,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463109634] [2024-11-08 11:10:59,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:59,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:10:59,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:10:59,870 INFO L229 MonitoredProcess]: Starting monitored process 10 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:10:59,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 11:11:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:00,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 11:11:00,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:11:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 62 proven. 1066 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:11:00,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:11:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 771 proven. 233 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-08 11:11:03,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463109634] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 11:11:03,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 11:11:03,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 17 [2024-11-08 11:11:03,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060005289] [2024-11-08 11:11:03,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 11:11:03,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 11:11:03,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:03,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 11:11:03,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-11-08 11:11:03,639 INFO L87 Difference]: Start difference. First operand 18828 states and 20148 transitions. Second operand has 17 states, 17 states have (on average 117.05882352941177) internal successors, (1990), 17 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:07,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:07,817 INFO L93 Difference]: Finished difference Result 56291 states and 60154 transitions. [2024-11-08 11:11:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 11:11:07,818 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 117.05882352941177) internal successors, (1990), 17 states have internal predecessors, (1990), 0 states have call successors, (0), 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 705 [2024-11-08 11:11:07,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:07,819 INFO L225 Difference]: With dead ends: 56291 [2024-11-08 11:11:07,819 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:11:07,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1430 GetRequests, 1407 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2024-11-08 11:11:07,838 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 1903 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 7262 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1903 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 7819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 7262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:07,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1903 Valid, 248 Invalid, 7819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 7262 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-08 11:11:07,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:11:07,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:11:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:11:07,840 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 705 [2024-11-08 11:11:07,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:07,843 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:11:07,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 117.05882352941177) internal successors, (1990), 17 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:07,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:11:07,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:11:07,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:11:07,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 11:11:08,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:11:08,050 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:11:08,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:11:20,568 WARN L286 SmtUtils]: Spent 12.51s on a formula simplification. DAG size of input: 654 DAG size of output: 728 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-08 11:11:24,606 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:11:24,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:11:24 BoogieIcfgContainer [2024-11-08 11:11:24,657 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:11:24,657 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:11:24,657 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:11:24,657 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:11:24,658 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:10:09" (3/4) ... [2024-11-08 11:11:24,660 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:11:24,678 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:11:24,679 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:11:24,680 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:11:24,681 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:11:24,842 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:11:24,842 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:11:24,842 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:11:24,843 INFO L158 Benchmark]: Toolchain (without parser) took 77932.10ms. Allocated memory was 167.8MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 91.3MB in the beginning and 719.2MB in the end (delta: -627.9MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-08 11:11:24,843 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:11:24,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.36ms. Allocated memory was 167.8MB in the beginning and 224.4MB in the end (delta: 56.6MB). Free memory was 91.1MB in the beginning and 157.6MB in the end (delta: -66.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 11:11:24,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.47ms. Allocated memory is still 224.4MB. Free memory was 157.6MB in the beginning and 139.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 11:11:24,844 INFO L158 Benchmark]: Boogie Preprocessor took 151.79ms. Allocated memory is still 224.4MB. Free memory was 139.7MB in the beginning and 114.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 11:11:24,844 INFO L158 Benchmark]: RCFGBuilder took 1336.79ms. Allocated memory is still 224.4MB. Free memory was 114.6MB in the beginning and 151.1MB in the end (delta: -36.5MB). Peak memory consumption was 87.2MB. Max. memory is 16.1GB. [2024-11-08 11:11:24,844 INFO L158 Benchmark]: TraceAbstraction took 75574.61ms. Allocated memory was 224.4MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 151.1MB in the beginning and 737.1MB in the end (delta: -586.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-08 11:11:24,844 INFO L158 Benchmark]: Witness Printer took 185.31ms. Allocated memory is still 1.8GB. Free memory was 737.1MB in the beginning and 719.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 11:11:24,845 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.17ms. Allocated memory is still 167.8MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 568.36ms. Allocated memory was 167.8MB in the beginning and 224.4MB in the end (delta: 56.6MB). Free memory was 91.1MB in the beginning and 157.6MB in the end (delta: -66.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.47ms. Allocated memory is still 224.4MB. Free memory was 157.6MB in the beginning and 139.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 151.79ms. Allocated memory is still 224.4MB. Free memory was 139.7MB in the beginning and 114.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1336.79ms. Allocated memory is still 224.4MB. Free memory was 114.6MB in the beginning and 151.1MB in the end (delta: -36.5MB). Peak memory consumption was 87.2MB. Max. memory is 16.1GB. * TraceAbstraction took 75574.61ms. Allocated memory was 224.4MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 151.1MB in the beginning and 737.1MB in the end (delta: -586.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 185.31ms. Allocated memory is still 1.8GB. Free memory was 737.1MB in the beginning and 719.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 208]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.9s, OverallIterations: 20, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 28.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9205 SdHoareTripleChecker+Valid, 25.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9205 mSDsluCounter, 4016 SdHoareTripleChecker+Invalid, 21.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1102 mSDsCounter, 4197 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37457 IncrementalHoareTripleChecker+Invalid, 41654 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4197 mSolverCounterUnsat, 2914 mSDtfsCounter, 37457 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6298 GetRequests, 6185 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23435occurred in iteration=15, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 24124 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 9664 NumberOfCodeBlocks, 9664 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 12238 ConstructedInterpolants, 0 QuantifiedInterpolants, 81282 SizeOfPredicates, 18 NumberOfNonLiveVariables, 4755 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 35 InterpolantComputations, 15 PerfectInterpolantSequences, 8131/13180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((a29 <= 140) && (0 <= ((long long) 909625 + a23))) && (a4 == 0)) && (a25 <= 10)) && (a3 == 1)) && (((long long) a23 + 599772) <= 0)) && (a8 == 15)) && (a25 != 9)) || ((((((((long long) a23 + 43) <= 0) && (a25 == 12)) && (0 <= ((long long) a23 + 599772))) && (a4 == 0)) && (a3 == 1)) && (a8 == 15))) || (((((((long long) a29 + 275802) <= 0) && (a25 == 9)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((((long long) a23 + 43) <= 0) && (a29 <= 140)) && (a25 == 11)) && (0 <= ((long long) 386869 + a23))) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((0 <= ((long long) 909625 + a23)) && (a4 == 0)) && (((long long) a29 + 275824) <= 0)) && (a25 == 9)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((((((0 <= ((long long) a23 + 599772)) && (a4 == 0)) && (a25 == 11)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (246 <= a29)) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483491)))) || (((((((((0 <= ((long long) a23 + 599772)) && (a29 <= 140)) && (a4 == 0)) && (0 <= (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118))) && (a25 <= 10)) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a8 == 15)) && ((0 < ((long long) a23 + 43)) || (a25 != 9)))) || ((((((((a25 == 11) && (0 <= (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118))) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a29 <= 220)) && (a4 == 1)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((((((long long) a23 + 43) <= 0) && (a3 == 1)) && (a4 == 1)) && (214883 <= a29)) && (a8 == 15)) && (a25 == 10))) || ((((((((0 <= (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 138028))) && (a4 == 1)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) && ((a25 == 13) || (a25 == 12)))) || (((((((((long long) a23 + 43) <= 0) && (0 <= ((long long) a23 + 599772))) && (a29 <= 140)) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((((a29 <= 275) && ((((a23 >= 0) ? (a23 % 5) : ((a23 % 5) + 5)) != 0) || (0 < (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301942)))) && (a3 == 1)) && (((long long) a23 + 599772) <= 0)) && (a4 == 1)) && (a25 <= 9)) && (a8 == 15)) && (246 <= a29)) && (0 <= (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301942)))) || (((((((a4 == 0) && (a3 == 1)) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 138028))) && (a23 <= 312)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) && ((a25 == 13) || (a25 == 12)))) || ((((((((a29 <= 275) && (a25 == 12)) && (140 < a29)) && (0 <= ((long long) 909625 + a23))) && (a4 == 0)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15))) || (((((((a29 <= 140) && (0 <= ((long long) 909625 + a23))) && (a4 == 0)) && (a25 == 11)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((((a25 == 13) && (a29 <= 275)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || (((((((a25 == 11) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483491))) && (0 <= ((long long) a23 + 42)))) || (((((((((a25 == 11) && (0 <= (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118))) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a4 == 1)) && (a8 == 15)) && (246 <= a29)) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483491))) && (0 <= ((long long) a23 + 42)))) || ((((((((0 <= ((long long) 909625 + a23)) && (a25 == 11)) && (a3 == 1)) && (a4 == 1)) && (214883 <= a29)) && (a23 <= 312)) && (a8 == 15)) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483491)))) || (((((((a23 >= 0) ? (a23 % 5) : ((a23 % 5) + 5)) != 0) || (0 < (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301942))) && (a23 <= 312)) && (0 <= (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301942))) && (((((((a29 <= 275) && (a25 == 12)) && (a4 == 0)) && (a3 == 1)) && (a8 == 15)) && (246 <= a29)) || ((((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 == 9)) && (10250 <= a29)) && (a3 == 1)) && (a8 == 15))))) || ((((((((0 <= ((long long) 909625 + a23)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a25 <= 9)) && (a8 == 15)) && (246 <= a29)) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483491)))) || (((((((((long long) a23 + 43) <= 0) && (0 <= ((long long) a23 + 599772))) && (a3 == 1)) && (a29 <= 220)) && (a4 == 1)) && (a8 == 15)) && ((a25 == 13) || (a25 == 12)))) || ((((((((long long) 599992 + a23) <= 0) && (a3 == 1)) && (a29 <= 220)) && (a4 == 1)) && (a8 == 15)) && ((a25 == 13) || (a25 == 12)))) || ((((((((0 <= (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) && (a25 <= 10)) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a4 == 1)) && (a8 == 15)) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483491))) && (0 <= ((long long) a23 + 42)))) || ((((((((a29 <= 275) && (0 <= ((long long) a23 + 599772))) && (a25 == 11)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (246 <= a29))) || ((((((((a29 <= 275) && (a25 == 12)) && (a4 == 0)) && (0 <= (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118))) && (0 <= ((long long) 386869 + a23))) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:11:24,883 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