./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:27:59,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:27:59,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:27:59,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:27:59,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:27:59,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:27:59,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:27:59,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:27:59,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:27:59,756 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:27:59,756 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:27:59,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:27:59,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:27:59,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:27:59,759 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:27:59,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:27:59,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:27:59,760 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:27:59,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:27:59,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:27:59,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:27:59,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:27:59,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:27:59,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:27:59,763 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:27:59,764 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:27:59,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:27:59,764 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:27:59,764 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:27:59,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:27:59,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:27:59,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:27:59,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:27:59,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:27:59,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:27:59,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:27:59,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:27:59,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:27:59,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:27:59,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:27:59,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:27:59,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:27:59,767 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2024-10-10 22:27:59,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:27:59,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:27:59,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:27:59,988 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:27:59,988 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:27:59,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2024-10-10 22:28:01,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:28:01,328 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:28:01,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2024-10-10 22:28:01,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fb26bc929/929172e7d1834e989623ded48d913d22/FLAG53c87f474 [2024-10-10 22:28:01,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fb26bc929/929172e7d1834e989623ded48d913d22 [2024-10-10 22:28:01,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:28:01,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:28:01,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:28:01,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:28:01,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:28:01,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:28:01" (1/1) ... [2024-10-10 22:28:01,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5462e1f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:01, skipping insertion in model container [2024-10-10 22:28:01,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:28:01" (1/1) ... [2024-10-10 22:28:01,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:28:01,516 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2024-10-10 22:28:01,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:28:01,553 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:28:01,562 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2024-10-10 22:28:01,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:28:01,591 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:28:01,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:01 WrapperNode [2024-10-10 22:28:01,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:28:01,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:28:01,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:28:01,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:28:01,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:01" (1/1) ... [2024-10-10 22:28:01,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:01" (1/1) ... [2024-10-10 22:28:01,627 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 147 [2024-10-10 22:28:01,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:28:01,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:28:01,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:28:01,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:28:01,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:01" (1/1) ... [2024-10-10 22:28:01,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:01" (1/1) ... [2024-10-10 22:28:01,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:01" (1/1) ... [2024-10-10 22:28:01,660 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:28:01,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:01" (1/1) ... [2024-10-10 22:28:01,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:01" (1/1) ... [2024-10-10 22:28:01,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:01" (1/1) ... [2024-10-10 22:28:01,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:01" (1/1) ... [2024-10-10 22:28:01,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:01" (1/1) ... [2024-10-10 22:28:01,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:01" (1/1) ... [2024-10-10 22:28:01,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:28:01,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:28:01,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:28:01,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:28:01,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:01" (1/1) ... [2024-10-10 22:28:01,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:28:01,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:01,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:28:01,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:28:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:28:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:28:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:28:01,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:28:01,800 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:28:01,803 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:28:02,093 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-10 22:28:02,094 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:28:02,133 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:28:02,134 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-10 22:28:02,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:28:02 BoogieIcfgContainer [2024-10-10 22:28:02,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:28:02,136 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:28:02,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:28:02,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:28:02,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:28:01" (1/3) ... [2024-10-10 22:28:02,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a20f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:28:02, skipping insertion in model container [2024-10-10 22:28:02,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:01" (2/3) ... [2024-10-10 22:28:02,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a20f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:28:02, skipping insertion in model container [2024-10-10 22:28:02,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:28:02" (3/3) ... [2024-10-10 22:28:02,141 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2024-10-10 22:28:02,153 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:28:02,154 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:28:02,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:28:02,203 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;@4bd0c287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:28:02,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:28:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 46 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-10 22:28:02,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:02,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:02,212 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:02,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:02,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1580274276, now seen corresponding path program 1 times [2024-10-10 22:28:02,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:02,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857893250] [2024-10-10 22:28:02,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:02,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:02,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:02,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857893250] [2024-10-10 22:28:02,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857893250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:02,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:02,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:28:02,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267141450] [2024-10-10 22:28:02,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:02,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:28:02,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:02,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:28:02,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:28:02,376 INFO L87 Difference]: Start difference. First operand has 47 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 46 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:02,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:02,399 INFO L93 Difference]: Finished difference Result 68 states and 115 transitions. [2024-10-10 22:28:02,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:28:02,402 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-10-10 22:28:02,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:02,408 INFO L225 Difference]: With dead ends: 68 [2024-10-10 22:28:02,408 INFO L226 Difference]: Without dead ends: 45 [2024-10-10 22:28:02,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:28:02,414 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:02,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:28:02,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-10 22:28:02,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-10 22:28:02,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.75) internal successors, (77), 44 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 77 transitions. [2024-10-10 22:28:02,442 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 77 transitions. Word has length 13 [2024-10-10 22:28:02,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:02,442 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 77 transitions. [2024-10-10 22:28:02,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:02,443 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 77 transitions. [2024-10-10 22:28:02,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-10 22:28:02,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:02,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:02,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:28:02,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:02,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:02,445 INFO L85 PathProgramCache]: Analyzing trace with hash 388665470, now seen corresponding path program 1 times [2024-10-10 22:28:02,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:02,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975566777] [2024-10-10 22:28:02,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:02,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:02,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:02,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975566777] [2024-10-10 22:28:02,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975566777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:02,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:02,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:28:02,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857312830] [2024-10-10 22:28:02,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:02,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:28:02,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:02,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:28:02,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:28:02,636 INFO L87 Difference]: Start difference. First operand 45 states and 77 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:02,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:02,763 INFO L93 Difference]: Finished difference Result 104 states and 183 transitions. [2024-10-10 22:28:02,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:28:02,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-10-10 22:28:02,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:02,764 INFO L225 Difference]: With dead ends: 104 [2024-10-10 22:28:02,765 INFO L226 Difference]: Without dead ends: 68 [2024-10-10 22:28:02,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:28:02,767 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 24 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:02,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 82 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:02,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-10 22:28:02,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-10-10 22:28:02,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 65 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:02,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-10 22:28:02,776 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 13 [2024-10-10 22:28:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:02,776 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-10 22:28:02,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-10 22:28:02,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-10 22:28:02,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:02,777 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:02,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:28:02,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:02,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:02,778 INFO L85 PathProgramCache]: Analyzing trace with hash -920391629, now seen corresponding path program 1 times [2024-10-10 22:28:02,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:02,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831361803] [2024-10-10 22:28:02,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:02,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:02,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:02,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831361803] [2024-10-10 22:28:02,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831361803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:02,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:02,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:28:02,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954262463] [2024-10-10 22:28:02,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:02,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:28:02,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:02,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:28:02,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:28:02,893 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:03,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:03,099 INFO L93 Difference]: Finished difference Result 161 states and 276 transitions. [2024-10-10 22:28:03,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:28:03,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-10 22:28:03,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:03,101 INFO L225 Difference]: With dead ends: 161 [2024-10-10 22:28:03,101 INFO L226 Difference]: Without dead ends: 125 [2024-10-10 22:28:03,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:28:03,102 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 92 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:03,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 108 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:03,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-10 22:28:03,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 89. [2024-10-10 22:28:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.5568181818181819) internal successors, (137), 88 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2024-10-10 22:28:03,117 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 137 transitions. Word has length 19 [2024-10-10 22:28:03,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:03,117 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 137 transitions. [2024-10-10 22:28:03,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 137 transitions. [2024-10-10 22:28:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-10 22:28:03,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:03,118 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:03,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:28:03,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:03,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:03,119 INFO L85 PathProgramCache]: Analyzing trace with hash 414964068, now seen corresponding path program 1 times [2024-10-10 22:28:03,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:03,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799590862] [2024-10-10 22:28:03,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:03,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:28:03,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:03,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799590862] [2024-10-10 22:28:03,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799590862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:03,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:03,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:28:03,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200821154] [2024-10-10 22:28:03,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:03,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:28:03,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:03,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:28:03,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:28:03,253 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:03,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:03,373 INFO L93 Difference]: Finished difference Result 231 states and 351 transitions. [2024-10-10 22:28:03,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:28:03,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 25 [2024-10-10 22:28:03,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:03,374 INFO L225 Difference]: With dead ends: 231 [2024-10-10 22:28:03,374 INFO L226 Difference]: Without dead ends: 154 [2024-10-10 22:28:03,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:28:03,375 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 70 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:03,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 172 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:03,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-10 22:28:03,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 97. [2024-10-10 22:28:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.5208333333333333) internal successors, (146), 96 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 146 transitions. [2024-10-10 22:28:03,383 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 146 transitions. Word has length 25 [2024-10-10 22:28:03,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:03,383 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 146 transitions. [2024-10-10 22:28:03,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 146 transitions. [2024-10-10 22:28:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-10 22:28:03,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:03,384 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:03,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:28:03,385 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:03,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:03,385 INFO L85 PathProgramCache]: Analyzing trace with hash 983673701, now seen corresponding path program 1 times [2024-10-10 22:28:03,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:03,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075205675] [2024-10-10 22:28:03,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:03,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:28:03,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:03,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075205675] [2024-10-10 22:28:03,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075205675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:03,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:03,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:28:03,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219659396] [2024-10-10 22:28:03,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:03,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:28:03,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:03,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:28:03,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:28:03,481 INFO L87 Difference]: Start difference. First operand 97 states and 146 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:03,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:03,581 INFO L93 Difference]: Finished difference Result 252 states and 377 transitions. [2024-10-10 22:28:03,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:28:03,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 26 [2024-10-10 22:28:03,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:03,583 INFO L225 Difference]: With dead ends: 252 [2024-10-10 22:28:03,583 INFO L226 Difference]: Without dead ends: 174 [2024-10-10 22:28:03,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:28:03,584 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 74 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:03,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 180 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:03,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-10 22:28:03,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 107. [2024-10-10 22:28:03,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.5) internal successors, (159), 106 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2024-10-10 22:28:03,591 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 26 [2024-10-10 22:28:03,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:03,591 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2024-10-10 22:28:03,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:03,591 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2024-10-10 22:28:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-10 22:28:03,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:03,592 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:03,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:28:03,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:03,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:03,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1858982925, now seen corresponding path program 1 times [2024-10-10 22:28:03,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:03,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254498629] [2024-10-10 22:28:03,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:03,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:03,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:03,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254498629] [2024-10-10 22:28:03,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254498629] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:03,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958778651] [2024-10-10 22:28:03,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:03,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:03,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:03,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:03,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:28:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:03,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:28:03,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-10 22:28:03,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:03,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958778651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:03,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:28:03,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-10 22:28:03,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952106762] [2024-10-10 22:28:03,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:03,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:28:03,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:03,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:28:03,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-10 22:28:03,809 INFO L87 Difference]: Start difference. First operand 107 states and 159 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:04,003 INFO L93 Difference]: Finished difference Result 374 states and 580 transitions. [2024-10-10 22:28:04,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:28:04,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 27 [2024-10-10 22:28:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:04,006 INFO L225 Difference]: With dead ends: 374 [2024-10-10 22:28:04,006 INFO L226 Difference]: Without dead ends: 282 [2024-10-10 22:28:04,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:28:04,007 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 129 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:04,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 329 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-10 22:28:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 187. [2024-10-10 22:28:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.478494623655914) internal successors, (275), 186 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 275 transitions. [2024-10-10 22:28:04,019 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 275 transitions. Word has length 27 [2024-10-10 22:28:04,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:04,019 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 275 transitions. [2024-10-10 22:28:04,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 275 transitions. [2024-10-10 22:28:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-10 22:28:04,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:04,021 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:04,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:28:04,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:04,222 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:04,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:04,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2099761446, now seen corresponding path program 1 times [2024-10-10 22:28:04,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:04,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878581744] [2024-10-10 22:28:04,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:04,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:04,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:04,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878581744] [2024-10-10 22:28:04,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878581744] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:04,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230506568] [2024-10-10 22:28:04,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:04,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:04,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:04,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:04,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:28:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:04,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:28:04,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:04,406 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:28:04,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:04,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230506568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:04,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:28:04,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-10-10 22:28:04,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926191402] [2024-10-10 22:28:04,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:04,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:28:04,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:04,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:28:04,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:28:04,408 INFO L87 Difference]: Start difference. First operand 187 states and 275 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:04,542 INFO L93 Difference]: Finished difference Result 423 states and 659 transitions. [2024-10-10 22:28:04,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:28:04,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 28 [2024-10-10 22:28:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:04,544 INFO L225 Difference]: With dead ends: 423 [2024-10-10 22:28:04,544 INFO L226 Difference]: Without dead ends: 262 [2024-10-10 22:28:04,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:28:04,545 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 37 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:04,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 143 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-10 22:28:04,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 233. [2024-10-10 22:28:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.4008620689655173) internal successors, (325), 232 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 325 transitions. [2024-10-10 22:28:04,566 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 325 transitions. Word has length 28 [2024-10-10 22:28:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:04,566 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 325 transitions. [2024-10-10 22:28:04,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 325 transitions. [2024-10-10 22:28:04,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-10 22:28:04,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:04,568 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:04,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 22:28:04,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:04,769 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:04,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:04,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1093714447, now seen corresponding path program 1 times [2024-10-10 22:28:04,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:04,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92661174] [2024-10-10 22:28:04,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:04,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:04,857 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:04,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:04,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92661174] [2024-10-10 22:28:04,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92661174] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:04,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330146242] [2024-10-10 22:28:04,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:04,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:04,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:04,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:04,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:28:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:04,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:28:04,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 22:28:04,939 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:04,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330146242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:04,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:28:04,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-10-10 22:28:04,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106343700] [2024-10-10 22:28:04,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:04,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:28:04,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:04,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:28:04,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:28:04,941 INFO L87 Difference]: Start difference. First operand 233 states and 325 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:05,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:05,072 INFO L93 Difference]: Finished difference Result 515 states and 747 transitions. [2024-10-10 22:28:05,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:28:05,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 34 [2024-10-10 22:28:05,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:05,074 INFO L225 Difference]: With dead ends: 515 [2024-10-10 22:28:05,074 INFO L226 Difference]: Without dead ends: 320 [2024-10-10 22:28:05,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:28:05,075 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 36 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:05,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 143 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:05,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-10 22:28:05,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 273. [2024-10-10 22:28:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 1.3713235294117647) internal successors, (373), 272 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 373 transitions. [2024-10-10 22:28:05,095 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 373 transitions. Word has length 34 [2024-10-10 22:28:05,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:05,095 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 373 transitions. [2024-10-10 22:28:05,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:05,096 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 373 transitions. [2024-10-10 22:28:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 22:28:05,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:05,097 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:05,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:28:05,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:05,298 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:05,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:05,298 INFO L85 PathProgramCache]: Analyzing trace with hash -985440832, now seen corresponding path program 1 times [2024-10-10 22:28:05,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:05,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948253269] [2024-10-10 22:28:05,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:05,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-10 22:28:05,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:05,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948253269] [2024-10-10 22:28:05,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948253269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:05,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:05,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:28:05,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403521506] [2024-10-10 22:28:05,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:05,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:28:05,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:05,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:28:05,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:28:05,388 INFO L87 Difference]: Start difference. First operand 273 states and 373 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:05,573 INFO L93 Difference]: Finished difference Result 944 states and 1290 transitions. [2024-10-10 22:28:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:28:05,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 40 [2024-10-10 22:28:05,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:05,576 INFO L225 Difference]: With dead ends: 944 [2024-10-10 22:28:05,576 INFO L226 Difference]: Without dead ends: 707 [2024-10-10 22:28:05,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:28:05,577 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 141 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:05,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 262 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-10-10 22:28:05,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 273. [2024-10-10 22:28:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 1.3713235294117647) internal successors, (373), 272 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 373 transitions. [2024-10-10 22:28:05,587 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 373 transitions. Word has length 40 [2024-10-10 22:28:05,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:05,587 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 373 transitions. [2024-10-10 22:28:05,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 373 transitions. [2024-10-10 22:28:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-10 22:28:05,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:05,589 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:05,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:28:05,590 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:05,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:05,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1696419390, now seen corresponding path program 1 times [2024-10-10 22:28:05,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:05,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789225569] [2024-10-10 22:28:05,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:05,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:05,712 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-10 22:28:05,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:05,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789225569] [2024-10-10 22:28:05,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789225569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:05,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:05,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:28:05,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676570411] [2024-10-10 22:28:05,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:05,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:28:05,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:05,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:28:05,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:28:05,714 INFO L87 Difference]: Start difference. First operand 273 states and 373 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:05,981 INFO L93 Difference]: Finished difference Result 1169 states and 1593 transitions. [2024-10-10 22:28:05,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 22:28:05,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 41 [2024-10-10 22:28:05,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:05,984 INFO L225 Difference]: With dead ends: 1169 [2024-10-10 22:28:05,984 INFO L226 Difference]: Without dead ends: 932 [2024-10-10 22:28:05,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:28:05,987 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 212 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:05,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 393 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-10-10 22:28:06,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 273. [2024-10-10 22:28:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 1.3713235294117647) internal successors, (373), 272 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 373 transitions. [2024-10-10 22:28:06,006 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 373 transitions. Word has length 41 [2024-10-10 22:28:06,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:06,006 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 373 transitions. [2024-10-10 22:28:06,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 373 transitions. [2024-10-10 22:28:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-10 22:28:06,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:06,007 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:06,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:28:06,007 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:06,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:06,008 INFO L85 PathProgramCache]: Analyzing trace with hash -354564608, now seen corresponding path program 1 times [2024-10-10 22:28:06,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:06,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366783339] [2024-10-10 22:28:06,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:06,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-10 22:28:06,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:06,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366783339] [2024-10-10 22:28:06,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366783339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:06,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:06,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:28:06,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161755329] [2024-10-10 22:28:06,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:06,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:28:06,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:06,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:28:06,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:28:06,082 INFO L87 Difference]: Start difference. First operand 273 states and 373 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:06,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:06,093 INFO L93 Difference]: Finished difference Result 524 states and 713 transitions. [2024-10-10 22:28:06,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:28:06,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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 41 [2024-10-10 22:28:06,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:06,095 INFO L225 Difference]: With dead ends: 524 [2024-10-10 22:28:06,095 INFO L226 Difference]: Without dead ends: 259 [2024-10-10 22:28:06,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:28:06,096 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 64 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:06,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 70 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:28:06,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-10 22:28:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-10-10 22:28:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.3604651162790697) internal successors, (351), 258 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 351 transitions. [2024-10-10 22:28:06,104 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 351 transitions. Word has length 41 [2024-10-10 22:28:06,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:06,105 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 351 transitions. [2024-10-10 22:28:06,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 351 transitions. [2024-10-10 22:28:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 22:28:06,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:06,105 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:06,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 22:28:06,106 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:06,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:06,106 INFO L85 PathProgramCache]: Analyzing trace with hash 994671581, now seen corresponding path program 1 times [2024-10-10 22:28:06,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:06,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710556451] [2024-10-10 22:28:06,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:06,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 22:28:06,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:06,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710556451] [2024-10-10 22:28:06,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710556451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:06,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:06,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:28:06,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711008139] [2024-10-10 22:28:06,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:06,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:28:06,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:06,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:28:06,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:28:06,148 INFO L87 Difference]: Start difference. First operand 259 states and 351 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:06,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:06,164 INFO L93 Difference]: Finished difference Result 370 states and 492 transitions. [2024-10-10 22:28:06,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:28:06,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-10 22:28:06,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:06,165 INFO L225 Difference]: With dead ends: 370 [2024-10-10 22:28:06,165 INFO L226 Difference]: Without dead ends: 324 [2024-10-10 22:28:06,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:28:06,166 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:06,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 136 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:28:06,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-10 22:28:06,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 318. [2024-10-10 22:28:06,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.3249211356466877) internal successors, (420), 317 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:06,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 420 transitions. [2024-10-10 22:28:06,177 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 420 transitions. Word has length 46 [2024-10-10 22:28:06,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:06,178 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 420 transitions. [2024-10-10 22:28:06,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:06,178 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 420 transitions. [2024-10-10 22:28:06,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 22:28:06,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:06,178 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:06,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:28:06,179 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:06,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:06,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1269431195, now seen corresponding path program 1 times [2024-10-10 22:28:06,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:06,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147766373] [2024-10-10 22:28:06,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:06,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 22:28:06,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:06,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147766373] [2024-10-10 22:28:06,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147766373] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:06,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195697697] [2024-10-10 22:28:06,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:06,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:06,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:06,289 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:06,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:28:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:06,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-10 22:28:06,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:28:06,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:06,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195697697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:06,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:28:06,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-10-10 22:28:06,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046496061] [2024-10-10 22:28:06,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:06,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:28:06,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:06,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:28:06,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:28:06,369 INFO L87 Difference]: Start difference. First operand 318 states and 420 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:06,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:06,433 INFO L93 Difference]: Finished difference Result 681 states and 903 transitions. [2024-10-10 22:28:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:28:06,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-10 22:28:06,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:06,434 INFO L225 Difference]: With dead ends: 681 [2024-10-10 22:28:06,435 INFO L226 Difference]: Without dead ends: 337 [2024-10-10 22:28:06,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:28:06,435 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 26 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:06,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 106 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:28:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-10 22:28:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 262. [2024-10-10 22:28:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.3065134099616857) internal successors, (341), 261 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 341 transitions. [2024-10-10 22:28:06,447 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 341 transitions. Word has length 46 [2024-10-10 22:28:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:06,448 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 341 transitions. [2024-10-10 22:28:06,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 341 transitions. [2024-10-10 22:28:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-10 22:28:06,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:06,449 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:06,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 22:28:06,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-10 22:28:06,649 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:06,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:06,650 INFO L85 PathProgramCache]: Analyzing trace with hash -234593945, now seen corresponding path program 1 times [2024-10-10 22:28:06,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:06,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234133319] [2024-10-10 22:28:06,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:06,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-10 22:28:06,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:06,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234133319] [2024-10-10 22:28:06,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234133319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:06,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:06,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:28:06,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60830569] [2024-10-10 22:28:06,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:06,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:28:06,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:06,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:28:06,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:28:06,809 INFO L87 Difference]: Start difference. First operand 262 states and 341 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:06,897 INFO L93 Difference]: Finished difference Result 845 states and 1083 transitions. [2024-10-10 22:28:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:28:06,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 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 67 [2024-10-10 22:28:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:06,899 INFO L225 Difference]: With dead ends: 845 [2024-10-10 22:28:06,899 INFO L226 Difference]: Without dead ends: 599 [2024-10-10 22:28:06,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:28:06,900 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 137 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:06,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 226 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:06,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-10-10 22:28:06,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 392. [2024-10-10 22:28:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.3017902813299234) internal successors, (509), 391 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 509 transitions. [2024-10-10 22:28:06,913 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 509 transitions. Word has length 67 [2024-10-10 22:28:06,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:06,913 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 509 transitions. [2024-10-10 22:28:06,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 509 transitions. [2024-10-10 22:28:06,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-10 22:28:06,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:06,914 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:06,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:28:06,915 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:06,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:06,915 INFO L85 PathProgramCache]: Analyzing trace with hash 760727465, now seen corresponding path program 1 times [2024-10-10 22:28:06,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:06,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142678151] [2024-10-10 22:28:06,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:06,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:28:07,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:07,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142678151] [2024-10-10 22:28:07,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142678151] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:07,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704971168] [2024-10-10 22:28:07,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:07,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:07,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:07,363 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:07,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 22:28:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:07,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-10 22:28:07,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-10 22:28:07,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:07,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704971168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:07,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:28:07,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-10-10 22:28:07,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869428949] [2024-10-10 22:28:07,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:07,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 22:28:07,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:07,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 22:28:07,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-10-10 22:28:07,563 INFO L87 Difference]: Start difference. First operand 392 states and 509 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:07,858 INFO L93 Difference]: Finished difference Result 1190 states and 1531 transitions. [2024-10-10 22:28:07,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-10 22:28:07,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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 67 [2024-10-10 22:28:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:07,860 INFO L225 Difference]: With dead ends: 1190 [2024-10-10 22:28:07,860 INFO L226 Difference]: Without dead ends: 766 [2024-10-10 22:28:07,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2024-10-10 22:28:07,861 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 233 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:07,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 477 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:07,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-10-10 22:28:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 370. [2024-10-10 22:28:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 1.2682926829268293) internal successors, (468), 369 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 468 transitions. [2024-10-10 22:28:07,875 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 468 transitions. Word has length 67 [2024-10-10 22:28:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:07,875 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 468 transitions. [2024-10-10 22:28:07,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 468 transitions. [2024-10-10 22:28:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-10 22:28:07,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:07,876 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:07,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 22:28:08,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-10 22:28:08,081 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:08,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:08,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1676929189, now seen corresponding path program 1 times [2024-10-10 22:28:08,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:08,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921170572] [2024-10-10 22:28:08,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:08,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 50 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 22:28:08,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:08,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921170572] [2024-10-10 22:28:08,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921170572] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:08,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479372788] [2024-10-10 22:28:08,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:08,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:08,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:08,307 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:08,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 22:28:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:08,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-10 22:28:08,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 64 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 22:28:08,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 22:28:08,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479372788] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:08,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:28:08,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-10-10 22:28:08,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326614569] [2024-10-10 22:28:08,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:08,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-10 22:28:08,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:08,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-10 22:28:08,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-10 22:28:08,686 INFO L87 Difference]: Start difference. First operand 370 states and 468 transitions. Second operand has 15 states, 15 states have (on average 9.4) internal successors, (141), 14 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:09,097 INFO L93 Difference]: Finished difference Result 933 states and 1165 transitions. [2024-10-10 22:28:09,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-10 22:28:09,098 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.4) internal successors, (141), 14 states have internal predecessors, (141), 0 states have call successors, (0), 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 71 [2024-10-10 22:28:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:09,100 INFO L225 Difference]: With dead ends: 933 [2024-10-10 22:28:09,100 INFO L226 Difference]: Without dead ends: 579 [2024-10-10 22:28:09,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2024-10-10 22:28:09,101 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 370 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:09,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 658 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:09,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-10-10 22:28:09,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 335. [2024-10-10 22:28:09,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.2604790419161678) internal successors, (421), 334 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 421 transitions. [2024-10-10 22:28:09,115 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 421 transitions. Word has length 71 [2024-10-10 22:28:09,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:09,115 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 421 transitions. [2024-10-10 22:28:09,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.4) internal successors, (141), 14 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:09,115 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 421 transitions. [2024-10-10 22:28:09,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-10 22:28:09,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:09,116 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:09,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-10 22:28:09,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 22:28:09,319 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:09,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:09,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1125508453, now seen corresponding path program 2 times [2024-10-10 22:28:09,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:09,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480197199] [2024-10-10 22:28:09,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:09,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 77 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:28:09,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:09,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480197199] [2024-10-10 22:28:09,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480197199] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:09,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948205302] [2024-10-10 22:28:09,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:28:09,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:09,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:09,652 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:09,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 22:28:09,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:28:09,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:28:09,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-10 22:28:09,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 22:28:09,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 22:28:10,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948205302] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:10,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:28:10,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2024-10-10 22:28:10,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983829707] [2024-10-10 22:28:10,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:10,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-10 22:28:10,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:10,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-10 22:28:10,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2024-10-10 22:28:10,629 INFO L87 Difference]: Start difference. First operand 335 states and 421 transitions. Second operand has 22 states, 22 states have (on average 7.363636363636363) internal successors, (162), 22 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:12,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:12,583 INFO L93 Difference]: Finished difference Result 1867 states and 2278 transitions. [2024-10-10 22:28:12,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-10 22:28:12,584 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.363636363636363) internal successors, (162), 22 states have internal predecessors, (162), 0 states have call successors, (0), 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 71 [2024-10-10 22:28:12,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:12,588 INFO L225 Difference]: With dead ends: 1867 [2024-10-10 22:28:12,588 INFO L226 Difference]: Without dead ends: 1857 [2024-10-10 22:28:12,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=629, Invalid=2563, Unknown=0, NotChecked=0, Total=3192 [2024-10-10 22:28:12,590 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 598 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:12,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1153 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:28:12,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2024-10-10 22:28:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 633. [2024-10-10 22:28:12,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.2658227848101267) internal successors, (800), 632 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 800 transitions. [2024-10-10 22:28:12,620 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 800 transitions. Word has length 71 [2024-10-10 22:28:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:12,620 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 800 transitions. [2024-10-10 22:28:12,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.363636363636363) internal successors, (162), 22 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 800 transitions. [2024-10-10 22:28:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-10 22:28:12,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:12,621 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:12,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-10 22:28:12,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:12,822 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:12,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:12,822 INFO L85 PathProgramCache]: Analyzing trace with hash -681607779, now seen corresponding path program 1 times [2024-10-10 22:28:12,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:12,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597855271] [2024-10-10 22:28:12,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:12,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:28:13,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:13,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597855271] [2024-10-10 22:28:13,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597855271] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:13,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584982409] [2024-10-10 22:28:13,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:13,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:13,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:13,160 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:13,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-10 22:28:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:13,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-10 22:28:13,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:13,465 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 22:28:13,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:13,711 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 22:28:13,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584982409] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:13,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:28:13,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2024-10-10 22:28:13,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642360478] [2024-10-10 22:28:13,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:13,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-10 22:28:13,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:13,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-10 22:28:13,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2024-10-10 22:28:13,713 INFO L87 Difference]: Start difference. First operand 633 states and 800 transitions. Second operand has 24 states, 24 states have (on average 7.5) internal successors, (180), 23 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:15,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:15,315 INFO L93 Difference]: Finished difference Result 1999 states and 2453 transitions. [2024-10-10 22:28:15,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-10 22:28:15,316 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.5) internal successors, (180), 23 states have internal predecessors, (180), 0 states have call successors, (0), 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 71 [2024-10-10 22:28:15,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:15,320 INFO L225 Difference]: With dead ends: 1999 [2024-10-10 22:28:15,320 INFO L226 Difference]: Without dead ends: 1989 [2024-10-10 22:28:15,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=870, Invalid=3290, Unknown=0, NotChecked=0, Total=4160 [2024-10-10 22:28:15,322 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 567 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:15,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1542 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:28:15,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2024-10-10 22:28:15,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 624. [2024-10-10 22:28:15,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 1.2680577849117174) internal successors, (790), 623 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 790 transitions. [2024-10-10 22:28:15,355 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 790 transitions. Word has length 71 [2024-10-10 22:28:15,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:15,355 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 790 transitions. [2024-10-10 22:28:15,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.5) internal successors, (180), 23 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 790 transitions. [2024-10-10 22:28:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-10 22:28:15,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:15,356 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:15,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-10 22:28:15,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-10 22:28:15,557 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:15,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:15,558 INFO L85 PathProgramCache]: Analyzing trace with hash -481022684, now seen corresponding path program 1 times [2024-10-10 22:28:15,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:15,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700674046] [2024-10-10 22:28:15,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:15,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 22:28:15,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:15,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700674046] [2024-10-10 22:28:15,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700674046] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:15,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95157244] [2024-10-10 22:28:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:15,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:15,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:15,911 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:15,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-10 22:28:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:15,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:28:15,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 22:28:16,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:16,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95157244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:16,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:28:16,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-10-10 22:28:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341202708] [2024-10-10 22:28:16,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:16,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:28:16,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:16,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:28:16,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:28:16,050 INFO L87 Difference]: Start difference. First operand 624 states and 790 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:16,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:16,103 INFO L93 Difference]: Finished difference Result 635 states and 804 transitions. [2024-10-10 22:28:16,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:28:16,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 72 [2024-10-10 22:28:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:16,105 INFO L225 Difference]: With dead ends: 635 [2024-10-10 22:28:16,105 INFO L226 Difference]: Without dead ends: 631 [2024-10-10 22:28:16,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:28:16,106 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 4 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:16,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 155 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:28:16,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-10-10 22:28:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 628. [2024-10-10 22:28:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.2695374800637957) internal successors, (796), 627 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 796 transitions. [2024-10-10 22:28:16,137 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 796 transitions. Word has length 72 [2024-10-10 22:28:16,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:16,137 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 796 transitions. [2024-10-10 22:28:16,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:16,137 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 796 transitions. [2024-10-10 22:28:16,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-10 22:28:16,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:16,138 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:16,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-10 22:28:16,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:16,343 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:16,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:16,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2025597983, now seen corresponding path program 1 times [2024-10-10 22:28:16,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:16,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254813304] [2024-10-10 22:28:16,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:16,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 67 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:28:16,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:16,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254813304] [2024-10-10 22:28:16,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254813304] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:16,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352483135] [2024-10-10 22:28:16,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:16,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:16,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:16,536 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:16,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-10 22:28:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:16,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-10 22:28:16,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 39 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:28:16,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:28:16,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352483135] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:16,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:28:16,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-10-10 22:28:16,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884395087] [2024-10-10 22:28:16,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:16,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-10 22:28:16,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:16,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-10 22:28:16,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-10-10 22:28:16,944 INFO L87 Difference]: Start difference. First operand 628 states and 796 transitions. Second operand has 17 states, 17 states have (on average 9.882352941176471) internal successors, (168), 17 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:18,149 INFO L93 Difference]: Finished difference Result 3238 states and 4045 transitions. [2024-10-10 22:28:18,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-10 22:28:18,153 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.882352941176471) internal successors, (168), 17 states have internal predecessors, (168), 0 states have call successors, (0), 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 73 [2024-10-10 22:28:18,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:18,159 INFO L225 Difference]: With dead ends: 3238 [2024-10-10 22:28:18,159 INFO L226 Difference]: Without dead ends: 3230 [2024-10-10 22:28:18,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=529, Invalid=1727, Unknown=0, NotChecked=0, Total=2256 [2024-10-10 22:28:18,163 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 752 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:18,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1000 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:28:18,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2024-10-10 22:28:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 1682. [2024-10-10 22:28:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1681 states have (on average 1.34622248661511) internal successors, (2263), 1681 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2263 transitions. [2024-10-10 22:28:18,251 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2263 transitions. Word has length 73 [2024-10-10 22:28:18,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:18,251 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 2263 transitions. [2024-10-10 22:28:18,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.882352941176471) internal successors, (168), 17 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2263 transitions. [2024-10-10 22:28:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-10 22:28:18,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:18,255 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:18,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-10 22:28:18,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:18,459 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:18,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:18,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1974029762, now seen corresponding path program 1 times [2024-10-10 22:28:18,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:18,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825128082] [2024-10-10 22:28:18,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:18,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 67 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:28:18,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:18,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825128082] [2024-10-10 22:28:18,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825128082] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:18,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922422387] [2024-10-10 22:28:18,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:18,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:18,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:18,752 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:18,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-10 22:28:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:18,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-10 22:28:18,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 22:28:19,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:19,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922422387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:19,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:28:19,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2024-10-10 22:28:19,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820120879] [2024-10-10 22:28:19,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:19,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:28:19,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:19,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:28:19,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-10 22:28:19,009 INFO L87 Difference]: Start difference. First operand 1682 states and 2263 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:19,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:19,097 INFO L93 Difference]: Finished difference Result 1699 states and 2284 transitions. [2024-10-10 22:28:19,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:28:19,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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 73 [2024-10-10 22:28:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:19,101 INFO L225 Difference]: With dead ends: 1699 [2024-10-10 22:28:19,101 INFO L226 Difference]: Without dead ends: 1695 [2024-10-10 22:28:19,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-10 22:28:19,102 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:19,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 157 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:28:19,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2024-10-10 22:28:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1690. [2024-10-10 22:28:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1689 states have (on average 1.3457667258732977) internal successors, (2273), 1689 states have internal predecessors, (2273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2273 transitions. [2024-10-10 22:28:19,170 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2273 transitions. Word has length 73 [2024-10-10 22:28:19,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:19,170 INFO L471 AbstractCegarLoop]: Abstraction has 1690 states and 2273 transitions. [2024-10-10 22:28:19,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2273 transitions. [2024-10-10 22:28:19,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-10 22:28:19,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:19,172 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:19,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-10 22:28:19,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-10 22:28:19,373 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:19,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:19,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2034588883, now seen corresponding path program 1 times [2024-10-10 22:28:19,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:19,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162551178] [2024-10-10 22:28:19,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:19,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-10 22:28:19,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:19,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162551178] [2024-10-10 22:28:19,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162551178] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:19,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159637726] [2024-10-10 22:28:19,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:19,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:19,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:19,514 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:19,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-10 22:28:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:19,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-10 22:28:19,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:19,683 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-10 22:28:19,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:19,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159637726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:19,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:28:19,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-10-10 22:28:19,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504426460] [2024-10-10 22:28:19,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:19,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 22:28:19,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:19,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 22:28:19,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:28:19,684 INFO L87 Difference]: Start difference. First operand 1690 states and 2273 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:19,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:19,853 INFO L93 Difference]: Finished difference Result 3697 states and 4960 transitions. [2024-10-10 22:28:19,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:28:19,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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 75 [2024-10-10 22:28:19,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:19,861 INFO L225 Difference]: With dead ends: 3697 [2024-10-10 22:28:19,863 INFO L226 Difference]: Without dead ends: 2830 [2024-10-10 22:28:19,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:28:19,865 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 136 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:19,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 545 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2024-10-10 22:28:19,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 1990. [2024-10-10 22:28:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1989 states have (on average 1.3353443941679235) internal successors, (2656), 1989 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:19,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2656 transitions. [2024-10-10 22:28:19,967 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2656 transitions. Word has length 75 [2024-10-10 22:28:19,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:19,967 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 2656 transitions. [2024-10-10 22:28:19,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2656 transitions. [2024-10-10 22:28:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-10 22:28:19,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:19,969 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:19,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-10 22:28:20,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:20,169 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:20,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:20,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1371539579, now seen corresponding path program 1 times [2024-10-10 22:28:20,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:20,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038563736] [2024-10-10 22:28:20,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:20,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:28:20,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-10 22:28:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:28:20,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-10 22:28:20,256 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-10 22:28:20,257 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:28:20,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-10 22:28:20,260 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:20,312 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:28:20,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:28:20 BoogieIcfgContainer [2024-10-10 22:28:20,316 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:28:20,317 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:28:20,317 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:28:20,317 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:28:20,317 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:28:02" (3/4) ... [2024-10-10 22:28:20,319 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-10 22:28:20,319 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:28:20,320 INFO L158 Benchmark]: Toolchain (without parser) took 18961.44ms. Allocated memory was 163.6MB in the beginning and 394.3MB in the end (delta: 230.7MB). Free memory was 91.4MB in the beginning and 291.8MB in the end (delta: -200.4MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2024-10-10 22:28:20,320 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory is still 113.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:28:20,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.71ms. Allocated memory is still 163.6MB. Free memory was 90.9MB in the beginning and 76.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 22:28:20,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.17ms. Allocated memory is still 163.6MB. Free memory was 76.2MB in the beginning and 73.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:28:20,323 INFO L158 Benchmark]: Boogie Preprocessor took 48.83ms. Allocated memory is still 163.6MB. Free memory was 73.1MB in the beginning and 70.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-10 22:28:20,323 INFO L158 Benchmark]: RCFGBuilder took 457.21ms. Allocated memory was 163.6MB in the beginning and 226.5MB in the end (delta: 62.9MB). Free memory was 70.4MB in the beginning and 187.3MB in the end (delta: -116.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-10 22:28:20,323 INFO L158 Benchmark]: TraceAbstraction took 18179.97ms. Allocated memory was 226.5MB in the beginning and 394.3MB in the end (delta: 167.8MB). Free memory was 187.3MB in the beginning and 291.8MB in the end (delta: -104.4MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. [2024-10-10 22:28:20,323 INFO L158 Benchmark]: Witness Printer took 2.51ms. Allocated memory is still 394.3MB. Free memory is still 291.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:28:20,324 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.13ms. Allocated memory is still 163.6MB. Free memory is still 113.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.71ms. Allocated memory is still 163.6MB. Free memory was 90.9MB in the beginning and 76.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.17ms. Allocated memory is still 163.6MB. Free memory was 76.2MB in the beginning and 73.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.83ms. Allocated memory is still 163.6MB. Free memory was 73.1MB in the beginning and 70.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 457.21ms. Allocated memory was 163.6MB in the beginning and 226.5MB in the end (delta: 62.9MB). Free memory was 70.4MB in the beginning and 187.3MB in the end (delta: -116.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18179.97ms. Allocated memory was 226.5MB in the beginning and 394.3MB in the end (delta: 167.8MB). Free memory was 187.3MB in the beginning and 291.8MB in the end (delta: -104.4MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. * Witness Printer took 2.51ms. Allocated memory is still 394.3MB. Free memory is still 291.8MB. There was no memory consumed. 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 - UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 116. Possible FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND TRUE a3 == (unsigned char)0 [L60] na = na - 1 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=3] [L61] COND TRUE a2 == (unsigned char)0 [L62] na = na - 1 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=2] [L63] COND TRUE a1 == (unsigned char)0 [L64] na = na - 1 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=1] [L68] nb = (unsigned char)4 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L89] COND TRUE i < nb VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L104] i = i + (unsigned char)1 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L83] COND FALSE !(i < na) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L89] COND TRUE i < nb VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L91] COND TRUE i == (unsigned char)1 [L91] partial_sum = partial_sum + b1 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0, r1=82] [L104] i = i + (unsigned char)1 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=82, r0=0, r1=82] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L83] COND FALSE !(i < na) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L89] COND TRUE i < nb VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L92] COND TRUE i == (unsigned char)2 [L92] partial_sum = partial_sum + b2 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=254, r0=0, r1=82, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L83] COND FALSE !(i < na) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L89] COND TRUE i < nb VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L93] COND TRUE i == (unsigned char)3 [L93] partial_sum = partial_sum + b3 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, r0=0, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, r0=0, r1=82, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, i=4, r0=0, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) VAL [a0=4294967451, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; [L129] RET, EXPR mp_add(a, b) [L129] r = mp_add(a, b) [L131] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.1s, OverallIterations: 23, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3708 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3708 mSDsluCounter, 8113 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6196 mSDsCounter, 235 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5183 IncrementalHoareTripleChecker+Invalid, 5418 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 235 mSolverCounterUnsat, 1917 mSDtfsCounter, 5183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1275 GetRequests, 977 SyntacticMatches, 5 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2471 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1990occurred in iteration=22, InterpolantAutomatonStates: 223, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 7339 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1822 NumberOfCodeBlocks, 1822 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1995 ConstructedInterpolants, 10 QuantifiedInterpolants, 14687 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1903 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 38 InterpolantComputations, 18 PerfectInterpolantSequences, 1220/2007 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-10 22:28:20,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:28:22,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:28:22,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-10 22:28:22,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:28:22,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:28:22,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:28:22,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:28:22,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:28:22,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:28:22,222 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:28:22,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:28:22,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:28:22,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:28:22,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:28:22,224 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:28:22,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:28:22,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:28:22,225 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:28:22,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:28:22,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:28:22,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:28:22,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:28:22,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:28:22,229 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-10 22:28:22,229 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-10 22:28:22,229 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:28:22,229 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-10 22:28:22,229 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:28:22,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:28:22,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:28:22,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:28:22,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:28:22,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:28:22,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:28:22,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:28:22,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:28:22,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:28:22,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:28:22,231 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-10 22:28:22,232 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-10 22:28:22,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:28:22,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:28:22,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:28:22,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:28:22,233 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-10 22:28:22,233 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2024-10-10 22:28:22,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:28:22,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:28:22,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:28:22,477 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:28:22,478 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:28:22,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2024-10-10 22:28:23,714 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:28:23,857 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:28:23,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2024-10-10 22:28:23,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e778d4bc/dc3d6650d93b4e33a59d78bc145951be/FLAG1a20eca5f [2024-10-10 22:28:23,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e778d4bc/dc3d6650d93b4e33a59d78bc145951be [2024-10-10 22:28:23,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:28:23,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:28:23,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:28:23,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:28:23,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:28:23,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:28:23" (1/1) ... [2024-10-10 22:28:23,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1624a5c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:23, skipping insertion in model container [2024-10-10 22:28:23,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:28:23" (1/1) ... [2024-10-10 22:28:23,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:28:24,081 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2024-10-10 22:28:24,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:28:24,137 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:28:24,150 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2024-10-10 22:28:24,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:28:24,188 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:28:24,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:24 WrapperNode [2024-10-10 22:28:24,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:28:24,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:28:24,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:28:24,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:28:24,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:24" (1/1) ... [2024-10-10 22:28:24,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:24" (1/1) ... [2024-10-10 22:28:24,227 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2024-10-10 22:28:24,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:28:24,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:28:24,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:28:24,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:28:24,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:24" (1/1) ... [2024-10-10 22:28:24,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:24" (1/1) ... [2024-10-10 22:28:24,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:24" (1/1) ... [2024-10-10 22:28:24,248 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:28:24,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:24" (1/1) ... [2024-10-10 22:28:24,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:24" (1/1) ... [2024-10-10 22:28:24,252 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:24" (1/1) ... [2024-10-10 22:28:24,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:24" (1/1) ... [2024-10-10 22:28:24,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:24" (1/1) ... [2024-10-10 22:28:24,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:24" (1/1) ... [2024-10-10 22:28:24,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:28:24,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:28:24,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:28:24,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:28:24,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:24" (1/1) ... [2024-10-10 22:28:24,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:28:24,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:24,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:28:24,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:28:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:28:24,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-10 22:28:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:28:24,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:28:24,392 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:28:24,393 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:28:24,652 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-10 22:28:24,652 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:28:24,697 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:28:24,697 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-10 22:28:24,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:28:24 BoogieIcfgContainer [2024-10-10 22:28:24,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:28:24,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:28:24,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:28:24,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:28:24,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:28:23" (1/3) ... [2024-10-10 22:28:24,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20de8578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:28:24, skipping insertion in model container [2024-10-10 22:28:24,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:24" (2/3) ... [2024-10-10 22:28:24,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20de8578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:28:24, skipping insertion in model container [2024-10-10 22:28:24,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:28:24" (3/3) ... [2024-10-10 22:28:24,705 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2024-10-10 22:28:24,719 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:28:24,720 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:28:24,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:28:24,776 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;@4607f5f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:28:24,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:28:24,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-10 22:28:24,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:24,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:24,788 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:24,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:24,792 INFO L85 PathProgramCache]: Analyzing trace with hash 459643034, now seen corresponding path program 1 times [2024-10-10 22:28:24,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:24,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200834016] [2024-10-10 22:28:24,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:24,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:24,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:24,806 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:28:24,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-10 22:28:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:24,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-10 22:28:24,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:24,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:24,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:24,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200834016] [2024-10-10 22:28:24,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200834016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:24,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:24,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:28:24,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957179676] [2024-10-10 22:28:24,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:24,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:28:24,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:24,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:28:24,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:28:24,907 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:24,932 INFO L93 Difference]: Finished difference Result 50 states and 85 transitions. [2024-10-10 22:28:24,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:28:24,934 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-10-10 22:28:24,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:24,940 INFO L225 Difference]: With dead ends: 50 [2024-10-10 22:28:24,941 INFO L226 Difference]: Without dead ends: 36 [2024-10-10 22:28:24,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:28:24,947 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:24,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:28:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-10 22:28:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-10 22:28:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 62 transitions. [2024-10-10 22:28:24,976 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 62 transitions. Word has length 10 [2024-10-10 22:28:24,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:24,977 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 62 transitions. [2024-10-10 22:28:24,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:24,977 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2024-10-10 22:28:24,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-10 22:28:24,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:24,979 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:24,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-10 22:28:25,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:25,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:25,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:25,183 INFO L85 PathProgramCache]: Analyzing trace with hash 371044600, now seen corresponding path program 1 times [2024-10-10 22:28:25,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:25,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832623640] [2024-10-10 22:28:25,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:25,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:25,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:25,187 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:28:25,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-10 22:28:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:25,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:28:25,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:25,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:25,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:25,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832623640] [2024-10-10 22:28:25,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832623640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:25,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:25,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:28:25,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531542735] [2024-10-10 22:28:25,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:25,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:28:25,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:25,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:28:25,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:28:25,277 INFO L87 Difference]: Start difference. First operand 36 states and 62 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:25,434 INFO L93 Difference]: Finished difference Result 98 states and 176 transitions. [2024-10-10 22:28:25,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:28:25,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-10-10 22:28:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:25,436 INFO L225 Difference]: With dead ends: 98 [2024-10-10 22:28:25,436 INFO L226 Difference]: Without dead ends: 71 [2024-10-10 22:28:25,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:28:25,437 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 48 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:25,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 127 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-10 22:28:25,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-10-10 22:28:25,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.6521739130434783) internal successors, (114), 69 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:25,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 114 transitions. [2024-10-10 22:28:25,449 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 114 transitions. Word has length 10 [2024-10-10 22:28:25,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:25,449 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 114 transitions. [2024-10-10 22:28:25,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 114 transitions. [2024-10-10 22:28:25,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-10 22:28:25,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:25,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:25,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-10 22:28:25,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:25,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:25,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:25,651 INFO L85 PathProgramCache]: Analyzing trace with hash -450690481, now seen corresponding path program 1 times [2024-10-10 22:28:25,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:25,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010918583] [2024-10-10 22:28:25,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:25,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:25,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:25,654 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:28:25,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-10 22:28:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:25,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:28:25,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:25,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:25,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:25,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:25,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010918583] [2024-10-10 22:28:25,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010918583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:25,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:25,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:28:25,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769606173] [2024-10-10 22:28:25,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:25,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:28:25,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:25,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:28:25,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:28:25,728 INFO L87 Difference]: Start difference. First operand 70 states and 114 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:25,744 INFO L93 Difference]: Finished difference Result 80 states and 128 transitions. [2024-10-10 22:28:25,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:28:25,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-10-10 22:28:25,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:25,746 INFO L225 Difference]: With dead ends: 80 [2024-10-10 22:28:25,746 INFO L226 Difference]: Without dead ends: 50 [2024-10-10 22:28:25,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:28:25,747 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 51 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:25,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 55 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:28:25,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-10 22:28:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-10 22:28:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.530612244897959) internal successors, (75), 49 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 75 transitions. [2024-10-10 22:28:25,751 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 75 transitions. Word has length 11 [2024-10-10 22:28:25,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:25,751 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 75 transitions. [2024-10-10 22:28:25,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 75 transitions. [2024-10-10 22:28:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-10 22:28:25,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:25,752 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] [2024-10-10 22:28:25,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-10 22:28:25,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:25,955 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:25,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:25,956 INFO L85 PathProgramCache]: Analyzing trace with hash -171126915, now seen corresponding path program 1 times [2024-10-10 22:28:25,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:25,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690248390] [2024-10-10 22:28:25,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:25,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:25,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:25,958 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:28:25,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-10 22:28:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:25,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:28:25,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:26,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:26,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:26,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690248390] [2024-10-10 22:28:26,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690248390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:26,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:26,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:28:26,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006596651] [2024-10-10 22:28:26,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:26,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:28:26,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:26,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:28:26,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:28:26,021 INFO L87 Difference]: Start difference. First operand 50 states and 75 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:26,162 INFO L93 Difference]: Finished difference Result 140 states and 215 transitions. [2024-10-10 22:28:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:28:26,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-10 22:28:26,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:26,163 INFO L225 Difference]: With dead ends: 140 [2024-10-10 22:28:26,163 INFO L226 Difference]: Without dead ends: 98 [2024-10-10 22:28:26,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:28:26,164 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 42 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:26,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 133 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:26,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-10 22:28:26,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-10-10 22:28:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4838709677419355) internal successors, (138), 93 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 138 transitions. [2024-10-10 22:28:26,175 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 138 transitions. Word has length 23 [2024-10-10 22:28:26,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:26,175 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 138 transitions. [2024-10-10 22:28:26,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:26,176 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 138 transitions. [2024-10-10 22:28:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-10 22:28:26,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:26,176 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] [2024-10-10 22:28:26,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-10 22:28:26,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:26,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:26,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:26,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1205485431, now seen corresponding path program 1 times [2024-10-10 22:28:26,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:26,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955075975] [2024-10-10 22:28:26,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:26,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:26,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:26,379 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:28:26,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-10 22:28:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:26,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:28:26,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:26,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:26,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:26,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:26,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955075975] [2024-10-10 22:28:26,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955075975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:26,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:26,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:28:26,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431371827] [2024-10-10 22:28:26,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:26,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:28:26,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:26,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:28:26,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:28:26,447 INFO L87 Difference]: Start difference. First operand 94 states and 138 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:26,535 INFO L93 Difference]: Finished difference Result 171 states and 254 transitions. [2024-10-10 22:28:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:28:26,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-10-10 22:28:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:26,536 INFO L225 Difference]: With dead ends: 171 [2024-10-10 22:28:26,537 INFO L226 Difference]: Without dead ends: 131 [2024-10-10 22:28:26,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:28:26,538 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 101 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:26,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 229 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:26,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-10 22:28:26,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 99. [2024-10-10 22:28:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 98 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 143 transitions. [2024-10-10 22:28:26,547 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 143 transitions. Word has length 24 [2024-10-10 22:28:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:26,548 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 143 transitions. [2024-10-10 22:28:26,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 143 transitions. [2024-10-10 22:28:26,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-10 22:28:26,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:26,551 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] [2024-10-10 22:28:26,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-10 22:28:26,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:26,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:26,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:26,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1409794344, now seen corresponding path program 1 times [2024-10-10 22:28:26,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:26,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129611405] [2024-10-10 22:28:26,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:26,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:26,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:26,754 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:28:26,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-10 22:28:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:26,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:28:26,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:26,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:26,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:26,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129611405] [2024-10-10 22:28:26,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129611405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:26,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:26,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:28:26,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341251386] [2024-10-10 22:28:26,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:26,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 22:28:26,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:26,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 22:28:26,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:28:26,816 INFO L87 Difference]: Start difference. First operand 99 states and 143 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:26,921 INFO L93 Difference]: Finished difference Result 204 states and 301 transitions. [2024-10-10 22:28:26,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:28:26,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-10 22:28:26,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:26,922 INFO L225 Difference]: With dead ends: 204 [2024-10-10 22:28:26,923 INFO L226 Difference]: Without dead ends: 164 [2024-10-10 22:28:26,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:28:26,923 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 165 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:26,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 521 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-10 22:28:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 131. [2024-10-10 22:28:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4461538461538461) internal successors, (188), 130 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2024-10-10 22:28:26,938 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 25 [2024-10-10 22:28:26,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:26,938 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2024-10-10 22:28:26,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2024-10-10 22:28:26,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-10 22:28:26,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:26,940 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] [2024-10-10 22:28:26,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-10 22:28:27,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:27,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:27,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:27,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1628649062, now seen corresponding path program 1 times [2024-10-10 22:28:27,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:27,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805961302] [2024-10-10 22:28:27,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:27,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:27,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:27,144 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:28:27,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-10 22:28:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:27,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:28:27,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:27,204 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:27,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:27,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805961302] [2024-10-10 22:28:27,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805961302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:27,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:27,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:28:27,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589034755] [2024-10-10 22:28:27,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:27,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:28:27,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:27,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:28:27,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:28:27,205 INFO L87 Difference]: Start difference. First operand 131 states and 188 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:27,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:27,359 INFO L93 Difference]: Finished difference Result 203 states and 298 transitions. [2024-10-10 22:28:27,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:28:27,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-10 22:28:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:27,360 INFO L225 Difference]: With dead ends: 203 [2024-10-10 22:28:27,360 INFO L226 Difference]: Without dead ends: 163 [2024-10-10 22:28:27,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:28:27,362 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 118 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:27,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 330 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-10 22:28:27,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 126. [2024-10-10 22:28:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.456) internal successors, (182), 125 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2024-10-10 22:28:27,371 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 182 transitions. Word has length 25 [2024-10-10 22:28:27,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:27,371 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 182 transitions. [2024-10-10 22:28:27,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:27,372 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 182 transitions. [2024-10-10 22:28:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-10 22:28:27,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:27,373 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] [2024-10-10 22:28:27,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-10 22:28:27,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:27,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:27,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:27,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1173091825, now seen corresponding path program 1 times [2024-10-10 22:28:27,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:27,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741610403] [2024-10-10 22:28:27,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:27,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:27,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:27,576 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:28:27,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-10 22:28:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:27,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:28:27,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:27,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:27,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:27,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741610403] [2024-10-10 22:28:27,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741610403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:27,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:27,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:28:27,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067594243] [2024-10-10 22:28:27,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:27,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:28:27,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:27,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:28:27,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:28:27,622 INFO L87 Difference]: Start difference. First operand 126 states and 182 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:27,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:27,633 INFO L93 Difference]: Finished difference Result 168 states and 243 transitions. [2024-10-10 22:28:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:28:27,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-10 22:28:27,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:27,635 INFO L225 Difference]: With dead ends: 168 [2024-10-10 22:28:27,635 INFO L226 Difference]: Without dead ends: 157 [2024-10-10 22:28:27,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:28:27,636 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:27,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 106 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:28:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-10 22:28:27,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-10-10 22:28:27,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.4423076923076923) internal successors, (225), 156 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:27,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 225 transitions. [2024-10-10 22:28:27,650 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 225 transitions. Word has length 27 [2024-10-10 22:28:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:27,650 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 225 transitions. [2024-10-10 22:28:27,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 225 transitions. [2024-10-10 22:28:27,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-10 22:28:27,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:27,651 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] [2024-10-10 22:28:27,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-10 22:28:27,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:27,854 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:27,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:27,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1874156403, now seen corresponding path program 1 times [2024-10-10 22:28:27,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:27,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361082847] [2024-10-10 22:28:27,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:27,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:27,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:27,857 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:28:27,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-10 22:28:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:27,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:28:27,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:27,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:27,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:27,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361082847] [2024-10-10 22:28:27,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361082847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:27,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:27,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:28:27,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376617600] [2024-10-10 22:28:27,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:27,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:28:27,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:27,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:28:27,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:28:27,960 INFO L87 Difference]: Start difference. First operand 157 states and 225 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:28,057 INFO L93 Difference]: Finished difference Result 375 states and 565 transitions. [2024-10-10 22:28:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:28:28,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-10 22:28:28,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:28,059 INFO L225 Difference]: With dead ends: 375 [2024-10-10 22:28:28,059 INFO L226 Difference]: Without dead ends: 235 [2024-10-10 22:28:28,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:28:28,059 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 48 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:28,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 73 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-10 22:28:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 206. [2024-10-10 22:28:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.3560975609756099) internal successors, (278), 205 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-10-10 22:28:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 278 transitions. [2024-10-10 22:28:28,073 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 278 transitions. Word has length 27 [2024-10-10 22:28:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:28,074 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 278 transitions. [2024-10-10 22:28:28,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 278 transitions. [2024-10-10 22:28:28,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-10 22:28:28,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:28,075 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:28,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-10 22:28:28,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:28,275 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:28,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:28,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2045384044, now seen corresponding path program 1 times [2024-10-10 22:28:28,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:28,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480171008] [2024-10-10 22:28:28,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:28,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:28,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:28,279 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:28:28,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-10 22:28:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:28,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:28:28,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:28,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:28,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:28,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480171008] [2024-10-10 22:28:28,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480171008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:28,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:28,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:28:28,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824867116] [2024-10-10 22:28:28,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:28,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:28:28,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:28,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:28:28,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:28:28,395 INFO L87 Difference]: Start difference. First operand 206 states and 278 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:28,556 INFO L93 Difference]: Finished difference Result 338 states and 460 transitions. [2024-10-10 22:28:28,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:28:28,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-10-10 22:28:28,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:28,557 INFO L225 Difference]: With dead ends: 338 [2024-10-10 22:28:28,557 INFO L226 Difference]: Without dead ends: 271 [2024-10-10 22:28:28,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:28:28,558 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 82 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:28,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 200 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-10 22:28:28,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2024-10-10 22:28:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.3544776119402986) internal successors, (363), 268 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 363 transitions. [2024-10-10 22:28:28,568 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 363 transitions. Word has length 41 [2024-10-10 22:28:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:28,568 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 363 transitions. [2024-10-10 22:28:28,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 363 transitions. [2024-10-10 22:28:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 22:28:28,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:28,569 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:28,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-10 22:28:28,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:28,774 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:28,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:28,775 INFO L85 PathProgramCache]: Analyzing trace with hash 422317019, now seen corresponding path program 1 times [2024-10-10 22:28:28,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:28,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835342054] [2024-10-10 22:28:28,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:28,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:28,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:28,777 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:28:28,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-10 22:28:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:28,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:28:28,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:28,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:28,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:28,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835342054] [2024-10-10 22:28:28,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835342054] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:28,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:28:28,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-10 22:28:28,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813454647] [2024-10-10 22:28:28,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:28,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:28:28,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:28,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:28:28,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:28:28,983 INFO L87 Difference]: Start difference. First operand 269 states and 363 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:29,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:29,215 INFO L93 Difference]: Finished difference Result 836 states and 1267 transitions. [2024-10-10 22:28:29,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:28:29,216 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-10 22:28:29,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:29,218 INFO L225 Difference]: With dead ends: 836 [2024-10-10 22:28:29,218 INFO L226 Difference]: Without dead ends: 579 [2024-10-10 22:28:29,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:28:29,218 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 184 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:29,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 88 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:29,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-10-10 22:28:29,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 468. [2024-10-10 22:28:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 1.4389721627408993) internal successors, (672), 467 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 672 transitions. [2024-10-10 22:28:29,232 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 672 transitions. Word has length 42 [2024-10-10 22:28:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:29,232 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 672 transitions. [2024-10-10 22:28:29,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 672 transitions. [2024-10-10 22:28:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-10 22:28:29,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:29,233 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:29,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-10 22:28:29,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:29,436 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:29,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:29,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1621079493, now seen corresponding path program 1 times [2024-10-10 22:28:29,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:29,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345280320] [2024-10-10 22:28:29,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:29,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:29,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:29,438 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:28:29,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-10 22:28:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:29,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:28:29,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:29,535 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 22:28:29,535 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 22:28:29,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:29,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345280320] [2024-10-10 22:28:29,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345280320] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:29,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:28:29,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-10 22:28:29,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394504883] [2024-10-10 22:28:29,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:29,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:28:29,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:29,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:28:29,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:28:29,603 INFO L87 Difference]: Start difference. First operand 468 states and 672 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:29,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:29,840 INFO L93 Difference]: Finished difference Result 1460 states and 2059 transitions. [2024-10-10 22:28:29,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-10 22:28:29,841 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 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 68 [2024-10-10 22:28:29,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:29,844 INFO L225 Difference]: With dead ends: 1460 [2024-10-10 22:28:29,844 INFO L226 Difference]: Without dead ends: 1019 [2024-10-10 22:28:29,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-10-10 22:28:29,845 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 243 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:29,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 325 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2024-10-10 22:28:29,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 633. [2024-10-10 22:28:29,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.4588607594936709) internal successors, (922), 632 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 922 transitions. [2024-10-10 22:28:29,867 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 922 transitions. Word has length 68 [2024-10-10 22:28:29,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:29,867 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 922 transitions. [2024-10-10 22:28:29,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:29,867 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 922 transitions. [2024-10-10 22:28:29,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-10 22:28:29,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:29,868 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:29,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-10 22:28:30,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:30,071 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:30,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:30,071 INFO L85 PathProgramCache]: Analyzing trace with hash -961547971, now seen corresponding path program 2 times [2024-10-10 22:28:30,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:30,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375455574] [2024-10-10 22:28:30,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:28:30,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:30,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:30,072 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:28:30,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-10 22:28:30,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:28:30,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:28:30,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:28:30,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-10 22:28:30,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-10 22:28:30,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:30,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375455574] [2024-10-10 22:28:30,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375455574] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:30,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:28:30,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-10 22:28:30,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049189915] [2024-10-10 22:28:30,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:30,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 22:28:30,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:30,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 22:28:30,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:28:30,305 INFO L87 Difference]: Start difference. First operand 633 states and 922 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:30,507 INFO L93 Difference]: Finished difference Result 1609 states and 2252 transitions. [2024-10-10 22:28:30,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-10 22:28:30,507 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 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 68 [2024-10-10 22:28:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:30,511 INFO L225 Difference]: With dead ends: 1609 [2024-10-10 22:28:30,511 INFO L226 Difference]: Without dead ends: 1003 [2024-10-10 22:28:30,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2024-10-10 22:28:30,526 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 206 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:30,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 324 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:30,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2024-10-10 22:28:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 628. [2024-10-10 22:28:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.4194577352472089) internal successors, (890), 627 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 890 transitions. [2024-10-10 22:28:30,549 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 890 transitions. Word has length 68 [2024-10-10 22:28:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:30,549 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 890 transitions. [2024-10-10 22:28:30,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 890 transitions. [2024-10-10 22:28:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-10 22:28:30,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:30,551 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:30,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-10 22:28:30,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:30,753 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:30,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:30,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1095561477, now seen corresponding path program 3 times [2024-10-10 22:28:30,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:30,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371712937] [2024-10-10 22:28:30,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 22:28:30,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:30,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:30,755 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:28:30,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-10 22:28:30,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-10 22:28:30,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:28:30,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-10 22:28:30,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:33,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:34,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:34,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371712937] [2024-10-10 22:28:34,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371712937] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:34,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:28:34,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2024-10-10 22:28:34,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141323207] [2024-10-10 22:28:34,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:34,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-10 22:28:34,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:34,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-10 22:28:34,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1663, Unknown=0, NotChecked=0, Total=1806 [2024-10-10 22:28:34,640 INFO L87 Difference]: Start difference. First operand 628 states and 890 transitions. Second operand has 43 states, 43 states have (on average 3.13953488372093) internal successors, (135), 42 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:44,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:44,291 INFO L93 Difference]: Finished difference Result 1449 states and 1981 transitions. [2024-10-10 22:28:44,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-10-10 22:28:44,291 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.13953488372093) internal successors, (135), 42 states have internal predecessors, (135), 0 states have call successors, (0), 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 68 [2024-10-10 22:28:44,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:44,299 INFO L225 Difference]: With dead ends: 1449 [2024-10-10 22:28:44,299 INFO L226 Difference]: Without dead ends: 1353 [2024-10-10 22:28:44,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3144 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=2449, Invalid=12557, Unknown=0, NotChecked=0, Total=15006 [2024-10-10 22:28:44,302 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 1657 mSDsluCounter, 5595 mSDsCounter, 0 mSdLazyCounter, 3518 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1657 SdHoareTripleChecker+Valid, 5902 SdHoareTripleChecker+Invalid, 3637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 3518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:44,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1657 Valid, 5902 Invalid, 3637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 3518 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 22:28:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-10-10 22:28:44,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 899. [2024-10-10 22:28:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 898 states have (on average 1.4265033407572383) internal successors, (1281), 898 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1281 transitions. [2024-10-10 22:28:44,344 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1281 transitions. Word has length 68 [2024-10-10 22:28:44,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:44,344 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1281 transitions. [2024-10-10 22:28:44,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.13953488372093) internal successors, (135), 42 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:44,344 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1281 transitions. [2024-10-10 22:28:44,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-10 22:28:44,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:44,345 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:44,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-10 22:28:44,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:44,548 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:44,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1513225981, now seen corresponding path program 1 times [2024-10-10 22:28:44,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:44,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913028261] [2024-10-10 22:28:44,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:44,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:44,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:44,551 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:28:44,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-10 22:28:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:44,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:28:44,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-10 22:28:44,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:44,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:44,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913028261] [2024-10-10 22:28:44,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913028261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:44,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:44,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:28:44,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130644184] [2024-10-10 22:28:44,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:44,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 22:28:44,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:44,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 22:28:44,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:28:44,644 INFO L87 Difference]: Start difference. First operand 899 states and 1281 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:44,772 INFO L93 Difference]: Finished difference Result 1076 states and 1540 transitions. [2024-10-10 22:28:44,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:28:44,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-10 22:28:44,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:44,775 INFO L225 Difference]: With dead ends: 1076 [2024-10-10 22:28:44,775 INFO L226 Difference]: Without dead ends: 898 [2024-10-10 22:28:44,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:28:44,776 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 134 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:44,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 343 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-10-10 22:28:44,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 725. [2024-10-10 22:28:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.421270718232044) internal successors, (1029), 724 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1029 transitions. [2024-10-10 22:28:44,817 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1029 transitions. Word has length 68 [2024-10-10 22:28:44,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:44,818 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1029 transitions. [2024-10-10 22:28:44,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1029 transitions. [2024-10-10 22:28:44,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-10 22:28:44,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:44,819 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:44,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-10 22:28:45,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:45,019 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:45,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:45,020 INFO L85 PathProgramCache]: Analyzing trace with hash -968924294, now seen corresponding path program 1 times [2024-10-10 22:28:45,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:45,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418073859] [2024-10-10 22:28:45,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:45,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:45,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:45,023 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:28:45,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-10 22:28:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:45,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:28:45,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:28:45,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:28:45,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:45,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418073859] [2024-10-10 22:28:45,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418073859] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:45,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:28:45,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-10 22:28:45,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304820293] [2024-10-10 22:28:45,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:45,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-10 22:28:45,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:45,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-10 22:28:45,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:28:45,217 INFO L87 Difference]: Start difference. First operand 725 states and 1029 transitions. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:45,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:45,738 INFO L93 Difference]: Finished difference Result 1620 states and 2333 transitions. [2024-10-10 22:28:45,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-10 22:28:45,738 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 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 71 [2024-10-10 22:28:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:45,741 INFO L225 Difference]: With dead ends: 1620 [2024-10-10 22:28:45,741 INFO L226 Difference]: Without dead ends: 1268 [2024-10-10 22:28:45,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2024-10-10 22:28:45,743 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 370 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:45,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 264 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:28:45,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2024-10-10 22:28:45,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1158. [2024-10-10 22:28:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 1.4243733794295592) internal successors, (1648), 1157 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:45,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1648 transitions. [2024-10-10 22:28:45,799 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1648 transitions. Word has length 71 [2024-10-10 22:28:45,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:45,800 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1648 transitions. [2024-10-10 22:28:45,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:28:45,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1648 transitions. [2024-10-10 22:28:45,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-10 22:28:45,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:45,801 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:45,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-10 22:28:46,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:46,002 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:46,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:46,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1581200213, now seen corresponding path program 1 times [2024-10-10 22:28:46,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:46,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540839499] [2024-10-10 22:28:46,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:46,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:28:46,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:46,003 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:28:46,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-10 22:28:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:46,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-10 22:28:46,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:48,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:49,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:49,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540839499] [2024-10-10 22:28:49,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540839499] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:49,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:28:49,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2024-10-10 22:28:49,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810196774] [2024-10-10 22:28:49,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:49,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-10 22:28:49,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:49,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-10 22:28:49,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1748, Unknown=0, NotChecked=0, Total=1892 [2024-10-10 22:28:49,960 INFO L87 Difference]: Start difference. First operand 1158 states and 1648 transitions. Second operand has 44 states, 44 states have (on average 3.25) internal successors, (143), 43 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:22,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:22,256 INFO L93 Difference]: Finished difference Result 6905 states and 9378 transitions. [2024-10-10 22:29:22,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2024-10-10 22:29:22,257 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.25) internal successors, (143), 43 states have internal predecessors, (143), 0 states have call successors, (0), 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 72 [2024-10-10 22:29:22,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:22,271 INFO L225 Difference]: With dead ends: 6905 [2024-10-10 22:29:22,271 INFO L226 Difference]: Without dead ends: 6446 [2024-10-10 22:29:22,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18237 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=7203, Invalid=50157, Unknown=0, NotChecked=0, Total=57360 [2024-10-10 22:29:22,281 INFO L432 NwaCegarLoop]: 618 mSDtfsCounter, 2046 mSDsluCounter, 13239 mSDsCounter, 0 mSdLazyCounter, 8898 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2046 SdHoareTripleChecker+Valid, 13857 SdHoareTripleChecker+Invalid, 9259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 8898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:22,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2046 Valid, 13857 Invalid, 9259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 8898 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-10-10 22:29:22,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6446 states. [2024-10-10 22:29:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6446 to 3786. [2024-10-10 22:29:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3786 states, 3785 states have (on average 1.4340819022457068) internal successors, (5428), 3785 states have internal predecessors, (5428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3786 states to 3786 states and 5428 transitions. [2024-10-10 22:29:22,520 INFO L78 Accepts]: Start accepts. Automaton has 3786 states and 5428 transitions. Word has length 72 [2024-10-10 22:29:22,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:22,520 INFO L471 AbstractCegarLoop]: Abstraction has 3786 states and 5428 transitions. [2024-10-10 22:29:22,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.25) internal successors, (143), 43 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 5428 transitions. [2024-10-10 22:29:22,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-10 22:29:22,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:22,523 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:22,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-10 22:29:22,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:29:22,724 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:22,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:22,724 INFO L85 PathProgramCache]: Analyzing trace with hash -45649685, now seen corresponding path program 1 times [2024-10-10 22:29:22,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:29:22,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365460964] [2024-10-10 22:29:22,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:22,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:29:22,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:29:22,726 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:29:22,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-10 22:29:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:22,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-10 22:29:22,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:29:24,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:29:26,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:29:26,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365460964] [2024-10-10 22:29:26,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365460964] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:26,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:29:26,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2024-10-10 22:29:26,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917785293] [2024-10-10 22:29:26,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:26,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-10 22:29:26,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:29:26,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-10 22:29:26,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1760, Unknown=0, NotChecked=0, Total=1892 [2024-10-10 22:29:26,576 INFO L87 Difference]: Start difference. First operand 3786 states and 5428 transitions. Second operand has 44 states, 44 states have (on average 3.25) internal successors, (143), 43 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)