./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.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 235ed319bc52a68655347e756e6c00f5033f8cd4f7805979bed7b6dfee48c5d5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:37:14,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:37:14,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:37:14,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:37:14,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:37:14,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:37:14,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:37:14,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:37:14,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:37:14,142 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:37:14,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:37:14,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:37:14,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:37:14,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:37:14,144 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:37:14,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:37:14,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:37:14,146 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:37:14,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:37:14,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:37:14,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:37:14,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:37:14,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:37:14,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:37:14,148 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:37:14,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:37:14,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:37:14,149 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:37:14,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:37:14,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:37:14,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:37:14,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:37:14,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:37:14,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:37:14,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:37:14,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:37:14,153 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:37:14,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:37:14,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:37:14,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:37:14,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:37:14,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:37:14,154 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 -> 235ed319bc52a68655347e756e6c00f5033f8cd4f7805979bed7b6dfee48c5d5 [2024-11-12 05:37:14,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:37:14,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:37:14,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:37:14,431 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:37:14,432 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:37:14,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i [2024-11-12 05:37:15,947 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:37:16,157 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:37:16,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i [2024-11-12 05:37:16,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/878cd5039/87d10ce920c94218b57ebc11dc4ce4ec/FLAGe58a7203b [2024-11-12 05:37:16,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/878cd5039/87d10ce920c94218b57ebc11dc4ce4ec [2024-11-12 05:37:16,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:37:16,186 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:37:16,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:37:16,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:37:16,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:37:16,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:37:16" (1/1) ... [2024-11-12 05:37:16,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97384ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:16, skipping insertion in model container [2024-11-12 05:37:16,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:37:16" (1/1) ... [2024-11-12 05:37:16,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:37:16,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i[915,928] [2024-11-12 05:37:16,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:37:16,442 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:37:16,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i[915,928] [2024-11-12 05:37:16,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:37:16,491 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:37:16,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:16 WrapperNode [2024-11-12 05:37:16,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:37:16,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:37:16,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:37:16,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:37:16,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:16" (1/1) ... [2024-11-12 05:37:16,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:16" (1/1) ... [2024-11-12 05:37:16,541 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-11-12 05:37:16,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:37:16,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:37:16,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:37:16,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:37:16,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:16" (1/1) ... [2024-11-12 05:37:16,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:16" (1/1) ... [2024-11-12 05:37:16,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:16" (1/1) ... [2024-11-12 05:37:16,574 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:37:16,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:16" (1/1) ... [2024-11-12 05:37:16,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:16" (1/1) ... [2024-11-12 05:37:16,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:16" (1/1) ... [2024-11-12 05:37:16,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:16" (1/1) ... [2024-11-12 05:37:16,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:16" (1/1) ... [2024-11-12 05:37:16,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:16" (1/1) ... [2024-11-12 05:37:16,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:37:16,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:37:16,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:37:16,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:37:16,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:16" (1/1) ... [2024-11-12 05:37:16,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:37:16,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:37:16,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:37:16,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:37:16,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:37:16,767 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:37:16,767 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:37:16,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:37:16,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:37:16,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:37:16,846 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:37:16,849 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:37:17,187 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 05:37:17,188 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:37:17,203 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:37:17,204 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:37:17,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:37:17 BoogieIcfgContainer [2024-11-12 05:37:17,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:37:17,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:37:17,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:37:17,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:37:17,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:37:16" (1/3) ... [2024-11-12 05:37:17,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f14185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:37:17, skipping insertion in model container [2024-11-12 05:37:17,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:16" (2/3) ... [2024-11-12 05:37:17,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f14185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:37:17, skipping insertion in model container [2024-11-12 05:37:17,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:37:17" (3/3) ... [2024-11-12 05:37:17,217 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-96.i [2024-11-12 05:37:17,237 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:37:17,238 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:37:17,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:37:17,324 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;@df10738, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:37:17,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:37:17,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 05:37:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-12 05:37:17,349 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:37:17,350 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:37:17,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:37:17,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:37:17,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1639088171, now seen corresponding path program 1 times [2024-11-12 05:37:17,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:37:17,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192367334] [2024-11-12 05:37:17,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:37:17,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:37:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:17,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:37:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:37:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:37:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:37:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:37:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:37:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:37:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:37:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:37:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:37:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:37:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:37:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:37:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:37:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:37:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:37:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 05:37:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:37:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:37:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:37:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:37:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-12 05:37:18,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:37:18,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192367334] [2024-11-12 05:37:18,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192367334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:37:18,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:37:18,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:37:18,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450499067] [2024-11-12 05:37:18,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:37:18,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:37:18,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:37:18,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:37:18,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:37:18,267 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-12 05:37:18,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:37:18,365 INFO L93 Difference]: Finished difference Result 163 states and 294 transitions. [2024-11-12 05:37:18,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:37:18,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 130 [2024-11-12 05:37:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:37:18,382 INFO L225 Difference]: With dead ends: 163 [2024-11-12 05:37:18,382 INFO L226 Difference]: Without dead ends: 107 [2024-11-12 05:37:18,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:37:18,389 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 38 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:37:18,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 147 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:37:18,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-12 05:37:18,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2024-11-12 05:37:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 05:37:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2024-11-12 05:37:18,459 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 130 [2024-11-12 05:37:18,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:37:18,461 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2024-11-12 05:37:18,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-12 05:37:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2024-11-12 05:37:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-12 05:37:18,466 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:37:18,467 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:37:18,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:37:18,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:37:18,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:37:18,471 INFO L85 PathProgramCache]: Analyzing trace with hash 135919191, now seen corresponding path program 1 times [2024-11-12 05:37:18,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:37:18,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324029227] [2024-11-12 05:37:18,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:37:18,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:37:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:37:18,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [307300938] [2024-11-12 05:37:18,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:37:18,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:37:18,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:37:18,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:37:18,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 05:37:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:37:18,758 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:37:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:37:18,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:37:18,908 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:37:18,910 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:37:18,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 05:37:19,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:37:19,118 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 05:37:19,227 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:37:19,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:37:19 BoogieIcfgContainer [2024-11-12 05:37:19,230 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:37:19,231 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:37:19,231 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:37:19,231 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:37:19,232 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:37:17" (3/4) ... [2024-11-12 05:37:19,235 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:37:19,236 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:37:19,236 INFO L158 Benchmark]: Toolchain (without parser) took 3050.58ms. Allocated memory is still 157.3MB. Free memory was 90.8MB in the beginning and 74.4MB in the end (delta: 16.4MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-11-12 05:37:19,237 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 79.1MB in the end (delta: 54.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:37:19,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.02ms. Allocated memory is still 157.3MB. Free memory was 90.6MB in the beginning and 76.2MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 05:37:19,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.52ms. Allocated memory is still 157.3MB. Free memory was 76.2MB in the beginning and 73.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 05:37:19,240 INFO L158 Benchmark]: Boogie Preprocessor took 61.17ms. Allocated memory is still 157.3MB. Free memory was 73.6MB in the beginning and 70.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:37:19,241 INFO L158 Benchmark]: RCFGBuilder took 600.01ms. Allocated memory is still 157.3MB. Free memory was 70.3MB in the beginning and 113.5MB in the end (delta: -43.3MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2024-11-12 05:37:19,241 INFO L158 Benchmark]: TraceAbstraction took 2022.23ms. Allocated memory is still 157.3MB. Free memory was 112.7MB in the beginning and 74.4MB in the end (delta: 38.3MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2024-11-12 05:37:19,241 INFO L158 Benchmark]: Witness Printer took 5.20ms. Allocated memory is still 157.3MB. Free memory was 74.4MB in the beginning and 74.4MB in the end (delta: 31.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:37:19,245 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 117.4MB. Free memory was 79.2MB in the beginning and 79.1MB in the end (delta: 54.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.02ms. Allocated memory is still 157.3MB. Free memory was 90.6MB in the beginning and 76.2MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.52ms. Allocated memory is still 157.3MB. Free memory was 76.2MB in the beginning and 73.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.17ms. Allocated memory is still 157.3MB. Free memory was 73.6MB in the beginning and 70.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 600.01ms. Allocated memory is still 157.3MB. Free memory was 70.3MB in the beginning and 113.5MB in the end (delta: -43.3MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2022.23ms. Allocated memory is still 157.3MB. Free memory was 112.7MB in the beginning and 74.4MB in the end (delta: 38.3MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. * Witness Printer took 5.20ms. Allocated memory is still 157.3MB. Free memory was 74.4MB in the beginning and 74.4MB in the end (delta: 31.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryArithmeticFLOAToperation at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 8; [L25] unsigned short int var_1_4 = 1000; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 1; [L31] float var_1_10 = 0.125; [L32] signed long int var_1_11 = 50; [L33] float var_1_12 = 1000000000000.45; [L34] float var_1_13 = 128.5; [L35] float var_1_14 = 10000000.625; [L36] signed char var_1_15 = -5; [L37] signed char var_1_16 = 10; VAL [isInitial=0, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] FCALL updateLastVariables() [L114] CALL updateVariables() [L70] var_1_2 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L71] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L72] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L72] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L73] var_1_3 = __VERIFIER_nondet_ushort() [L74] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L74] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L75] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L75] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L76] var_1_4 = __VERIFIER_nondet_ushort() [L77] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L77] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L78] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L78] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L79] var_1_6 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L81] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=1] [L81] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=1] [L82] var_1_7 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=1] [L83] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=1] [L84] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=1] [L85] var_1_8 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=1] [L86] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=1] [L87] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L88] var_1_9 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L89] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L90] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L91] var_1_11 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L92] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L93] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L94] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L95] var_1_12 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L96] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L97] var_1_13 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L98] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L99] var_1_16 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L100] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L101] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L114] RET updateVariables() [L115] CALL step() [L41] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L42] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, stepLocal_0=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L47] var_1_14 = var_1_12 [L48] var_1_15 = var_1_16 VAL [isInitial=1, stepLocal_0=1, var_1_10=1/8, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L49] COND FALSE !(! var_1_5) [L52] var_1_1 = var_1_4 VAL [isInitial=1, stepLocal_0=1, var_1_10=1/8, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L54] signed long int stepLocal_1 = -2 / var_1_11; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=1/8, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L55] COND TRUE stepLocal_1 > (((((var_1_4) > (var_1_3)) ? (var_1_4) : (var_1_3))) * var_1_1) [L56] var_1_10 = ((var_1_12 - var_1_13) + 9.8f) VAL [isInitial=1, stepLocal_0=1, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return (((((! var_1_5) ? (var_1_1 == ((unsigned short int) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((unsigned short int) var_1_4))) && (var_1_2 ? ((var_1_6 && (var_1_7 || var_1_8)) ? (var_1_5 == ((unsigned char) var_1_9)) : 1) : 1)) && (((-2 / var_1_11) > (((((var_1_4) > (var_1_3)) ? (var_1_4) : (var_1_3))) * var_1_1)) ? (var_1_10 == ((float) ((var_1_12 - var_1_13) + 9.8f))) : (var_1_5 ? (var_1_5 ? (var_1_10 == ((float) var_1_12)) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_12))))) && (var_1_14 == ((float) var_1_12))) && (var_1_15 == ((signed char) var_1_16)) ; VAL [\result=0, isInitial=1, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 2, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 147 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 77 mSDtfsCounter, 12 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 840/840 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-11-12 05:37:19,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.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 235ed319bc52a68655347e756e6c00f5033f8cd4f7805979bed7b6dfee48c5d5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:37:21,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:37:21,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:37:21,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:37:21,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:37:21,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:37:21,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:37:21,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:37:21,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:37:21,729 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:37:21,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:37:21,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:37:21,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:37:21,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:37:21,731 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:37:21,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:37:21,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:37:21,731 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:37:21,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:37:21,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:37:21,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:37:21,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:37:21,737 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:37:21,737 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:37:21,737 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:37:21,737 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:37:21,738 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:37:21,738 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:37:21,738 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:37:21,738 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:37:21,738 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:37:21,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:37:21,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:37:21,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:37:21,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:37:21,739 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:37:21,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:37:21,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:37:21,755 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:37:21,756 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:37:21,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:37:21,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:37:21,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:37:21,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:37:21,757 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 -> 235ed319bc52a68655347e756e6c00f5033f8cd4f7805979bed7b6dfee48c5d5 [2024-11-12 05:37:22,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:37:22,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:37:22,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:37:22,144 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:37:22,145 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:37:22,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i [2024-11-12 05:37:23,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:37:23,939 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:37:23,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i [2024-11-12 05:37:23,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47608a0e/0e90d6a46f6b4846baac36753b4dca69/FLAG03463a7d8 [2024-11-12 05:37:23,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47608a0e/0e90d6a46f6b4846baac36753b4dca69 [2024-11-12 05:37:23,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:37:23,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:37:23,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:37:23,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:37:23,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:37:23,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:37:23" (1/1) ... [2024-11-12 05:37:23,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40035d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:23, skipping insertion in model container [2024-11-12 05:37:23,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:37:23" (1/1) ... [2024-11-12 05:37:24,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:37:24,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i[915,928] [2024-11-12 05:37:24,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:37:24,291 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:37:24,306 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-96.i[915,928] [2024-11-12 05:37:24,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:37:24,379 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:37:24,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:24 WrapperNode [2024-11-12 05:37:24,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:37:24,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:37:24,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:37:24,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:37:24,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:24" (1/1) ... [2024-11-12 05:37:24,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:24" (1/1) ... [2024-11-12 05:37:24,440 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-12 05:37:24,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:37:24,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:37:24,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:37:24,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:37:24,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:24" (1/1) ... [2024-11-12 05:37:24,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:24" (1/1) ... [2024-11-12 05:37:24,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:24" (1/1) ... [2024-11-12 05:37:24,482 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:37:24,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:24" (1/1) ... [2024-11-12 05:37:24,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:24" (1/1) ... [2024-11-12 05:37:24,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:24" (1/1) ... [2024-11-12 05:37:24,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:24" (1/1) ... [2024-11-12 05:37:24,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:24" (1/1) ... [2024-11-12 05:37:24,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:24" (1/1) ... [2024-11-12 05:37:24,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:37:24,511 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:37:24,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:37:24,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:37:24,512 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:24" (1/1) ... [2024-11-12 05:37:24,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:37:24,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:37:24,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:37:24,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:37:24,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:37:24,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:37:24,603 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:37:24,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:37:24,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:37:24,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:37:24,705 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:37:24,708 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:37:25,247 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 05:37:25,247 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:37:25,265 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:37:25,266 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:37:25,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:37:25 BoogieIcfgContainer [2024-11-12 05:37:25,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:37:25,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:37:25,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:37:25,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:37:25,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:37:23" (1/3) ... [2024-11-12 05:37:25,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d60d802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:37:25, skipping insertion in model container [2024-11-12 05:37:25,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:24" (2/3) ... [2024-11-12 05:37:25,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d60d802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:37:25, skipping insertion in model container [2024-11-12 05:37:25,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:37:25" (3/3) ... [2024-11-12 05:37:25,278 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-96.i [2024-11-12 05:37:25,296 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:37:25,297 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:37:25,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:37:25,379 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;@738e0218, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:37:25,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:37:25,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 05:37:25,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-12 05:37:25,398 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:37:25,399 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:37:25,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:37:25,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:37:25,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1639088171, now seen corresponding path program 1 times [2024-11-12 05:37:25,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:37:25,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717536218] [2024-11-12 05:37:25,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:37:25,428 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-11-12 05:37:25,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:37:25,448 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-11-12 05:37:25,450 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-11-12 05:37:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:25,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 05:37:25,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:37:26,259 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-12 05:37:26,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:37:26,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:37:26,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717536218] [2024-11-12 05:37:26,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717536218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:37:26,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:37:26,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:37:26,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646086692] [2024-11-12 05:37:26,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:37:26,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:37:26,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:37:26,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:37:26,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:37:26,296 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-12 05:37:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:37:27,038 INFO L93 Difference]: Finished difference Result 163 states and 294 transitions. [2024-11-12 05:37:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:37:27,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 130 [2024-11-12 05:37:27,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:37:27,051 INFO L225 Difference]: With dead ends: 163 [2024-11-12 05:37:27,051 INFO L226 Difference]: Without dead ends: 107 [2024-11-12 05:37:27,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:37:27,059 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 14 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 05:37:27,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 147 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 05:37:27,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-12 05:37:27,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2024-11-12 05:37:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 05:37:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2024-11-12 05:37:27,125 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 130 [2024-11-12 05:37:27,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:37:27,126 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2024-11-12 05:37:27,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-12 05:37:27,127 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2024-11-12 05:37:27,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-12 05:37:27,133 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:37:27,133 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:37:27,147 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-11-12 05:37:27,333 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-11-12 05:37:27,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:37:27,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:37:27,335 INFO L85 PathProgramCache]: Analyzing trace with hash 135919191, now seen corresponding path program 1 times [2024-11-12 05:37:27,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:37:27,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561461634] [2024-11-12 05:37:27,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:37:27,337 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-11-12 05:37:27,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:37:27,338 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-11-12 05:37:27,345 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-11-12 05:37:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:27,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 05:37:27,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:37:54,510 WARN L286 SmtUtils]: Spent 9.34s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)