./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.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 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:30:55,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:30:55,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:30:55,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:30:55,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:30:55,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:30:55,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:30:55,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:30:55,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:30:55,677 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:30:55,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:30:55,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:30:55,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:30:55,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:30:55,681 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:30:55,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:30:55,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:30:55,682 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:30:55,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:30:55,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:30:55,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:30:55,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:30:55,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:30:55,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:30:55,688 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:30:55,688 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:30:55,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:30:55,688 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:30:55,689 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:30:55,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:30:55,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:30:55,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:30:55,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:30:55,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:30:55,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:30:55,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:30:55,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:30:55,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:30:55,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:30:55,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:30:55,693 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:30:55,693 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:30:55,694 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 -> 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 [2024-10-11 11:30:55,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:30:55,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:30:56,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:30:56,001 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:30:56,003 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:30:56,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-10-11 11:30:57,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:30:57,735 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:30:57,736 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-10-11 11:30:57,747 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4bd1bb67c/f98e7879acf248cb86a96df21c2adec0/FLAG33a4e04c4 [2024-10-11 11:30:58,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4bd1bb67c/f98e7879acf248cb86a96df21c2adec0 [2024-10-11 11:30:58,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:30:58,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:30:58,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:30:58,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:30:58,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:30:58,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:30:58" (1/1) ... [2024-10-11 11:30:58,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3302de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:30:58, skipping insertion in model container [2024-10-11 11:30:58,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:30:58" (1/1) ... [2024-10-11 11:30:58,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:30:58,379 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i[915,928] [2024-10-11 11:30:58,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:30:58,433 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:30:58,445 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i[915,928] [2024-10-11 11:30:58,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:30:58,482 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:30:58,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:30:58 WrapperNode [2024-10-11 11:30:58,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:30:58,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:30:58,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:30:58,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:30:58,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:30:58" (1/1) ... [2024-10-11 11:30:58,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:30:58" (1/1) ... [2024-10-11 11:30:58,548 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2024-10-11 11:30:58,549 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:30:58,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:30:58,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:30:58,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:30:58,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:30:58" (1/1) ... [2024-10-11 11:30:58,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:30:58" (1/1) ... [2024-10-11 11:30:58,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:30:58" (1/1) ... [2024-10-11 11:30:58,603 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-11 11:30:58,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:30:58" (1/1) ... [2024-10-11 11:30:58,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:30:58" (1/1) ... [2024-10-11 11:30:58,613 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:30:58" (1/1) ... [2024-10-11 11:30:58,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:30:58" (1/1) ... [2024-10-11 11:30:58,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:30:58" (1/1) ... [2024-10-11 11:30:58,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:30:58" (1/1) ... [2024-10-11 11:30:58,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:30:58,642 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:30:58,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:30:58,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:30:58,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:30:58" (1/1) ... [2024-10-11 11:30:58,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:30:58,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:30:58,681 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-11 11:30:58,687 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-11 11:30:58,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:30:58,731 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:30:58,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:30:58,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:30:58,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:30:58,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:30:58,806 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:30:58,809 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:30:59,158 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-11 11:30:59,158 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:30:59,219 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:30:59,221 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:30:59,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:30:59 BoogieIcfgContainer [2024-10-11 11:30:59,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:30:59,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:30:59,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:30:59,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:30:59,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:30:58" (1/3) ... [2024-10-11 11:30:59,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e03423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:30:59, skipping insertion in model container [2024-10-11 11:30:59,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:30:58" (2/3) ... [2024-10-11 11:30:59,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e03423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:30:59, skipping insertion in model container [2024-10-11 11:30:59,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:30:59" (3/3) ... [2024-10-11 11:30:59,230 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-10-11 11:30:59,245 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:30:59,245 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:30:59,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:30:59,312 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;@4951988b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:30:59,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:30:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:30:59,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 11:30:59,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:30:59,332 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:30:59,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:30:59,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:30:59,337 INFO L85 PathProgramCache]: Analyzing trace with hash 832394492, now seen corresponding path program 1 times [2024-10-11 11:30:59,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:30:59,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805787729] [2024-10-11 11:30:59,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:30:59,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:30:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:59,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:30:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:59,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:30:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:59,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:30:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:59,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:30:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:59,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:30:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:59,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:30:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:59,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:30:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:59,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:30:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:59,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:30:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:59,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:30:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:59,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:30:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:59,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:30:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:59,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:30:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:30:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:30:59,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:30:59,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805787729] [2024-10-11 11:30:59,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805787729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:30:59,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:30:59,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:30:59,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706190122] [2024-10-11 11:30:59,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:30:59,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:30:59,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:30:59,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:30:59,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:30:59,740 INFO L87 Difference]: Start difference. First operand has 53 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 11:30:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:30:59,809 INFO L93 Difference]: Finished difference Result 105 states and 170 transitions. [2024-10-11 11:30:59,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:30:59,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2024-10-11 11:30:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:30:59,831 INFO L225 Difference]: With dead ends: 105 [2024-10-11 11:30:59,831 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 11:30:59,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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-11 11:30:59,839 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 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-11 11:30:59,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:30:59,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 11:30:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-11 11:30:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:30:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2024-10-11 11:30:59,877 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 86 [2024-10-11 11:30:59,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:30:59,877 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2024-10-11 11:30:59,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 11:30:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2024-10-11 11:30:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 11:30:59,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:30:59,882 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:30:59,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:30:59,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:30:59,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:30:59,883 INFO L85 PathProgramCache]: Analyzing trace with hash 269871290, now seen corresponding path program 1 times [2024-10-11 11:30:59,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:30:59,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847124148] [2024-10-11 11:30:59,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:30:59,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:30:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:02,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:31:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:02,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:31:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:02,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:31:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:02,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:31:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:02,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:31:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:02,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:31:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:02,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:31:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:02,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:31:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:02,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:31:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:02,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:31:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:02,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:31:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:02,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:31:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:02,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:31:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:31:02,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:31:02,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847124148] [2024-10-11 11:31:02,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847124148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:31:02,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:31:02,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 11:31:02,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538721960] [2024-10-11 11:31:02,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:31:02,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 11:31:02,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:31:02,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 11:31:02,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:31:02,786 INFO L87 Difference]: Start difference. First operand 51 states and 74 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:31:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:31:03,517 INFO L93 Difference]: Finished difference Result 185 states and 261 transitions. [2024-10-11 11:31:03,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:31:03,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2024-10-11 11:31:03,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:31:03,520 INFO L225 Difference]: With dead ends: 185 [2024-10-11 11:31:03,520 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 11:31:03,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:31:03,522 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 219 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:31:03,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 153 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 11:31:03,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 11:31:03,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 59. [2024-10-11 11:31:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:31:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-10-11 11:31:03,538 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 86 [2024-10-11 11:31:03,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:31:03,539 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-10-11 11:31:03,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:31:03,541 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-10-11 11:31:03,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 11:31:03,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:31:03,545 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:31:03,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:31:03,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:31:03,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:31:03,546 INFO L85 PathProgramCache]: Analyzing trace with hash 212612988, now seen corresponding path program 1 times [2024-10-11 11:31:03,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:31:03,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126681679] [2024-10-11 11:31:03,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:31:03,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:31:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:04,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:31:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:04,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:31:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:04,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:31:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:04,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:31:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:04,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:31:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:04,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:31:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:04,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:31:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:04,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:31:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:04,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:31:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:04,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:31:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:04,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:31:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:04,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:31:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:04,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:31:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:04,831 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:31:04,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:31:04,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126681679] [2024-10-11 11:31:04,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126681679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:31:04,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:31:04,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:31:04,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477519087] [2024-10-11 11:31:04,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:31:04,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:31:04,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:31:04,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:31:04,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:31:04,834 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:31:05,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:31:05,190 INFO L93 Difference]: Finished difference Result 142 states and 209 transitions. [2024-10-11 11:31:05,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:31:05,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2024-10-11 11:31:05,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:31:05,193 INFO L225 Difference]: With dead ends: 142 [2024-10-11 11:31:05,193 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 11:31:05,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:31:05,194 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 27 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:31:05,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 163 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:31:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 11:31:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 63. [2024-10-11 11:31:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:31:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2024-10-11 11:31:05,206 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 86 [2024-10-11 11:31:05,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:31:05,206 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2024-10-11 11:31:05,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:31:05,208 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2024-10-11 11:31:05,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 11:31:05,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:31:05,209 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:31:05,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:31:05,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:31:05,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:31:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash 528036728, now seen corresponding path program 1 times [2024-10-11 11:31:05,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:31:05,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725771602] [2024-10-11 11:31:05,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:31:05,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:31:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:05,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:31:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:05,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:31:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:05,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:31:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:05,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:31:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:05,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:31:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:05,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:31:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:05,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:31:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:05,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:31:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:05,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:31:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:05,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:31:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:05,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:31:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:05,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:31:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:05,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:31:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:05,408 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:31:05,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:31:05,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725771602] [2024-10-11 11:31:05,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725771602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:31:05,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:31:05,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:31:05,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745324439] [2024-10-11 11:31:05,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:31:05,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:31:05,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:31:05,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:31:05,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:31:05,413 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:31:05,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:31:05,454 INFO L93 Difference]: Finished difference Result 138 states and 199 transitions. [2024-10-11 11:31:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:31:05,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2024-10-11 11:31:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:31:05,456 INFO L225 Difference]: With dead ends: 138 [2024-10-11 11:31:05,456 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 11:31:05,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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-11 11:31:05,458 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 26 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:31:05,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 251 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:31:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 11:31:05,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2024-10-11 11:31:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:31:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2024-10-11 11:31:05,465 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 86 [2024-10-11 11:31:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:31:05,465 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2024-10-11 11:31:05,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:31:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2024-10-11 11:31:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 11:31:05,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:31:05,467 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:31:05,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:31:05,468 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:31:05,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:31:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1630764580, now seen corresponding path program 1 times [2024-10-11 11:31:05,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:31:05,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898451492] [2024-10-11 11:31:05,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:31:05,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:31:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:06,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:31:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:06,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:31:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:06,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:31:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:06,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:31:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:06,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:31:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:06,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:31:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:06,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:31:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:06,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:31:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:06,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:31:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:06,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:31:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:06,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:31:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:06,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:31:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:06,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:31:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:31:06,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:31:06,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898451492] [2024-10-11 11:31:06,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898451492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:31:06,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:31:06,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 11:31:06,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424468705] [2024-10-11 11:31:06,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:31:06,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:31:06,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:31:06,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:31:06,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:31:06,378 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:31:06,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:31:06,971 INFO L93 Difference]: Finished difference Result 188 states and 261 transitions. [2024-10-11 11:31:06,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:31:06,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2024-10-11 11:31:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:31:06,974 INFO L225 Difference]: With dead ends: 188 [2024-10-11 11:31:06,974 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 11:31:06,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:31:06,979 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 214 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 11:31:06,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 181 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 11:31:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 11:31:06,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 65. [2024-10-11 11:31:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:31:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2024-10-11 11:31:06,996 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 89 [2024-10-11 11:31:06,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:31:06,999 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2024-10-11 11:31:06,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:31:06,999 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2024-10-11 11:31:07,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 11:31:07,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:31:07,000 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:31:07,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:31:07,001 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:31:07,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:31:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash 950706210, now seen corresponding path program 1 times [2024-10-11 11:31:07,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:31:07,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556936761] [2024-10-11 11:31:07,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:31:07,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:31:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:07,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:31:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:07,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:31:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:07,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:31:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:07,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:31:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:07,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:31:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:07,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:31:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:07,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:31:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:07,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:31:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:07,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:31:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:07,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:31:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:07,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:31:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:07,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:31:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:07,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:31:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-11 11:31:07,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:31:07,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556936761] [2024-10-11 11:31:07,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556936761] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:31:07,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914998134] [2024-10-11 11:31:07,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:31:07,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:31:07,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:31:07,366 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-11 11:31:07,367 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-11 11:31:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:07,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 11:31:07,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:31:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 158 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 11:31:07,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:31:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-11 11:31:08,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914998134] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:31:08,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:31:08,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 21 [2024-10-11 11:31:08,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287371550] [2024-10-11 11:31:08,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:31:08,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 11:31:08,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:31:08,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 11:31:08,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-10-11 11:31:08,170 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) [2024-10-11 11:31:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:31:08,698 INFO L93 Difference]: Finished difference Result 168 states and 235 transitions. [2024-10-11 11:31:08,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 11:31:08,700 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) Word has length 89 [2024-10-11 11:31:08,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:31:08,701 INFO L225 Difference]: With dead ends: 168 [2024-10-11 11:31:08,703 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 11:31:08,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2024-10-11 11:31:08,706 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 163 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:31:08,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 408 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:31:08,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 11:31:08,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2024-10-11 11:31:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 75 states have internal predecessors, (97), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 11:31:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 127 transitions. [2024-10-11 11:31:08,726 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 127 transitions. Word has length 89 [2024-10-11 11:31:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:31:08,728 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 127 transitions. [2024-10-11 11:31:08,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) [2024-10-11 11:31:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 127 transitions. [2024-10-11 11:31:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 11:31:08,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:31:08,730 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:31:08,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 11:31:08,931 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-11 11:31:08,932 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:31:08,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:31:08,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1237737570, now seen corresponding path program 1 times [2024-10-11 11:31:08,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:31:08,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002130914] [2024-10-11 11:31:08,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:31:08,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:31:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:09,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:31:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:09,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:31:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:09,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:31:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:09,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:31:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:09,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:31:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:09,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:31:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:09,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:31:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:09,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:31:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:09,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:31:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:09,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:31:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:09,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:31:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:09,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:31:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:09,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:31:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:31:09,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:31:09,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002130914] [2024-10-11 11:31:09,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002130914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:31:09,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:31:09,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 11:31:09,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460525802] [2024-10-11 11:31:09,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:31:09,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 11:31:09,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:31:09,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 11:31:09,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:31:09,676 INFO L87 Difference]: Start difference. First operand 94 states and 127 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:31:10,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:31:10,366 INFO L93 Difference]: Finished difference Result 168 states and 216 transitions. [2024-10-11 11:31:10,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 11:31:10,366 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2024-10-11 11:31:10,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:31:10,369 INFO L225 Difference]: With dead ends: 168 [2024-10-11 11:31:10,369 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 11:31:10,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-10-11 11:31:10,373 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 146 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 11:31:10,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 462 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 11:31:10,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 11:31:10,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 102. [2024-10-11 11:31:10,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 83 states have internal predecessors, (107), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 11:31:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2024-10-11 11:31:10,400 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 137 transitions. Word has length 89 [2024-10-11 11:31:10,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:31:10,400 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 137 transitions. [2024-10-11 11:31:10,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:31:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 137 transitions. [2024-10-11 11:31:10,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 11:31:10,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:31:10,403 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:31:10,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 11:31:10,403 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:31:10,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:31:10,404 INFO L85 PathProgramCache]: Analyzing trace with hash 557679200, now seen corresponding path program 1 times [2024-10-11 11:31:10,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:31:10,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632246117] [2024-10-11 11:31:10,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:31:10,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:31:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:10,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:31:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:10,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:31:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:10,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:31:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:10,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:31:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:10,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:31:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:10,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:31:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:10,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:31:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:10,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:31:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:10,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:31:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:10,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:31:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:10,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:31:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:10,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:31:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:10,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:31:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:31:10,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:31:10,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632246117] [2024-10-11 11:31:10,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632246117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:31:10,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:31:10,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 11:31:10,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728056151] [2024-10-11 11:31:10,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:31:10,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 11:31:10,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:31:10,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 11:31:10,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:31:10,893 INFO L87 Difference]: Start difference. First operand 102 states and 137 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:31:11,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:31:11,246 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2024-10-11 11:31:11,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:31:11,246 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2024-10-11 11:31:11,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:31:11,247 INFO L225 Difference]: With dead ends: 110 [2024-10-11 11:31:11,247 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 11:31:11,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 11:31:11,248 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 56 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:31:11,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 332 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:31:11,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 11:31:11,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2024-10-11 11:31:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 78 states have internal predecessors, (100), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 11:31:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 130 transitions. [2024-10-11 11:31:11,261 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 130 transitions. Word has length 89 [2024-10-11 11:31:11,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:31:11,261 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 130 transitions. [2024-10-11 11:31:11,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:31:11,262 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 130 transitions. [2024-10-11 11:31:11,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 11:31:11,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:31:11,263 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:31:11,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 11:31:11,263 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:31:11,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:31:11,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1963138138, now seen corresponding path program 1 times [2024-10-11 11:31:11,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:31:11,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712068952] [2024-10-11 11:31:11,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:31:11,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:31:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:31:11,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:31:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:31:11,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:31:11,349 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:31:11,350 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:31:11,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 11:31:11,354 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:31:11,420 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:31:11,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:31:11 BoogieIcfgContainer [2024-10-11 11:31:11,423 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:31:11,424 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:31:11,424 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:31:11,424 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:31:11,424 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:30:59" (3/4) ... [2024-10-11 11:31:11,427 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:31:11,428 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:31:11,428 INFO L158 Benchmark]: Toolchain (without parser) took 13320.71ms. Allocated memory was 155.2MB in the beginning and 293.6MB in the end (delta: 138.4MB). Free memory was 83.8MB in the beginning and 181.3MB in the end (delta: -97.4MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2024-10-11 11:31:11,428 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:31:11,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.22ms. Allocated memory is still 155.2MB. Free memory was 83.6MB in the beginning and 115.6MB in the end (delta: -32.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:31:11,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.20ms. Allocated memory is still 155.2MB. Free memory was 115.6MB in the beginning and 112.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:31:11,429 INFO L158 Benchmark]: Boogie Preprocessor took 89.20ms. Allocated memory is still 155.2MB. Free memory was 112.6MB in the beginning and 108.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:31:11,430 INFO L158 Benchmark]: RCFGBuilder took 579.86ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 87.4MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 11:31:11,430 INFO L158 Benchmark]: TraceAbstraction took 12199.81ms. Allocated memory was 155.2MB in the beginning and 293.6MB in the end (delta: 138.4MB). Free memory was 86.9MB in the beginning and 181.3MB in the end (delta: -94.4MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2024-10-11 11:31:11,431 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 293.6MB. Free memory was 181.3MB in the beginning and 181.3MB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:31:11,432 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.20ms. Allocated memory is still 155.2MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.22ms. Allocated memory is still 155.2MB. Free memory was 83.6MB in the beginning and 115.6MB in the end (delta: -32.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.20ms. Allocated memory is still 155.2MB. Free memory was 115.6MB in the beginning and 112.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.20ms. Allocated memory is still 155.2MB. Free memory was 112.6MB in the beginning and 108.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 579.86ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 87.4MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12199.81ms. Allocated memory was 155.2MB in the beginning and 293.6MB in the end (delta: 138.4MB). Free memory was 86.9MB in the beginning and 181.3MB in the end (delta: -94.4MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 293.6MB. Free memory was 181.3MB in the beginning and 181.3MB in the end (delta: 2.6kB). 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: 19]: 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 someBinaryDOUBLEComparisonOperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 1; [L25] unsigned short int var_1_4 = 19138; [L26] unsigned short int var_1_5 = 0; [L27] signed char var_1_6 = 25; [L28] signed long int var_1_7 = -50; [L29] double var_1_8 = 8.3; [L30] unsigned char var_1_9 = 128; [L31] unsigned char var_1_10 = 1; [L32] double var_1_11 = 256.2; [L81] isInitial = 1 [L82] FCALL initially() [L83] int k_loop; [L84] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L84] COND TRUE k_loop < 1 [L85] FCALL updateLastVariables() [L86] CALL updateVariables() [L53] var_1_2 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L54] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L56] var_1_3 = __VERIFIER_nondet_ushort() [L57] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L57] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L59] var_1_4 = __VERIFIER_nondet_ushort() [L60] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L60] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L62] var_1_5 = __VERIFIER_nondet_ushort() [L63] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L63] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L65] var_1_9 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_9 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L66] RET assume_abort_if_not(var_1_9 >= 127) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L67] CALL assume_abort_if_not(var_1_9 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L67] RET assume_abort_if_not(var_1_9 <= 255) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L68] var_1_10 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L69] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L70] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L70] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L72] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L86] RET updateVariables() [L87] CALL step() [L36] COND TRUE \read(var_1_2) [L37] var_1_1 = ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)) VAL [isInitial=1, var_1_10=5, var_1_1=47016, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L39] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=32767, var_1_10=5, var_1_1=47016, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L40] EXPR var_1_5 << var_1_1 VAL [isInitial=1, stepLocal_0=32767, var_1_10=5, var_1_1=47016, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L40] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, stepLocal_0=32767, var_1_10=5, var_1_1=47016, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L40] COND FALSE !(stepLocal_0 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) [L43] var_1_7 = (var_1_5 + (var_1_1 + var_1_4)) VAL [isInitial=1, var_1_10=5, var_1_1=47016, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=79783, var_1_8=83/10, var_1_9=127] [L45] COND TRUE (var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3 [L46] var_1_8 = var_1_11 VAL [isInitial=1, var_1_10=5, var_1_11=79788, var_1_1=47016, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=79783, var_1_8=79788, var_1_9=127] [L48] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) VAL [isInitial=1, var_1_10=5, var_1_11=79788, var_1_1=47016, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=79783, var_1_8=79788, var_1_9=127] [L87] RET step() [L88] CALL, EXPR property() [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=5, var_1_11=79788, var_1_1=47016, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=79783, var_1_8=79788, var_1_9=127] [L77] EXPR var_1_5 << var_1_1 VAL [isInitial=1, var_1_10=5, var_1_11=79788, var_1_1=47016, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=79783, var_1_8=79788, var_1_9=127] [L77] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, var_1_10=5, var_1_11=79788, var_1_1=47016, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=79783, var_1_8=79788, var_1_9=127] [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=5, var_1_11=79788, var_1_1=47016, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=79783, var_1_8=79788, var_1_9=127] [L77-L78] return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4)))))) && (((var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3) ? (var_1_8 == ((double) var_1_11)) : 1) ; [L88] RET, EXPR property() [L88] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=5, var_1_11=79788, var_1_1=47016, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=79783, var_1_8=79788, var_1_9=127] [L19] reach_error() VAL [isInitial=1, var_1_10=5, var_1_11=79788, var_1_1=47016, var_1_2=1, var_1_3=122, var_1_4=32767, var_1_5=0, var_1_6=25, var_1_7=79783, var_1_8=79788, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 9, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 855 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 851 mSDsluCounter, 2021 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1546 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1712 IncrementalHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 475 mSDtfsCounter, 1712 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 490 GetRequests, 409 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=7, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 260 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 878 NumberOfCodeBlocks, 878 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 868 ConstructedInterpolants, 0 QuantifiedInterpolants, 8090 SizeOfPredicates, 7 NumberOfNonLiveVariables, 209 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 3030/3120 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-11 11:31:11,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.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 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:31:13,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:31:13,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:31:13,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:31:13,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:31:13,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:31:13,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:31:13,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:31:13,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:31:13,867 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:31:13,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:31:13,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:31:13,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:31:13,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:31:13,869 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:31:13,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:31:13,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:31:13,871 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:31:13,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:31:13,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:31:13,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:31:13,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:31:13,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:31:13,875 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:31:13,875 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:31:13,875 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:31:13,876 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:31:13,876 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:31:13,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:31:13,876 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:31:13,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:31:13,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:31:13,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:31:13,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:31:13,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:31:13,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:31:13,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:31:13,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:31:13,879 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:31:13,879 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:31:13,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:31:13,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:31:13,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:31:13,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:31:13,881 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:31:13,881 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 -> 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 [2024-10-11 11:31:14,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:31:14,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:31:14,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:31:14,254 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:31:14,254 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:31:14,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-10-11 11:31:15,741 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:31:15,936 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:31:15,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-10-11 11:31:15,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7905cde11/fbb8c0f782ff47ea9e5bfcc763bf61a9/FLAG404cf9680 [2024-10-11 11:31:16,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7905cde11/fbb8c0f782ff47ea9e5bfcc763bf61a9 [2024-10-11 11:31:16,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:31:16,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:31:16,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:31:16,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:31:16,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:31:16,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:31:16" (1/1) ... [2024-10-11 11:31:16,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c63a244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:31:16, skipping insertion in model container [2024-10-11 11:31:16,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:31:16" (1/1) ... [2024-10-11 11:31:16,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:31:16,524 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i[915,928] [2024-10-11 11:31:16,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:31:16,595 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:31:16,608 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i[915,928] [2024-10-11 11:31:16,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:31:16,657 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:31:16,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:31:16 WrapperNode [2024-10-11 11:31:16,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:31:16,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:31:16,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:31:16,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:31:16,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:31:16" (1/1) ... [2024-10-11 11:31:16,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:31:16" (1/1) ... [2024-10-11 11:31:16,711 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-10-11 11:31:16,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:31:16,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:31:16,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:31:16,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:31:16,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:31:16" (1/1) ... [2024-10-11 11:31:16,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:31:16" (1/1) ... [2024-10-11 11:31:16,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:31:16" (1/1) ... [2024-10-11 11:31:16,745 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-11 11:31:16,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:31:16" (1/1) ... [2024-10-11 11:31:16,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:31:16" (1/1) ... [2024-10-11 11:31:16,758 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:31:16" (1/1) ... [2024-10-11 11:31:16,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:31:16" (1/1) ... [2024-10-11 11:31:16,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:31:16" (1/1) ... [2024-10-11 11:31:16,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:31:16" (1/1) ... [2024-10-11 11:31:16,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:31:16,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:31:16,779 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:31:16,779 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:31:16,780 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:31:16" (1/1) ... [2024-10-11 11:31:16,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:31:16,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:31:16,820 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-11 11:31:16,826 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-11 11:31:16,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:31:16,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:31:16,867 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:31:16,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:31:16,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:31:16,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:31:16,962 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:31:16,965 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:31:17,239 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-11 11:31:17,240 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:31:17,296 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:31:17,297 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:31:17,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:31:17 BoogieIcfgContainer [2024-10-11 11:31:17,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:31:17,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:31:17,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:31:17,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:31:17,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:31:16" (1/3) ... [2024-10-11 11:31:17,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78015fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:31:17, skipping insertion in model container [2024-10-11 11:31:17,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:31:16" (2/3) ... [2024-10-11 11:31:17,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78015fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:31:17, skipping insertion in model container [2024-10-11 11:31:17,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:31:17" (3/3) ... [2024-10-11 11:31:17,308 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-10-11 11:31:17,323 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:31:17,323 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:31:17,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:31:17,404 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;@30aa2bb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:31:17,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:31:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:31:17,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 11:31:17,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:31:17,418 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:31:17,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:31:17,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:31:17,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1016882521, now seen corresponding path program 1 times [2024-10-11 11:31:17,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:31:17,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392561537] [2024-10-11 11:31:17,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:31:17,446 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-11 11:31:17,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:31:17,449 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-11 11:31:17,450 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-11 11:31:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:17,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:31:17,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:31:17,670 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-10-11 11:31:17,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:31:17,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:31:17,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392561537] [2024-10-11 11:31:17,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392561537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:31:17,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:31:17,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:31:17,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767954166] [2024-10-11 11:31:17,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:31:17,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:31:17,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:31:17,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:31:17,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:31:17,708 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 11:31:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:31:17,760 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2024-10-11 11:31:17,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:31:17,763 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 82 [2024-10-11 11:31:17,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:31:17,771 INFO L225 Difference]: With dead ends: 75 [2024-10-11 11:31:17,771 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 11:31:17,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 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-11 11:31:17,780 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 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-11 11:31:17,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:31:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 11:31:17,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 11:31:17,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:31:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2024-10-11 11:31:17,830 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 82 [2024-10-11 11:31:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:31:17,831 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2024-10-11 11:31:17,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 11:31:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2024-10-11 11:31:17,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 11:31:17,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:31:17,837 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:31:17,844 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-11 11:31:18,038 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-11 11:31:18,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:31:18,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:31:18,042 INFO L85 PathProgramCache]: Analyzing trace with hash -901268123, now seen corresponding path program 1 times [2024-10-11 11:31:18,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:31:18,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062326264] [2024-10-11 11:31:18,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:31:18,044 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-11 11:31:18,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:31:18,048 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-11 11:31:18,049 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-11 11:31:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:31:18,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 11:31:18,188 INFO L278 TraceCheckSpWp]: Computing forward predicates...