./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 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:00:18,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:00:18,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:00:18,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:00:18,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:00:18,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:00:18,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:00:18,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:00:18,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:00:18,864 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:00:18,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:00:18,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:00:18,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:00:18,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:00:18,867 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:00:18,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:00:18,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:00:18,868 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:00:18,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:00:18,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:00:18,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:00:18,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:00:18,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:00:18,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:00:18,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:00:18,872 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:00:18,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:00:18,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:00:18,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:00:18,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:00:18,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:00:18,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:00:18,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:00:18,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:00:18,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:00:18,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:00:18,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:00:18,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:00:18,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:00:18,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:00:18,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:00:18,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:00:18,876 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-12 07:00:19,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:00:19,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:00:19,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:00:19,088 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:00:19,088 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:00:19,089 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-12 07:00:20,281 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:00:20,455 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:00:20,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i [2024-11-12 07:00:20,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a62707067/fd301aab4e4b43e3bc2bb0a6aed5f9aa/FLAG6058df2ff [2024-11-12 07:00:20,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a62707067/fd301aab4e4b43e3bc2bb0a6aed5f9aa [2024-11-12 07:00:20,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:00:20,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:00:20,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:00:20,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:00:20,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:00:20,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:00:20" (1/1) ... [2024-11-12 07:00:20,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a18d3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:20, skipping insertion in model container [2024-11-12 07:00:20,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:00:20" (1/1) ... [2024-11-12 07:00:20,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:00:20,670 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-12 07:00:20,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:00:20,727 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:00:20,737 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-12 07:00:20,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:00:20,782 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:00:20,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:20 WrapperNode [2024-11-12 07:00:20,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:00:20,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:00:20,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:00:20,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:00:20,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:20" (1/1) ... [2024-11-12 07:00:20,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:20" (1/1) ... [2024-11-12 07:00:20,821 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-12 07:00:20,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:00:20,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:00:20,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:00:20,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:00:20,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:20" (1/1) ... [2024-11-12 07:00:20,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:20" (1/1) ... [2024-11-12 07:00:20,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:20" (1/1) ... [2024-11-12 07:00:20,862 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 07:00:20,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:20" (1/1) ... [2024-11-12 07:00:20,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:20" (1/1) ... [2024-11-12 07:00:20,878 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:20" (1/1) ... [2024-11-12 07:00:20,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:20" (1/1) ... [2024-11-12 07:00:20,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:20" (1/1) ... [2024-11-12 07:00:20,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:20" (1/1) ... [2024-11-12 07:00:20,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:00:20,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:00:20,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:00:20,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:00:20,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:20" (1/1) ... [2024-11-12 07:00:20,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:00:20,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:00:20,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:00:20,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:00:20,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:00:20,989 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:00:20,990 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:00:20,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:00:20,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:00:20,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:00:21,063 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:00:21,065 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:00:21,278 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-12 07:00:21,278 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:00:21,291 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:00:21,292 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:00:21,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:00:21 BoogieIcfgContainer [2024-11-12 07:00:21,292 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:00:21,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:00:21,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:00:21,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:00:21,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:00:20" (1/3) ... [2024-11-12 07:00:21,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6a9eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:00:21, skipping insertion in model container [2024-11-12 07:00:21,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:20" (2/3) ... [2024-11-12 07:00:21,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6a9eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:00:21, skipping insertion in model container [2024-11-12 07:00:21,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:00:21" (3/3) ... [2024-11-12 07:00:21,303 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-52.i [2024-11-12 07:00:21,315 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:00:21,316 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:00:21,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:00:21,368 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;@4810741b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:00:21,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:00:21,371 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-12 07:00:21,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 07:00:21,378 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:00:21,379 INFO L218 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-12 07:00:21,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:00:21,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:00:21,384 INFO L85 PathProgramCache]: Analyzing trace with hash 752094706, now seen corresponding path program 1 times [2024-11-12 07:00:21,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:00:21,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149125741] [2024-11-12 07:00:21,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:00:21,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:00:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:00:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 07:00:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 07:00:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 07:00:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 07:00:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:00:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:00:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 07:00:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 07:00:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 07:00:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 07:00:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:00:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:00:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:00:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:00:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:00:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:00:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 07:00:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:21,635 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-12 07:00:21,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:00:21,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149125741] [2024-11-12 07:00:21,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149125741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:00:21,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:00:21,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:00:21,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315083818] [2024-11-12 07:00:21,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:00:21,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:00:21,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:00:21,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:00:21,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:00:21,660 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-12 07:00:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:00:21,680 INFO L93 Difference]: Finished difference Result 119 states and 198 transitions. [2024-11-12 07:00:21,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:00:21,682 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-12 07:00:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:00:21,690 INFO L225 Difference]: With dead ends: 119 [2024-11-12 07:00:21,691 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 07:00:21,693 INFO L434 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-12 07:00:21,695 INFO L435 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-12 07:00:21,696 INFO L436 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-12 07:00:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 07:00:21,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-12 07:00:21,726 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-12 07:00:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-12 07:00:21,728 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 116 [2024-11-12 07:00:21,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:00:21,729 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-12 07:00:21,729 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-12 07:00:21,729 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-12 07:00:21,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 07:00:21,731 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:00:21,731 INFO L218 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-12 07:00:21,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:00:21,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:00:21,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:00:21,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2118990778, now seen corresponding path program 1 times [2024-11-12 07:00:21,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:00:21,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076482301] [2024-11-12 07:00:21,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:00:21,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:00:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:00:21,843 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:00:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:00:21,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:00:21,953 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:00:21,955 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:00:21,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:00:21,959 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 07:00:22,022 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:00:22,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:00:22 BoogieIcfgContainer [2024-11-12 07:00:22,025 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:00:22,025 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:00:22,026 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:00:22,026 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:00:22,026 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:00:21" (3/4) ... [2024-11-12 07:00:22,031 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:00:22,032 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:00:22,033 INFO L158 Benchmark]: Toolchain (without parser) took 1549.10ms. Allocated memory is still 180.4MB. Free memory was 110.2MB in the beginning and 67.9MB in the end (delta: 42.3MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2024-11-12 07:00:22,033 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 180.4MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:00:22,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.50ms. Allocated memory is still 180.4MB. Free memory was 110.0MB in the beginning and 95.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 07:00:22,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.25ms. Allocated memory is still 180.4MB. Free memory was 95.8MB in the beginning and 93.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 07:00:22,034 INFO L158 Benchmark]: Boogie Preprocessor took 73.67ms. Allocated memory is still 180.4MB. Free memory was 93.5MB in the beginning and 150.6MB in the end (delta: -57.2MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-11-12 07:00:22,034 INFO L158 Benchmark]: RCFGBuilder took 395.37ms. Allocated memory is still 180.4MB. Free memory was 150.6MB in the beginning and 132.8MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 07:00:22,035 INFO L158 Benchmark]: TraceAbstraction took 728.24ms. Allocated memory is still 180.4MB. Free memory was 131.9MB in the beginning and 68.8MB in the end (delta: 63.1MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-11-12 07:00:22,035 INFO L158 Benchmark]: Witness Printer took 6.81ms. Allocated memory is still 180.4MB. Free memory was 68.8MB in the beginning and 67.9MB in the end (delta: 897.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 07:00:22,039 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.38ms. Allocated memory is still 180.4MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.50ms. Allocated memory is still 180.4MB. Free memory was 110.0MB in the beginning and 95.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.25ms. Allocated memory is still 180.4MB. Free memory was 95.8MB in the beginning and 93.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.67ms. Allocated memory is still 180.4MB. Free memory was 93.5MB in the beginning and 150.6MB in the end (delta: -57.2MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * RCFGBuilder took 395.37ms. Allocated memory is still 180.4MB. Free memory was 150.6MB in the beginning and 132.8MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 728.24ms. Allocated memory is still 180.4MB. Free memory was 131.9MB in the beginning and 68.8MB in the end (delta: 63.1MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Witness Printer took 6.81ms. Allocated memory is still 180.4MB. Free memory was 68.8MB in the beginning and 67.9MB in the end (delta: 897.2kB). Peak memory consumption was 2.1MB. 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.6s, 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.1s SatisfiabilityAnalysisTime, 0.1s 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-12 07:00:22,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:00:23,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:00:23,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:00:23,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:00:23,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:00:23,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:00:23,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:00:23,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:00:23,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:00:23,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:00:23,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:00:23,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:00:23,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:00:23,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:00:23,983 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:00:23,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:00:23,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:00:23,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:00:23,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:00:23,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:00:23,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:00:23,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:00:23,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:00:23,989 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:00:23,989 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:00:23,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:00:23,989 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:00:23,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:00:23,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:00:23,989 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:00:23,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:00:23,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:00:23,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:00:23,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:00:23,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:00:23,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:00:23,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:00:23,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:00:23,991 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:00:23,991 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:00:23,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:00:23,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:00:23,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:00:23,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:00:23,993 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-12 07:00:24,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:00:24,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:00:24,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:00:24,262 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:00:24,263 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:00:24,264 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-12 07:00:25,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:00:25,675 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:00:25,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i [2024-11-12 07:00:25,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8af6ce9b/740d82b848ca488db06cba1b93efa064/FLAG219e1c702 [2024-11-12 07:00:26,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8af6ce9b/740d82b848ca488db06cba1b93efa064 [2024-11-12 07:00:26,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:00:26,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:00:26,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:00:26,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:00:26,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:00:26,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:00:26" (1/1) ... [2024-11-12 07:00:26,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d63c0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:26, skipping insertion in model container [2024-11-12 07:00:26,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:00:26" (1/1) ... [2024-11-12 07:00:26,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:00:26,250 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-12 07:00:26,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:00:26,312 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:00:26,323 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-12 07:00:26,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:00:26,364 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:00:26,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:26 WrapperNode [2024-11-12 07:00:26,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:00:26,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:00:26,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:00:26,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:00:26,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:26" (1/1) ... [2024-11-12 07:00:26,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:26" (1/1) ... [2024-11-12 07:00:26,414 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-11-12 07:00:26,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:00:26,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:00:26,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:00:26,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:00:26,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:26" (1/1) ... [2024-11-12 07:00:26,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:26" (1/1) ... [2024-11-12 07:00:26,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:26" (1/1) ... [2024-11-12 07:00:26,443 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 07:00:26,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:26" (1/1) ... [2024-11-12 07:00:26,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:26" (1/1) ... [2024-11-12 07:00:26,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:26" (1/1) ... [2024-11-12 07:00:26,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:26" (1/1) ... [2024-11-12 07:00:26,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:26" (1/1) ... [2024-11-12 07:00:26,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:26" (1/1) ... [2024-11-12 07:00:26,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:00:26,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:00:26,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:00:26,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:00:26,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:26" (1/1) ... [2024-11-12 07:00:26,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:00:26,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:00:26,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:00:26,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:00:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:00:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:00:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:00:26,543 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:00:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:00:26,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:00:26,615 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:00:26,618 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:00:35,401 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 07:00:35,402 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:00:35,411 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:00:35,411 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:00:35,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:00:35 BoogieIcfgContainer [2024-11-12 07:00:35,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:00:35,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:00:35,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:00:35,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:00:35,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:00:26" (1/3) ... [2024-11-12 07:00:35,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f5c91a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:00:35, skipping insertion in model container [2024-11-12 07:00:35,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:00:26" (2/3) ... [2024-11-12 07:00:35,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f5c91a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:00:35, skipping insertion in model container [2024-11-12 07:00:35,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:00:35" (3/3) ... [2024-11-12 07:00:35,419 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-52.i [2024-11-12 07:00:35,432 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:00:35,432 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:00:35,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:00:35,484 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;@5aebb09a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:00:35,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:00:35,492 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-12 07:00:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 07:00:35,500 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:00:35,500 INFO L218 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-12 07:00:35,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:00:35,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:00:35,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1685718365, now seen corresponding path program 1 times [2024-11-12 07:00:35,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:00:35,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383545438] [2024-11-12 07:00:35,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:00:35,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:00:35,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:00:35,520 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:00:35,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 07:00:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:36,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:00:36,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:00:36,363 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-12 07:00:36,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:00:36,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:00:36,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383545438] [2024-11-12 07:00:36,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383545438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:00:36,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:00:36,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:00:36,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636157057] [2024-11-12 07:00:36,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:00:36,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:00:36,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:00:36,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:00:36,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:00:36,389 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-12 07:00:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:00:36,406 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2024-11-12 07:00:36,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:00:36,409 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-12 07:00:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:00:36,414 INFO L225 Difference]: With dead ends: 101 [2024-11-12 07:00:36,415 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 07:00:36,418 INFO L434 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-12 07:00:36,421 INFO L435 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-12 07:00:36,422 INFO L436 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-12 07:00:36,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 07:00:36,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-12 07:00:36,451 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-12 07:00:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-11-12 07:00:36,457 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 114 [2024-11-12 07:00:36,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:00:36,457 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-11-12 07:00:36,458 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-12 07:00:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2024-11-12 07:00:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 07:00:36,460 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:00:36,460 INFO L218 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-12 07:00:36,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 07:00:36,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:00:36,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:00:36,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:00:36,662 INFO L85 PathProgramCache]: Analyzing trace with hash 58718827, now seen corresponding path program 1 times [2024-11-12 07:00:36,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:00:36,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345478092] [2024-11-12 07:00:36,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:00:36,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:00:36,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:00:36,664 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:00:36,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 07:00:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:00:37,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 07:00:37,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:01:06,088 WARN L286 SmtUtils]: Spent 10.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-12 07:01:56,300 WARN L286 SmtUtils]: Spent 21.37s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-12 07:02:04,643 WARN L286 SmtUtils]: Spent 8.33s 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)