./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-while_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-54.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef9b7fba119094a616fe780d9554585fdb3e4ff62378405da7d638bfc4eb9cbd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:20:11,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:20:11,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:20:11,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:20:11,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:20:11,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:20:11,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:20:11,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:20:11,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:20:11,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:20:11,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:20:11,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:20:11,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:20:11,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:20:11,689 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:20:11,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:20:11,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:20:11,691 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:20:11,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:20:11,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:20:11,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:20:11,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:20:11,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:20:11,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:20:11,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:20:11,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:20:11,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:20:11,694 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:20:11,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:20:11,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:20:11,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:20:11,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:20:11,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:20:11,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:20:11,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:20:11,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:20:11,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:20:11,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:20:11,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:20:11,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:20:11,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:20:11,698 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:20:11,698 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef9b7fba119094a616fe780d9554585fdb3e4ff62378405da7d638bfc4eb9cbd [2024-10-13 04:20:11,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:20:11,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:20:11,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:20:11,974 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:20:11,975 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:20:11,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-54.i [2024-10-13 04:20:13,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:20:13,557 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:20:13,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-54.i [2024-10-13 04:20:13,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09d82bcc1/8181c42710c94fc2b39658454b0d5ebc/FLAG83f99da37 [2024-10-13 04:20:13,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09d82bcc1/8181c42710c94fc2b39658454b0d5ebc [2024-10-13 04:20:13,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:20:13,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:20:13,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:20:13,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:20:13,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:20:13,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:20:13" (1/1) ... [2024-10-13 04:20:13,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793b9b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:13, skipping insertion in model container [2024-10-13 04:20:13,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:20:13" (1/1) ... [2024-10-13 04:20:13,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:20:13,833 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-while_file-54.i[915,928] [2024-10-13 04:20:13,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:20:13,931 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:20:13,945 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-while_file-54.i[915,928] [2024-10-13 04:20:13,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:20:13,997 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:20:14,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:14 WrapperNode [2024-10-13 04:20:14,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:20:14,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:20:14,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:20:14,002 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:20:14,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:14" (1/1) ... [2024-10-13 04:20:14,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:14" (1/1) ... [2024-10-13 04:20:14,073 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-10-13 04:20:14,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:20:14,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:20:14,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:20:14,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:20:14,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:14" (1/1) ... [2024-10-13 04:20:14,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:14" (1/1) ... [2024-10-13 04:20:14,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:14" (1/1) ... [2024-10-13 04:20:14,120 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-13 04:20:14,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:14" (1/1) ... [2024-10-13 04:20:14,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:14" (1/1) ... [2024-10-13 04:20:14,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:14" (1/1) ... [2024-10-13 04:20:14,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:14" (1/1) ... [2024-10-13 04:20:14,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:14" (1/1) ... [2024-10-13 04:20:14,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:14" (1/1) ... [2024-10-13 04:20:14,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:20:14,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:20:14,149 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:20:14,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:20:14,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:14" (1/1) ... [2024-10-13 04:20:14,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:20:14,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:20:14,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:20:14,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:20:14,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:20:14,241 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:20:14,242 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:20:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:20:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:20:14,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:20:14,326 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:20:14,329 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:20:14,615 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-13 04:20:14,616 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:20:14,677 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:20:14,677 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:20:14,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:20:14 BoogieIcfgContainer [2024-10-13 04:20:14,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:20:14,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:20:14,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:20:14,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:20:14,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:20:13" (1/3) ... [2024-10-13 04:20:14,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34585c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:20:14, skipping insertion in model container [2024-10-13 04:20:14,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:14" (2/3) ... [2024-10-13 04:20:14,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34585c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:20:14, skipping insertion in model container [2024-10-13 04:20:14,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:20:14" (3/3) ... [2024-10-13 04:20:14,689 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-54.i [2024-10-13 04:20:14,702 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:20:14,702 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:20:14,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:20:14,766 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;@114b6f01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:20:14,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:20:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 04:20:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 04:20:14,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:20:14,783 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:20:14,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:20:14,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:20:14,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1462614643, now seen corresponding path program 1 times [2024-10-13 04:20:14,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:20:14,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935482670] [2024-10-13 04:20:14,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:20:14,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:20:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:20:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:20:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:20:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:20:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:20:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:20:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:20:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:20:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:20:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:20:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:20:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 04:20:15,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:20:15,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935482670] [2024-10-13 04:20:15,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935482670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:20:15,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:20:15,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:20:15,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645151429] [2024-10-13 04:20:15,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:20:15,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:20:15,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:20:15,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:20:15,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:20:15,164 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 04:20:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:20:15,237 INFO L93 Difference]: Finished difference Result 69 states and 115 transitions. [2024-10-13 04:20:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:20:15,263 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 71 [2024-10-13 04:20:15,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:20:15,277 INFO L225 Difference]: With dead ends: 69 [2024-10-13 04:20:15,278 INFO L226 Difference]: Without dead ends: 34 [2024-10-13 04:20:15,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-13 04:20:15,287 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:20:15,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:20:15,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-13 04:20:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-13 04:20:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 04:20:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2024-10-13 04:20:15,331 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 71 [2024-10-13 04:20:15,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:20:15,332 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2024-10-13 04:20:15,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 04:20:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2024-10-13 04:20:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 04:20:15,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:20:15,335 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:20:15,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:20:15,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:20:15,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:20:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1840891311, now seen corresponding path program 1 times [2024-10-13 04:20:15,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:20:15,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636365807] [2024-10-13 04:20:15,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:20:15,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:20:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:20:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:20:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:20:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:20:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:20:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:20:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:20:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:20:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:20:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:20:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:20:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 04:20:15,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:20:15,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636365807] [2024-10-13 04:20:15,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636365807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:20:15,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:20:15,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:20:15,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559673202] [2024-10-13 04:20:15,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:20:15,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:20:15,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:20:15,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:20:15,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:20:15,636 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 04:20:15,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:20:15,697 INFO L93 Difference]: Finished difference Result 68 states and 94 transitions. [2024-10-13 04:20:15,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:20:15,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 71 [2024-10-13 04:20:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:20:15,701 INFO L225 Difference]: With dead ends: 68 [2024-10-13 04:20:15,702 INFO L226 Difference]: Without dead ends: 35 [2024-10-13 04:20:15,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-13 04:20:15,705 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 12 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:20:15,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 109 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:20:15,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-13 04:20:15,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-10-13 04:20:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 04:20:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2024-10-13 04:20:15,716 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 71 [2024-10-13 04:20:15,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:20:15,720 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2024-10-13 04:20:15,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 04:20:15,720 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2024-10-13 04:20:15,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 04:20:15,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:20:15,725 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:20:15,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:20:15,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:20:15,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:20:15,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1898149613, now seen corresponding path program 1 times [2024-10-13 04:20:15,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:20:15,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074484859] [2024-10-13 04:20:15,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:20:15,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:20:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:20:15,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:20:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:20:15,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:20:15,951 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:20:15,952 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:20:15,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:20:15,957 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 04:20:16,028 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:20:16,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:20:16 BoogieIcfgContainer [2024-10-13 04:20:16,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:20:16,034 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:20:16,034 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:20:16,035 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:20:16,035 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:20:14" (3/4) ... [2024-10-13 04:20:16,037 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:20:16,038 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:20:16,039 INFO L158 Benchmark]: Toolchain (without parser) took 2451.00ms. Allocated memory was 146.8MB in the beginning and 207.6MB in the end (delta: 60.8MB). Free memory was 76.3MB in the beginning and 113.5MB in the end (delta: -37.1MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2024-10-13 04:20:16,041 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:20:16,041 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.66ms. Allocated memory was 146.8MB in the beginning and 207.6MB in the end (delta: 60.8MB). Free memory was 76.0MB in the beginning and 177.3MB in the end (delta: -101.2MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-10-13 04:20:16,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.75ms. Allocated memory is still 207.6MB. Free memory was 177.3MB in the beginning and 175.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:20:16,042 INFO L158 Benchmark]: Boogie Preprocessor took 69.55ms. Allocated memory is still 207.6MB. Free memory was 175.2MB in the beginning and 171.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:20:16,043 INFO L158 Benchmark]: RCFGBuilder took 530.31ms. Allocated memory is still 207.6MB. Free memory was 171.0MB in the beginning and 151.1MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 04:20:16,043 INFO L158 Benchmark]: TraceAbstraction took 1350.94ms. Allocated memory is still 207.6MB. Free memory was 150.0MB in the beginning and 114.5MB in the end (delta: 35.5MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-10-13 04:20:16,043 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 207.6MB. Free memory was 114.5MB in the beginning and 113.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:20:16,045 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.19ms. Allocated memory is still 146.8MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.66ms. Allocated memory was 146.8MB in the beginning and 207.6MB in the end (delta: 60.8MB). Free memory was 76.0MB in the beginning and 177.3MB in the end (delta: -101.2MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.75ms. Allocated memory is still 207.6MB. Free memory was 177.3MB in the beginning and 175.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.55ms. Allocated memory is still 207.6MB. Free memory was 175.2MB in the beginning and 171.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 530.31ms. Allocated memory is still 207.6MB. Free memory was 171.0MB in the beginning and 151.1MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1350.94ms. Allocated memory is still 207.6MB. Free memory was 150.0MB in the beginning and 114.5MB in the end (delta: 35.5MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 207.6MB. Free memory was 114.5MB in the beginning and 113.5MB in the end (delta: 1.0MB). 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 someBinaryFLOATComparisonOperation at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_3 = 10; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 0; [L28] unsigned long int var_1_9 = 5; [L29] unsigned long int var_1_10 = 3126062476; [L30] unsigned short int var_1_13 = 10; [L31] signed long int var_1_14 = 128; [L32] float var_1_15 = 4.2; [L33] float var_1_16 = 5.1; [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] FCALL updateLastVariables() [L89] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L62] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L62] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L63] var_1_6 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_7=0, var_1_8=0, var_1_9=5] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_7=0, var_1_8=0, var_1_9=5] [L65] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L65] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=5] [L66] var_1_7 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_8=0, var_1_9=5] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_8=0, var_1_9=5] [L68] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L68] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=5] [L69] var_1_8 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_9=5] [L70] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_9=5] [L71] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L71] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_10=3126062476, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L72] var_1_10 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_10 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L73] RET assume_abort_if_not(var_1_10 >= 2147483647) VAL [isInitial=1, var_1_10=-2, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L74] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L74] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, var_1_10=-2, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_16=51/10, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L75] var_1_16 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L76] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-2, var_1_13=10, var_1_14=128, var_1_15=21/5, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L89] RET updateVariables() [L90] CALL step() [L37] var_1_13 = var_1_3 [L38] var_1_14 = var_1_3 [L39] var_1_15 = var_1_16 [L40] unsigned short int stepLocal_0 = var_1_13; VAL [isInitial=1, var_1_10=-2, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L41] COND FALSE !(-4 >= stepLocal_0) VAL [isInitial=1, var_1_10=-2, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L44] signed long int stepLocal_2 = var_1_14; VAL [isInitial=1, stepLocal_2=254, var_1_10=-2, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L45] COND FALSE !(var_1_3 < stepLocal_2) VAL [isInitial=1, var_1_10=-2, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L48] unsigned long int stepLocal_1 = 8 * var_1_9; VAL [isInitial=1, stepLocal_1=40, var_1_10=-2, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=0, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L49] COND FALSE !(stepLocal_1 == ((((10) > (var_1_9)) ? (10) : (var_1_9)))) [L56] var_1_4 = var_1_8 VAL [isInitial=1, var_1_10=-2, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=-256, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L90] RET step() [L91] CALL, EXPR property() [L81-L82] return ((((((-4 >= var_1_13) ? (var_1_1 == ((unsigned char) ((((var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * var_1_9) == ((((10) > (var_1_9)) ? (10) : (var_1_9)))) ? (var_1_6 ? (var_1_4 == ((unsigned char) (var_1_7 && var_1_8))) : (var_1_4 == ((unsigned char) var_1_8))) : (var_1_4 == ((unsigned char) var_1_8)))) && ((var_1_3 < var_1_14) ? (var_1_9 == ((unsigned long int) (((((3851651024u - var_1_3)) < ((((((var_1_10 - var_1_13)) > ((var_1_1 + var_1_1))) ? ((var_1_10 - var_1_13)) : ((var_1_1 + var_1_1)))))) ? ((3851651024u - var_1_3)) : ((((((var_1_10 - var_1_13)) > ((var_1_1 + var_1_1))) ? ((var_1_10 - var_1_13)) : ((var_1_1 + var_1_1))))))))) : 1)) && (var_1_13 == ((unsigned short int) var_1_3))) && (var_1_14 == ((signed long int) var_1_3))) && (var_1_15 == ((float) var_1_16)) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-2, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=-256, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] [L19] reach_error() VAL [isInitial=1, var_1_10=-2, var_1_13=254, var_1_14=254, var_1_15=3126062481, var_1_16=3126062481, var_1_1=16, var_1_3=254, var_1_4=-256, var_1_6=1, var_1_7=1, var_1_8=-256, var_1_9=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 153 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 85 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 440/440 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-13 04:20:16,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-54.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef9b7fba119094a616fe780d9554585fdb3e4ff62378405da7d638bfc4eb9cbd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:20:18,307 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:20:18,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:20:18,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:20:18,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:20:18,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:20:18,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:20:18,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:20:18,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:20:18,448 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:20:18,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:20:18,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:20:18,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:20:18,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:20:18,452 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:20:18,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:20:18,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:20:18,453 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:20:18,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:20:18,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:20:18,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:20:18,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:20:18,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:20:18,455 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:20:18,455 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:20:18,456 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:20:18,456 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:20:18,456 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:20:18,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:20:18,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:20:18,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:20:18,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:20:18,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:20:18,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:20:18,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:20:18,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:20:18,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:20:18,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:20:18,459 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:20:18,460 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:20:18,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:20:18,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:20:18,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:20:18,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:20:18,462 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:20:18,462 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef9b7fba119094a616fe780d9554585fdb3e4ff62378405da7d638bfc4eb9cbd [2024-10-13 04:20:18,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:20:18,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:20:18,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:20:18,812 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:20:18,813 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:20:18,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-54.i [2024-10-13 04:20:20,365 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:20:20,606 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:20:20,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-54.i [2024-10-13 04:20:20,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b113fd916/ed899d742e024584927f98c422967060/FLAG9aae005cd [2024-10-13 04:20:20,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b113fd916/ed899d742e024584927f98c422967060 [2024-10-13 04:20:20,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:20:20,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:20:20,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:20:20,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:20:20,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:20:20,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:20:20" (1/1) ... [2024-10-13 04:20:20,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5adf1a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:20, skipping insertion in model container [2024-10-13 04:20:20,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:20:20" (1/1) ... [2024-10-13 04:20:20,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:20:21,182 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-while_file-54.i[915,928] [2024-10-13 04:20:21,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:20:21,237 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:20:21,249 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-while_file-54.i[915,928] [2024-10-13 04:20:21,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:20:21,293 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:20:21,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:21 WrapperNode [2024-10-13 04:20:21,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:20:21,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:20:21,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:20:21,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:20:21,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:21" (1/1) ... [2024-10-13 04:20:21,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:21" (1/1) ... [2024-10-13 04:20:21,342 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-10-13 04:20:21,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:20:21,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:20:21,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:20:21,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:20:21,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:21" (1/1) ... [2024-10-13 04:20:21,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:21" (1/1) ... [2024-10-13 04:20:21,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:21" (1/1) ... [2024-10-13 04:20:21,382 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-13 04:20:21,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:21" (1/1) ... [2024-10-13 04:20:21,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:21" (1/1) ... [2024-10-13 04:20:21,393 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:21" (1/1) ... [2024-10-13 04:20:21,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:21" (1/1) ... [2024-10-13 04:20:21,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:21" (1/1) ... [2024-10-13 04:20:21,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:21" (1/1) ... [2024-10-13 04:20:21,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:20:21,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:20:21,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:20:21,418 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:20:21,419 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:21" (1/1) ... [2024-10-13 04:20:21,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:20:21,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:20:21,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:20:21,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:20:21,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:20:21,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:20:21,504 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:20:21,504 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:20:21,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:20:21,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:20:21,569 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:20:21,571 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:20:21,835 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-13 04:20:21,836 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:20:21,908 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:20:21,908 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:20:21,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:20:21 BoogieIcfgContainer [2024-10-13 04:20:21,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:20:21,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:20:21,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:20:21,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:20:21,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:20:20" (1/3) ... [2024-10-13 04:20:21,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ee0752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:20:21, skipping insertion in model container [2024-10-13 04:20:21,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:21" (2/3) ... [2024-10-13 04:20:21,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ee0752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:20:21, skipping insertion in model container [2024-10-13 04:20:21,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:20:21" (3/3) ... [2024-10-13 04:20:21,920 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-54.i [2024-10-13 04:20:21,935 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:20:21,936 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:20:22,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:20:22,021 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;@62d436c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:20:22,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:20:22,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 04:20:22,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 04:20:22,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:20:22,036 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:20:22,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:20:22,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:20:22,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1462614643, now seen corresponding path program 1 times [2024-10-13 04:20:22,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:20:22,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939476839] [2024-10-13 04:20:22,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:20:22,060 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-13 04:20:22,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:20:22,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-13 04:20:22,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 04:20:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:22,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:20:22,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:20:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 04:20:22,296 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:20:22,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:20:22,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939476839] [2024-10-13 04:20:22,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939476839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:20:22,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:20:22,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:20:22,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595334606] [2024-10-13 04:20:22,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:20:22,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:20:22,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:20:22,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:20:22,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:20:22,332 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 04:20:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:20:22,364 INFO L93 Difference]: Finished difference Result 69 states and 115 transitions. [2024-10-13 04:20:22,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:20:22,368 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 71 [2024-10-13 04:20:22,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:20:22,374 INFO L225 Difference]: With dead ends: 69 [2024-10-13 04:20:22,374 INFO L226 Difference]: Without dead ends: 34 [2024-10-13 04:20:22,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 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-13 04:20:22,380 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:20:22,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:20:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-13 04:20:22,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-13 04:20:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 04:20:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2024-10-13 04:20:22,422 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 71 [2024-10-13 04:20:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:20:22,422 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2024-10-13 04:20:22,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 04:20:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2024-10-13 04:20:22,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 04:20:22,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:20:22,426 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:20:22,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 04:20:22,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-13 04:20:22,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:20:22,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:20:22,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1840891311, now seen corresponding path program 1 times [2024-10-13 04:20:22,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:20:22,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957644641] [2024-10-13 04:20:22,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:20:22,629 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-13 04:20:22,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:20:22,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-13 04:20:22,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 04:20:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:22,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 04:20:22,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:20:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 04:20:22,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:20:22,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:20:22,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957644641] [2024-10-13 04:20:22,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957644641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:20:22,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:20:22,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:20:22,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508853505] [2024-10-13 04:20:22,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:20:22,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:20:22,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:20:22,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:20:22,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:20:22,879 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 04:20:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:20:22,942 INFO L93 Difference]: Finished difference Result 68 states and 94 transitions. [2024-10-13 04:20:22,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:20:22,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 71 [2024-10-13 04:20:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:20:22,948 INFO L225 Difference]: With dead ends: 68 [2024-10-13 04:20:22,949 INFO L226 Difference]: Without dead ends: 35 [2024-10-13 04:20:22,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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-13 04:20:22,952 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:20:22,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 107 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:20:22,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-13 04:20:22,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-10-13 04:20:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 04:20:22,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2024-10-13 04:20:22,962 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 71 [2024-10-13 04:20:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:20:22,967 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2024-10-13 04:20:22,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 04:20:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2024-10-13 04:20:22,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 04:20:22,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:20:22,970 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:20:22,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 04:20:23,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-13 04:20:23,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:20:23,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:20:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1898149613, now seen corresponding path program 1 times [2024-10-13 04:20:23,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:20:23,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748205034] [2024-10-13 04:20:23,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:20:23,174 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-13 04:20:23,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:20:23,177 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-13 04:20:23,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 04:20:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:23,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 04:20:23,316 INFO L278 TraceCheckSpWp]: Computing forward predicates...