./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-63.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 4464cb734770b9d0fa9d6e2642392f2055c585b5ff2c6b71c083265ca3731e1b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:57:10,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:57:10,326 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 22:57:10,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:57:10,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:57:10,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:57:10,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:57:10,368 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:57:10,368 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:57:10,369 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:57:10,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:57:10,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:57:10,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:57:10,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:57:10,372 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:57:10,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:57:10,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:57:10,374 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:57:10,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 22:57:10,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:57:10,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:57:10,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:57:10,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:57:10,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:57:10,378 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:57:10,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:57:10,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:57:10,379 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:57:10,379 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:57:10,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:57:10,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:57:10,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:57:10,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:57:10,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:57:10,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:57:10,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:57:10,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 22:57:10,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 22:57:10,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:57:10,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:57:10,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:57:10,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:57:10,383 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 -> 4464cb734770b9d0fa9d6e2642392f2055c585b5ff2c6b71c083265ca3731e1b [2024-11-18 22:57:10,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:57:10,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:57:10,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:57:10,638 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:57:10,638 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:57:10,640 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-63.i [2024-11-18 22:57:12,051 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:57:12,230 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:57:12,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-63.i [2024-11-18 22:57:12,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9a40cb6/8434d9817ffd44fd8a39f6658bf077be/FLAGe5b5f4150 [2024-11-18 22:57:12,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9a40cb6/8434d9817ffd44fd8a39f6658bf077be [2024-11-18 22:57:12,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:57:12,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:57:12,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:57:12,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:57:12,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:57:12,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:57:12" (1/1) ... [2024-11-18 22:57:12,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d5655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:12, skipping insertion in model container [2024-11-18 22:57:12,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:57:12" (1/1) ... [2024-11-18 22:57:12,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:57:12,828 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-63.i[915,928] [2024-11-18 22:57:12,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:57:12,886 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:57:12,898 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-63.i[915,928] [2024-11-18 22:57:12,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:57:12,938 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:57:12,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:12 WrapperNode [2024-11-18 22:57:12,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:57:12,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:57:12,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:57:12,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:57:12,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:12" (1/1) ... [2024-11-18 22:57:12,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:12" (1/1) ... [2024-11-18 22:57:12,983 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-18 22:57:12,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:57:12,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:57:12,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:57:12,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:57:12,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:12" (1/1) ... [2024-11-18 22:57:12,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:12" (1/1) ... [2024-11-18 22:57:13,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:12" (1/1) ... [2024-11-18 22:57:13,017 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-18 22:57:13,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:12" (1/1) ... [2024-11-18 22:57:13,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:12" (1/1) ... [2024-11-18 22:57:13,026 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:12" (1/1) ... [2024-11-18 22:57:13,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:12" (1/1) ... [2024-11-18 22:57:13,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:12" (1/1) ... [2024-11-18 22:57:13,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:12" (1/1) ... [2024-11-18 22:57:13,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:57:13,038 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:57:13,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:57:13,039 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:57:13,040 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:12" (1/1) ... [2024-11-18 22:57:13,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:57:13,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:57:13,077 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-18 22:57:13,086 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-18 22:57:13,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:57:13,127 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:57:13,127 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:57:13,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 22:57:13,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:57:13,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:57:13,208 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:57:13,211 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:57:13,448 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-18 22:57:13,449 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:57:13,462 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:57:13,463 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:57:13,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:57:13 BoogieIcfgContainer [2024-11-18 22:57:13,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:57:13,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:57:13,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:57:13,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:57:13,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:57:12" (1/3) ... [2024-11-18 22:57:13,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46284512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:57:13, skipping insertion in model container [2024-11-18 22:57:13,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:12" (2/3) ... [2024-11-18 22:57:13,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46284512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:57:13, skipping insertion in model container [2024-11-18 22:57:13,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:57:13" (3/3) ... [2024-11-18 22:57:13,473 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-63.i [2024-11-18 22:57:13,489 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:57:13,490 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:57:13,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:57:13,553 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;@3ff9a8c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:57:13,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:57:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 22:57:13,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-18 22:57:13,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:57:13,571 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:57:13,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:57:13,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:57:13,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1110012742, now seen corresponding path program 1 times [2024-11-18 22:57:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:57:13,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531374372] [2024-11-18 22:57:13,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:57:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:57:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:57:13,828 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-18 22:57:13,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:57:13,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531374372] [2024-11-18 22:57:13,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531374372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:57:13,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115631205] [2024-11-18 22:57:13,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:57:13,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:57:13,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:57:13,838 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-18 22:57:13,841 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-18 22:57:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:57:13,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:57:14,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:57:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-18 22:57:14,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:57:14,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115631205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:57:14,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:57:14,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 22:57:14,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541851113] [2024-11-18 22:57:14,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:57:14,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:57:14,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:57:14,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:57:14,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:57:14,085 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-18 22:57:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:57:14,125 INFO L93 Difference]: Finished difference Result 103 states and 178 transitions. [2024-11-18 22:57:14,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:57:14,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 123 [2024-11-18 22:57:14,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:57:14,133 INFO L225 Difference]: With dead ends: 103 [2024-11-18 22:57:14,134 INFO L226 Difference]: Without dead ends: 51 [2024-11-18 22:57:14,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:57:14,143 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:57:14,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:57:14,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-18 22:57:14,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-18 22:57:14,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 22:57:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2024-11-18 22:57:14,180 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 123 [2024-11-18 22:57:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:57:14,181 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2024-11-18 22:57:14,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-18 22:57:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2024-11-18 22:57:14,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-18 22:57:14,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:57:14,184 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:57:14,202 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-18 22:57:14,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 22:57:14,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:57:14,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:57:14,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1909930626, now seen corresponding path program 1 times [2024-11-18 22:57:14,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:57:14,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782562940] [2024-11-18 22:57:14,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:57:14,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:57:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:57:14,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 22:57:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:57:14,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 22:57:14,689 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 22:57:14,690 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 22:57:14,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 22:57:14,694 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-18 22:57:14,775 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 22:57:14,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:57:14 BoogieIcfgContainer [2024-11-18 22:57:14,778 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 22:57:14,779 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 22:57:14,779 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 22:57:14,779 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 22:57:14,780 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:57:13" (3/4) ... [2024-11-18 22:57:14,782 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 22:57:14,783 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 22:57:14,784 INFO L158 Benchmark]: Toolchain (without parser) took 2155.65ms. Allocated memory was 176.2MB in the beginning and 222.3MB in the end (delta: 46.1MB). Free memory was 120.1MB in the beginning and 159.2MB in the end (delta: -39.1MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-18 22:57:14,785 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:57:14,786 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.71ms. Allocated memory is still 176.2MB. Free memory was 119.5MB in the beginning and 105.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 22:57:14,786 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.33ms. Allocated memory is still 176.2MB. Free memory was 105.4MB in the beginning and 103.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:57:14,788 INFO L158 Benchmark]: Boogie Preprocessor took 53.20ms. Allocated memory is still 176.2MB. Free memory was 102.7MB in the beginning and 99.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 22:57:14,788 INFO L158 Benchmark]: RCFGBuilder took 425.05ms. Allocated memory is still 176.2MB. Free memory was 99.9MB in the beginning and 84.5MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 22:57:14,789 INFO L158 Benchmark]: TraceAbstraction took 1312.93ms. Allocated memory was 176.2MB in the beginning and 222.3MB in the end (delta: 46.1MB). Free memory was 83.9MB in the beginning and 159.2MB in the end (delta: -75.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:57:14,789 INFO L158 Benchmark]: Witness Printer took 4.44ms. Allocated memory is still 222.3MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:57:14,791 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 176.2MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.71ms. Allocated memory is still 176.2MB. Free memory was 119.5MB in the beginning and 105.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.33ms. Allocated memory is still 176.2MB. Free memory was 105.4MB in the beginning and 103.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.20ms. Allocated memory is still 176.2MB. Free memory was 102.7MB in the beginning and 99.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 425.05ms. Allocated memory is still 176.2MB. Free memory was 99.9MB in the beginning and 84.5MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1312.93ms. Allocated memory was 176.2MB in the beginning and 222.3MB in the end (delta: 46.1MB). Free memory was 83.9MB in the beginning and 159.2MB in the end (delta: -75.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.44ms. Allocated memory is still 222.3MB. Free memory is still 159.2MB. 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 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 8.3; [L24] float var_1_3 = 2.25; [L25] float var_1_4 = 10.3; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] signed long int var_1_7 = 128; [L29] float var_1_8 = 9.8; [L30] signed long int var_1_9 = -256; [L31] unsigned short int var_1_10 = 5; [L32] signed char var_1_11 = 8; [L33] signed long int var_1_12 = 2; [L34] unsigned short int var_1_13 = 32; [L35] unsigned short int var_1_14 = 1; [L36] unsigned short int last_1_var_1_10 = 5; VAL [isInitial=0, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_2=83/10, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_2=83/10, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L62] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L63] var_1_3 = __VERIFIER_nondet_float() [L64] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L64] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L65] var_1_4 = __VERIFIER_nondet_float() [L66] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L66] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L67] var_1_5 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L68] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L69] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L69] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L70] var_1_6 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L71] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L72] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L72] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L73] var_1_8 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-256] [L74] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-256] [L75] var_1_9 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_9 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L76] RET assume_abort_if_not(var_1_9 >= -2147483647) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L77] CALL assume_abort_if_not(var_1_9 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L77] RET assume_abort_if_not(var_1_9 <= 2147483646) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L78] var_1_11 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_11 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L79] RET assume_abort_if_not(var_1_11 >= -128) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L80] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L80] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L81] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L81] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L82] var_1_12 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L83] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L84] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L84] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L85] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L85] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L86] var_1_13 = __VERIFIER_nondet_ushort() [L87] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L87] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L88] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L88] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L89] var_1_14 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L90] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L91] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L91] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L105] RET updateVariables() [L106] CALL step() [L40] COND TRUE var_1_4 <= (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) * var_1_8) [L41] var_1_7 = ((((-200) > (last_1_var_1_10)) ? (-200) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_9=-2147483647] [L45] COND FALSE !(var_1_8 > var_1_4) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_9=-2147483647] [L56] COND TRUE ((((1.1f) < (var_1_2)) ? (1.1f) : (var_1_2))) > (var_1_3 * var_1_4) [L57] var_1_1 = (var_1_5 && var_1_6) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_9=-2147483647] [L106] RET step() [L107] CALL, EXPR property() [L97-L98] return (((((((1.1f) < (var_1_2)) ? (1.1f) : (var_1_2))) > (var_1_3 * var_1_4)) ? (var_1_1 == ((unsigned char) (var_1_5 && var_1_6))) : 1) && ((var_1_4 <= (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) * var_1_8)) ? (var_1_7 == ((signed long int) ((((-200) > (last_1_var_1_10)) ? (-200) : (last_1_var_1_10))))) : (var_1_7 == ((signed long int) last_1_var_1_10)))) && ((var_1_8 > var_1_4) ? ((! var_1_6) ? (((var_1_9 / ((((var_1_11) > (-64)) ? (var_1_11) : (-64)))) < (var_1_7 / var_1_12)) ? (var_1_10 == ((unsigned short int) var_1_13)) : (var_1_10 == ((unsigned short int) var_1_13))) : (var_1_10 == ((unsigned short int) var_1_14))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_9=-2147483647] [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_9=-2147483647] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_9=-2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 75 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 244 SizeOfPredicates, 0 NumberOfNonLiveVariables, 273 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1482/1520 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-18 22:57:14,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-63.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 4464cb734770b9d0fa9d6e2642392f2055c585b5ff2c6b71c083265ca3731e1b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:57:16,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:57:17,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 22:57:17,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:57:17,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:57:17,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:57:17,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:57:17,062 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:57:17,063 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:57:17,064 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:57:17,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:57:17,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:57:17,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:57:17,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:57:17,067 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:57:17,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:57:17,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:57:17,068 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:57:17,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:57:17,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:57:17,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:57:17,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:57:17,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:57:17,073 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 22:57:17,073 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 22:57:17,073 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:57:17,073 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 22:57:17,073 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:57:17,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:57:17,074 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:57:17,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:57:17,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:57:17,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:57:17,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:57:17,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:57:17,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:57:17,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:57:17,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:57:17,084 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 22:57:17,085 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 22:57:17,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:57:17,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:57:17,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:57:17,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:57:17,087 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 -> 4464cb734770b9d0fa9d6e2642392f2055c585b5ff2c6b71c083265ca3731e1b [2024-11-18 22:57:17,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:57:17,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:57:17,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:57:17,405 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:57:17,405 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:57:17,407 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-63.i [2024-11-18 22:57:18,939 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:57:19,144 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:57:19,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-63.i [2024-11-18 22:57:19,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc42316c6/fb8316da4e6f49e59b079a608f622a97/FLAG42e35a42b [2024-11-18 22:57:19,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc42316c6/fb8316da4e6f49e59b079a608f622a97 [2024-11-18 22:57:19,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:57:19,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:57:19,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:57:19,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:57:19,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:57:19,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:57:19" (1/1) ... [2024-11-18 22:57:19,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf1ffa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:19, skipping insertion in model container [2024-11-18 22:57:19,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:57:19" (1/1) ... [2024-11-18 22:57:19,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:57:19,741 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-63.i[915,928] [2024-11-18 22:57:19,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:57:19,817 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:57:19,832 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-63.i[915,928] [2024-11-18 22:57:19,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:57:19,882 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:57:19,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:19 WrapperNode [2024-11-18 22:57:19,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:57:19,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:57:19,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:57:19,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:57:19,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:19" (1/1) ... [2024-11-18 22:57:19,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:19" (1/1) ... [2024-11-18 22:57:19,936 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-11-18 22:57:19,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:57:19,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:57:19,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:57:19,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:57:19,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:19" (1/1) ... [2024-11-18 22:57:19,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:19" (1/1) ... [2024-11-18 22:57:19,955 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:19" (1/1) ... [2024-11-18 22:57:19,973 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-18 22:57:19,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:19" (1/1) ... [2024-11-18 22:57:19,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:19" (1/1) ... [2024-11-18 22:57:19,983 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:19" (1/1) ... [2024-11-18 22:57:19,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:19" (1/1) ... [2024-11-18 22:57:19,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:19" (1/1) ... [2024-11-18 22:57:19,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:19" (1/1) ... [2024-11-18 22:57:19,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:57:20,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:57:20,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:57:20,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:57:20,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:19" (1/1) ... [2024-11-18 22:57:20,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:57:20,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:57:20,041 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-18 22:57:20,047 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-18 22:57:20,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:57:20,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 22:57:20,094 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:57:20,094 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:57:20,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:57:20,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:57:20,163 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:57:20,164 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:57:21,829 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-18 22:57:21,829 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:57:21,840 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:57:21,841 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:57:21,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:57:21 BoogieIcfgContainer [2024-11-18 22:57:21,842 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:57:21,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:57:21,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:57:21,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:57:21,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:57:19" (1/3) ... [2024-11-18 22:57:21,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6b5a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:57:21, skipping insertion in model container [2024-11-18 22:57:21,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:19" (2/3) ... [2024-11-18 22:57:21,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6b5a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:57:21, skipping insertion in model container [2024-11-18 22:57:21,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:57:21" (3/3) ... [2024-11-18 22:57:21,851 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-63.i [2024-11-18 22:57:21,865 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:57:21,866 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:57:21,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:57:21,926 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;@6d38ff63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:57:21,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:57:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 22:57:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-18 22:57:21,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:57:21,945 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:57:21,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:57:21,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:57:21,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1110012742, now seen corresponding path program 1 times [2024-11-18 22:57:21,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:57:21,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834022680] [2024-11-18 22:57:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:57:21,961 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-18 22:57:21,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:57:21,965 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-18 22:57:21,966 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-18 22:57:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:57:22,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:57:22,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:57:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-18 22:57:22,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:57:22,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:57:22,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834022680] [2024-11-18 22:57:22,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834022680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:57:22,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:57:22,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 22:57:22,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963781462] [2024-11-18 22:57:22,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:57:22,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:57:22,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:57:22,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:57:22,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:57:22,374 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:57:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:57:22,406 INFO L93 Difference]: Finished difference Result 103 states and 178 transitions. [2024-11-18 22:57:22,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:57:22,408 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 123 [2024-11-18 22:57:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:57:22,417 INFO L225 Difference]: With dead ends: 103 [2024-11-18 22:57:22,417 INFO L226 Difference]: Without dead ends: 51 [2024-11-18 22:57:22,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:57:22,426 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:57:22,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:57:22,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-18 22:57:22,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-18 22:57:22,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 22:57:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2024-11-18 22:57:22,466 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 123 [2024-11-18 22:57:22,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:57:22,466 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2024-11-18 22:57:22,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-18 22:57:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2024-11-18 22:57:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-18 22:57:22,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:57:22,470 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:57:22,481 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-18 22:57:22,670 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-18 22:57:22,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:57:22,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:57:22,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1909930626, now seen corresponding path program 1 times [2024-11-18 22:57:22,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:57:22,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615338250] [2024-11-18 22:57:22,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:57:22,673 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-18 22:57:22,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:57:22,678 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-18 22:57:22,679 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-18 22:57:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:57:22,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 22:57:22,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:57:43,704 WARN L286 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-18 22:58:03,835 WARN L286 SmtUtils]: Spent 7.36s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)