./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_variablewrapping_normal_file-52.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 58f9160d5aee9cc43b7c3e9a23be0e38f5b1f7b528eca50b07239bd3dfe5d081 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:21:25,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:21:25,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:21:25,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:21:25,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:21:25,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:21:25,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:21:25,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:21:25,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:21:25,140 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:21:25,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:21:25,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:21:25,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:21:25,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:21:25,141 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:21:25,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:21:25,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:21:25,143 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:21:25,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:21:25,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:21:25,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:21:25,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:21:25,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:21:25,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:21:25,147 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:21:25,147 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:21:25,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:21:25,147 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:21:25,148 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:21:25,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:21:25,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:21:25,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:21:25,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:21:25,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:21:25,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:21:25,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:21:25,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:21:25,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:21:25,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:21:25,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:21:25,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:21:25,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:21:25,150 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 -> 58f9160d5aee9cc43b7c3e9a23be0e38f5b1f7b528eca50b07239bd3dfe5d081 [2024-11-09 01:21:25,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:21:25,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:21:25,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:21:25,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:21:25,402 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:21:25,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i [2024-11-09 01:21:26,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:21:26,838 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:21:26,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i [2024-11-09 01:21:26,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8ed1fa16/d8bed25cdf2b4d0eb649cad3ef6cb0b6/FLAG36f5367f2 [2024-11-09 01:21:26,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8ed1fa16/d8bed25cdf2b4d0eb649cad3ef6cb0b6 [2024-11-09 01:21:26,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:21:26,873 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:21:26,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:21:26,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:21:26,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:21:26,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:21:26" (1/1) ... [2024-11-09 01:21:26,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c73f9c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:26, skipping insertion in model container [2024-11-09 01:21:26,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:21:26" (1/1) ... [2024-11-09 01:21:26,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:21:27,053 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_variablewrapping_normal_file-52.i[913,926] [2024-11-09 01:21:27,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:21:27,142 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:21:27,153 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_variablewrapping_normal_file-52.i[913,926] [2024-11-09 01:21:27,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:21:27,224 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:21:27,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:27 WrapperNode [2024-11-09 01:21:27,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:21:27,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:21:27,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:21:27,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:21:27,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:27" (1/1) ... [2024-11-09 01:21:27,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:27" (1/1) ... [2024-11-09 01:21:27,274 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-09 01:21:27,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:21:27,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:21:27,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:21:27,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:21:27,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:27" (1/1) ... [2024-11-09 01:21:27,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:27" (1/1) ... [2024-11-09 01:21:27,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:27" (1/1) ... [2024-11-09 01:21:27,303 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-09 01:21:27,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:27" (1/1) ... [2024-11-09 01:21:27,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:27" (1/1) ... [2024-11-09 01:21:27,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:27" (1/1) ... [2024-11-09 01:21:27,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:27" (1/1) ... [2024-11-09 01:21:27,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:27" (1/1) ... [2024-11-09 01:21:27,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:27" (1/1) ... [2024-11-09 01:21:27,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:21:27,315 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:21:27,315 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:21:27,315 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:21:27,316 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:27" (1/1) ... [2024-11-09 01:21:27,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:21:27,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:21:27,352 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-09 01:21:27,356 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-09 01:21:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:21:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:21:27,391 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:21:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:21:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:21:27,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:21:27,454 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:21:27,456 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:21:27,678 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-09 01:21:27,678 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:21:27,697 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:21:27,701 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:21:27,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:21:27 BoogieIcfgContainer [2024-11-09 01:21:27,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:21:27,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:21:27,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:21:27,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:21:27,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:21:26" (1/3) ... [2024-11-09 01:21:27,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f9eaa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:21:27, skipping insertion in model container [2024-11-09 01:21:27,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:27" (2/3) ... [2024-11-09 01:21:27,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f9eaa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:21:27, skipping insertion in model container [2024-11-09 01:21:27,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:21:27" (3/3) ... [2024-11-09 01:21:27,712 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-52.i [2024-11-09 01:21:27,728 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:21:27,728 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:21:27,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:21:27,792 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;@ed2aa01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:21:27,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:21:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:21:27,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:21:27,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:27,807 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:21:27,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:21:27,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:27,811 INFO L85 PathProgramCache]: Analyzing trace with hash 752094706, now seen corresponding path program 1 times [2024-11-09 01:21:27,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:21:27,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547546311] [2024-11-09 01:21:27,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:27,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:21:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:21:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:21:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:21:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:21:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:21:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:21:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:21:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:21:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:21:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:21:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:21:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:21:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:21:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:21:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:21:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:21:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:21:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 01:21:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:21:28,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:21:28,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547546311] [2024-11-09 01:21:28,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547546311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:21:28,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:21:28,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:21:28,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931376896] [2024-11-09 01:21:28,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:21:28,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:21:28,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:21:28,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:21:28,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:21:28,158 INFO L87 Difference]: Start difference. First operand has 63 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:21:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:28,183 INFO L93 Difference]: Finished difference Result 119 states and 198 transitions. [2024-11-09 01:21:28,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:21:28,187 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2024-11-09 01:21:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:28,193 INFO L225 Difference]: With dead ends: 119 [2024-11-09 01:21:28,194 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 01:21:28,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-09 01:21:28,199 INFO L432 NwaCegarLoop]: 86 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, 86 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-09 01:21:28,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:21:28,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 01:21:28,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-09 01:21:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:21:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-09 01:21:28,234 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 116 [2024-11-09 01:21:28,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:28,234 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-09 01:21:28,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:21:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-09 01:21:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:21:28,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:28,237 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:21:28,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:21:28,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:21:28,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:28,237 INFO L85 PathProgramCache]: Analyzing trace with hash 2118990778, now seen corresponding path program 1 times [2024-11-09 01:21:28,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:21:28,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556538297] [2024-11-09 01:21:28,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:28,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:21:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:21:28,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:21:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:21:28,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:21:28,543 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:21:28,544 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:21:28,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:21:28,549 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 01:21:28,633 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:21:28,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:21:28 BoogieIcfgContainer [2024-11-09 01:21:28,635 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:21:28,636 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:21:28,636 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:21:28,636 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:21:28,637 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:21:27" (3/4) ... [2024-11-09 01:21:28,638 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:21:28,639 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:21:28,640 INFO L158 Benchmark]: Toolchain (without parser) took 1766.61ms. Allocated memory is still 155.2MB. Free memory was 97.5MB in the beginning and 102.1MB in the end (delta: -4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:21:28,640 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:21:28,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.25ms. Allocated memory is still 155.2MB. Free memory was 97.0MB in the beginning and 125.6MB in the end (delta: -28.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 01:21:28,641 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.60ms. Allocated memory is still 155.2MB. Free memory was 125.6MB in the beginning and 123.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:21:28,641 INFO L158 Benchmark]: Boogie Preprocessor took 39.63ms. Allocated memory is still 155.2MB. Free memory was 123.5MB in the beginning and 120.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:21:28,642 INFO L158 Benchmark]: RCFGBuilder took 386.66ms. Allocated memory is still 155.2MB. Free memory was 120.7MB in the beginning and 103.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 01:21:28,642 INFO L158 Benchmark]: TraceAbstraction took 932.22ms. Allocated memory is still 155.2MB. Free memory was 102.5MB in the beginning and 102.1MB in the end (delta: 481.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:21:28,642 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 155.2MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:21:28,644 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.21ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.25ms. Allocated memory is still 155.2MB. Free memory was 97.0MB in the beginning and 125.6MB in the end (delta: -28.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.60ms. Allocated memory is still 155.2MB. Free memory was 125.6MB in the beginning and 123.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.63ms. Allocated memory is still 155.2MB. Free memory was 123.5MB in the beginning and 120.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 386.66ms. Allocated memory is still 155.2MB. Free memory was 120.7MB in the beginning and 103.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 932.22ms. Allocated memory is still 155.2MB. Free memory was 102.5MB in the beginning and 102.1MB in the end (delta: 481.6kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 155.2MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] signed short int var_1_3 = 32; [L24] signed short int var_1_4 = -1; [L25] unsigned char var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] double var_1_10 = 25.7; [L31] double var_1_11 = 256.5; [L32] double var_1_12 = 0.0; [L33] double var_1_13 = 31.1; [L34] double var_1_14 = 256.6; [L35] unsigned long int var_1_15 = 8; [L36] unsigned char var_1_16 = 16; VAL [isInitial=0, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=32, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] FCALL updateLastVariables() [L106] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] CALL assume_abort_if_not(var_1_3 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] RET assume_abort_if_not(var_1_3 <= 32766) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L68] var_1_4 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_4 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L69] RET assume_abort_if_not(var_1_4 >= -16383) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L70] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L71] var_1_6 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L72] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L73] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L74] var_1_7 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L75] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L76] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L77] var_1_8 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L79] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L82] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L83] var_1_11 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L84] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L85] var_1_12 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L86] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L87] var_1_13 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L89] var_1_14 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L91] var_1_16 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L92] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=257/10, var_1_15=8, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_16 <= 30) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_16 <= 30) VAL [isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L106] RET updateVariables() [L107] CALL step() [L40] signed short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=0, var_1_10=257/10, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L41] COND FALSE !(stepLocal_0 > ((var_1_4 / -256) * 32)) [L48] var_1_5 = var_1_9 VAL [isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L50] COND TRUE \read(var_1_7) [L51] var_1_10 = (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))) VAL [isInitial=1, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L53] COND TRUE var_1_10 < 63.75 [L54] var_1_1 = (10 - var_1_3) VAL [isInitial=1, var_1_15=8, var_1_16=0, var_1_1=10, var_1_3=0, var_1_4=-257, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L58] COND FALSE !(! (var_1_13 < (127.125 / var_1_12))) VAL [isInitial=1, var_1_15=8, var_1_16=0, var_1_1=10, var_1_3=0, var_1_4=-257, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR ((((var_1_10 < 63.75) ? (var_1_1 == ((signed short int) (10 - var_1_3))) : (var_1_1 == ((signed short int) (4 + var_1_4)))) && ((var_1_3 > ((var_1_4 / -256) * 32)) ? (var_1_6 ? (var_1_5 == ((unsigned char) (! (var_1_7 && var_1_8)))) : (var_1_5 == ((unsigned char) var_1_8))) : (var_1_5 == ((unsigned char) var_1_9)))) && (var_1_7 ? (var_1_10 == ((double) (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))))) : 1)) && ((! (var_1_13 < (127.125 / var_1_12))) ? ((var_1_1 <= ((var_1_4 * var_1_3) + (-2 << var_1_16))) ? (var_1_15 == ((unsigned long int) var_1_3)) : 1) : 1) VAL [isInitial=1, var_1_15=8, var_1_16=0, var_1_1=10, var_1_3=0, var_1_4=-257, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L98-L99] return ((((var_1_10 < 63.75) ? (var_1_1 == ((signed short int) (10 - var_1_3))) : (var_1_1 == ((signed short int) (4 + var_1_4)))) && ((var_1_3 > ((var_1_4 / -256) * 32)) ? (var_1_6 ? (var_1_5 == ((unsigned char) (! (var_1_7 && var_1_8)))) : (var_1_5 == ((unsigned char) var_1_8))) : (var_1_5 == ((unsigned char) var_1_9)))) && (var_1_7 ? (var_1_10 == ((double) (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))))) : 1)) && ((! (var_1_13 < (127.125 / var_1_12))) ? ((var_1_1 <= ((var_1_4 * var_1_3) + (-2 << var_1_16))) ? (var_1_15 == ((unsigned long int) var_1_3)) : 1) : 1) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_15=8, var_1_16=0, var_1_1=10, var_1_3=0, var_1_4=-257, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_15=8, var_1_16=0, var_1_1=10, var_1_3=0, var_1_4=-257, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 18, 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, 86 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, 86 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred 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, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 612/612 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-09 01:21:28,671 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_variablewrapping_normal_file-52.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 58f9160d5aee9cc43b7c3e9a23be0e38f5b1f7b528eca50b07239bd3dfe5d081 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:21:30,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:21:30,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:21:30,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:21:30,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:21:30,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:21:30,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:21:30,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:21:30,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:21:30,683 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:21:30,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:21:30,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:21:30,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:21:30,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:21:30,685 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:21:30,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:21:30,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:21:30,688 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:21:30,689 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:21:30,689 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:21:30,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:21:30,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:21:30,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:21:30,690 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:21:30,690 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:21:30,691 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:21:30,691 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:21:30,691 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:21:30,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:21:30,691 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:21:30,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:21:30,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:21:30,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:21:30,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:21:30,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:21:30,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:21:30,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:21:30,694 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:21:30,694 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:21:30,694 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:21:30,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:21:30,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:21:30,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:21:30,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:21:30,695 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 -> 58f9160d5aee9cc43b7c3e9a23be0e38f5b1f7b528eca50b07239bd3dfe5d081 [2024-11-09 01:21:30,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:21:31,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:21:31,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:21:31,022 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:21:31,022 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:21:31,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i [2024-11-09 01:21:32,469 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:21:32,645 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:21:32,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i [2024-11-09 01:21:32,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/275106396/39929e64463e497a86bafcec6dcbcad2/FLAG3b0d99232 [2024-11-09 01:21:33,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/275106396/39929e64463e497a86bafcec6dcbcad2 [2024-11-09 01:21:33,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:21:33,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:21:33,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:21:33,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:21:33,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:21:33,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:21:33" (1/1) ... [2024-11-09 01:21:33,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@656effd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:33, skipping insertion in model container [2024-11-09 01:21:33,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:21:33" (1/1) ... [2024-11-09 01:21:33,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:21:33,252 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_variablewrapping_normal_file-52.i[913,926] [2024-11-09 01:21:33,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:21:33,318 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:21:33,328 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_variablewrapping_normal_file-52.i[913,926] [2024-11-09 01:21:33,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:21:33,374 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:21:33,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:33 WrapperNode [2024-11-09 01:21:33,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:21:33,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:21:33,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:21:33,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:21:33,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:33" (1/1) ... [2024-11-09 01:21:33,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:33" (1/1) ... [2024-11-09 01:21:33,417 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-11-09 01:21:33,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:21:33,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:21:33,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:21:33,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:21:33,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:33" (1/1) ... [2024-11-09 01:21:33,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:33" (1/1) ... [2024-11-09 01:21:33,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:33" (1/1) ... [2024-11-09 01:21:33,451 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-09 01:21:33,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:33" (1/1) ... [2024-11-09 01:21:33,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:33" (1/1) ... [2024-11-09 01:21:33,459 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:33" (1/1) ... [2024-11-09 01:21:33,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:33" (1/1) ... [2024-11-09 01:21:33,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:33" (1/1) ... [2024-11-09 01:21:33,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:33" (1/1) ... [2024-11-09 01:21:33,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:21:33,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:21:33,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:21:33,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:21:33,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:33" (1/1) ... [2024-11-09 01:21:33,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:21:33,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:21:33,512 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-09 01:21:33,518 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-09 01:21:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:21:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:21:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:21:33,559 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:21:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:21:33,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:21:33,634 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:21:33,636 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:21:43,107 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 01:21:43,108 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:21:43,121 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:21:43,122 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:21:43,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:21:43 BoogieIcfgContainer [2024-11-09 01:21:43,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:21:43,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:21:43,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:21:43,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:21:43,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:21:33" (1/3) ... [2024-11-09 01:21:43,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9edeee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:21:43, skipping insertion in model container [2024-11-09 01:21:43,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:33" (2/3) ... [2024-11-09 01:21:43,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9edeee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:21:43, skipping insertion in model container [2024-11-09 01:21:43,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:21:43" (3/3) ... [2024-11-09 01:21:43,130 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-52.i [2024-11-09 01:21:43,148 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:21:43,149 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:21:43,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:21:43,209 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;@3122f7f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:21:43,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:21:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:21:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 01:21:43,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:43,228 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:21:43,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:21:43,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:43,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1685718365, now seen corresponding path program 1 times [2024-11-09 01:21:43,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:21:43,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705968370] [2024-11-09 01:21:43,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:43,248 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-09 01:21:43,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:21:43,251 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-09 01:21:43,252 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-09 01:21:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:44,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:21:44,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:21:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-09 01:21:44,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:21:44,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:21:44,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705968370] [2024-11-09 01:21:44,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705968370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:21:44,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:21:44,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:21:44,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847970352] [2024-11-09 01:21:44,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:21:44,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:21:44,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:21:44,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:21:44,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:21:44,160 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:21:44,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:44,188 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2024-11-09 01:21:44,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:21:44,191 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2024-11-09 01:21:44,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:44,196 INFO L225 Difference]: With dead ends: 101 [2024-11-09 01:21:44,196 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 01:21:44,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-09 01:21:44,201 INFO L432 NwaCegarLoop]: 73 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, 73 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-09 01:21:44,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:21:44,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 01:21:44,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 01:21:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:21:44,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-11-09 01:21:44,239 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 114 [2024-11-09 01:21:44,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:44,240 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-11-09 01:21:44,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:21:44,240 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2024-11-09 01:21:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 01:21:44,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:44,244 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:21:44,267 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-09 01:21:44,445 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-09 01:21:44,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:21:44,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:44,447 INFO L85 PathProgramCache]: Analyzing trace with hash 58718827, now seen corresponding path program 1 times [2024-11-09 01:21:44,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:21:44,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171748586] [2024-11-09 01:21:44,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:44,448 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-09 01:21:44,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:21:44,450 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-09 01:21:44,451 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-09 01:21:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:45,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:21:45,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:22:20,039 WARN L286 SmtUtils]: Spent 14.43s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:22:25,284 WARN L286 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 01:22:31,406 WARN L286 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)