./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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-17.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 a1b9f7d8308e518fe4c72a6190b2fee610f7c5e29f3d722e14bc1423462ff2ad --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:01:08,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:01:08,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:01:08,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:01:08,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:01:08,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:01:08,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:01:08,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:01:08,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:01:08,232 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:01:08,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:01:08,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:01:08,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:01:08,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:01:08,234 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:01:08,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:01:08,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:01:08,235 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:01:08,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:01:08,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:01:08,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:01:08,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:01:08,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:01:08,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:01:08,239 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:01:08,239 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:01:08,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:01:08,240 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:01:08,240 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:01:08,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:01:08,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:01:08,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:01:08,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:01:08,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:01:08,241 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:01:08,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:01:08,241 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:01:08,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:01:08,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:01:08,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:01:08,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:01:08,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:01:08,243 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 -> a1b9f7d8308e518fe4c72a6190b2fee610f7c5e29f3d722e14bc1423462ff2ad [2024-11-10 09:01:08,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:01:08,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:01:08,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:01:08,433 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:01:08,437 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:01:08,438 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-17.i [2024-11-10 09:01:09,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:01:10,133 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:01:10,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-17.i [2024-11-10 09:01:10,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15ac2bcb8/f117a144c55246418b0d32f6894da3a6/FLAGf9d453d50 [2024-11-10 09:01:10,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15ac2bcb8/f117a144c55246418b0d32f6894da3a6 [2024-11-10 09:01:10,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:01:10,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:01:10,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:01:10,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:01:10,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:01:10,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:01:10" (1/1) ... [2024-11-10 09:01:10,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38472143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:10, skipping insertion in model container [2024-11-10 09:01:10,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:01:10" (1/1) ... [2024-11-10 09:01:10,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:01:10,727 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-17.i[913,926] [2024-11-10 09:01:10,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:01:10,779 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:01:10,790 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-17.i[913,926] [2024-11-10 09:01:10,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:01:10,849 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:01:10,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:10 WrapperNode [2024-11-10 09:01:10,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:01:10,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:01:10,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:01:10,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:01:10,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:10" (1/1) ... [2024-11-10 09:01:10,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:10" (1/1) ... [2024-11-10 09:01:10,911 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-11-10 09:01:10,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:01:10,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:01:10,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:01:10,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:01:10,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:10" (1/1) ... [2024-11-10 09:01:10,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:10" (1/1) ... [2024-11-10 09:01:10,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:10" (1/1) ... [2024-11-10 09:01:10,942 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-10 09:01:10,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:10" (1/1) ... [2024-11-10 09:01:10,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:10" (1/1) ... [2024-11-10 09:01:10,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:10" (1/1) ... [2024-11-10 09:01:10,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:10" (1/1) ... [2024-11-10 09:01:10,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:10" (1/1) ... [2024-11-10 09:01:10,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:10" (1/1) ... [2024-11-10 09:01:10,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:01:10,956 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:01:10,956 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:01:10,956 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:01:10,957 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:10" (1/1) ... [2024-11-10 09:01:10,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:01:10,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:01:10,993 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-10 09:01:10,996 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-10 09:01:11,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:01:11,047 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:01:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:01:11,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:01:11,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:01:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:01:11,139 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:01:11,142 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:01:11,475 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 09:01:11,476 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:01:11,494 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:01:11,498 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:01:11,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:01:11 BoogieIcfgContainer [2024-11-10 09:01:11,499 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:01:11,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:01:11,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:01:11,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:01:11,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:01:10" (1/3) ... [2024-11-10 09:01:11,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21de2966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:01:11, skipping insertion in model container [2024-11-10 09:01:11,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:10" (2/3) ... [2024-11-10 09:01:11,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21de2966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:01:11, skipping insertion in model container [2024-11-10 09:01:11,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:01:11" (3/3) ... [2024-11-10 09:01:11,512 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-17.i [2024-11-10 09:01:11,530 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:01:11,530 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:01:11,587 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:01:11,597 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;@7e84bbf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:01:11,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:01:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:01:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 09:01:11,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:01:11,613 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:11,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:01:11,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:01:11,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1320687168, now seen corresponding path program 1 times [2024-11-10 09:01:11,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:01:11,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911832449] [2024-11-10 09:01:11,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:01:11,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:01:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:11,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:01:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:11,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:01:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:11,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:01:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:11,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 09:01:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:11,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 09:01:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:11,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 09:01:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:11,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 09:01:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:11,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 09:01:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:11,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 09:01:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:11,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 09:01:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:11,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:01:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:11,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:01:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:11,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 09:01:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:11,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 09:01:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:11,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 09:01:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:11,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 09:01:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:01:11,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:01:11,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911832449] [2024-11-10 09:01:11,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911832449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:01:11,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:01:11,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:01:11,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643268125] [2024-11-10 09:01:11,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:01:11,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:01:11,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:01:11,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:01:11,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:01:11,974 INFO L87 Difference]: Start difference. First operand has 56 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:01:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:01:11,993 INFO L93 Difference]: Finished difference Result 104 states and 171 transitions. [2024-11-10 09:01:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:01:11,995 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2024-11-10 09:01:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:01:12,000 INFO L225 Difference]: With dead ends: 104 [2024-11-10 09:01:12,000 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 09:01:12,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-10 09:01:12,004 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:01:12,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:01:12,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 09:01:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-10 09:01:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:01:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-10 09:01:12,036 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 106 [2024-11-10 09:01:12,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:01:12,036 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-10 09:01:12,036 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:01:12,036 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-10 09:01:12,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 09:01:12,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:01:12,039 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:12,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:01:12,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:01:12,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:01:12,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1976727300, now seen corresponding path program 1 times [2024-11-10 09:01:12,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:01:12,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311166184] [2024-11-10 09:01:12,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:01:12,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:01:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:01:12,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:01:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:01:12,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:01:12,323 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:01:12,324 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:01:12,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:01:12,329 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 09:01:12,406 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:01:12,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:01:12 BoogieIcfgContainer [2024-11-10 09:01:12,409 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:01:12,409 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:01:12,409 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:01:12,410 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:01:12,410 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:01:11" (3/4) ... [2024-11-10 09:01:12,412 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:01:12,413 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:01:12,414 INFO L158 Benchmark]: Toolchain (without parser) took 1874.49ms. Allocated memory was 159.4MB in the beginning and 251.7MB in the end (delta: 92.3MB). Free memory was 86.1MB in the beginning and 208.5MB in the end (delta: -122.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:01:12,414 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:01:12,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.37ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 127.5MB in the end (delta: -41.7MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-11-10 09:01:12,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.11ms. Allocated memory was 159.4MB in the beginning and 251.7MB in the end (delta: 92.3MB). Free memory was 127.4MB in the beginning and 221.3MB in the end (delta: -93.9MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2024-11-10 09:01:12,416 INFO L158 Benchmark]: Boogie Preprocessor took 41.40ms. Allocated memory is still 251.7MB. Free memory was 221.3MB in the beginning and 219.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:01:12,416 INFO L158 Benchmark]: IcfgBuilder took 542.95ms. Allocated memory is still 251.7MB. Free memory was 219.2MB in the beginning and 201.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 09:01:12,419 INFO L158 Benchmark]: TraceAbstraction took 907.65ms. Allocated memory is still 251.7MB. Free memory was 201.4MB in the beginning and 208.5MB in the end (delta: -7.1MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2024-11-10 09:01:12,419 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 251.7MB. Free memory is still 208.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:01:12,421 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.16ms. Allocated memory is still 159.4MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.37ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 127.5MB in the end (delta: -41.7MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.11ms. Allocated memory was 159.4MB in the beginning and 251.7MB in the end (delta: 92.3MB). Free memory was 127.4MB in the beginning and 221.3MB in the end (delta: -93.9MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.40ms. Allocated memory is still 251.7MB. Free memory was 221.3MB in the beginning and 219.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 542.95ms. Allocated memory is still 251.7MB. Free memory was 219.2MB in the beginning and 201.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 907.65ms. Allocated memory is still 251.7MB. Free memory was 201.4MB in the beginning and 208.5MB in the end (delta: -7.1MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 251.7MB. Free memory is still 208.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 10000000.8; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 16.2; [L25] double var_1_4 = 7.5; [L26] double var_1_5 = 49.6; [L27] signed short int var_1_6 = -10; [L28] double var_1_7 = 4.5; [L29] double var_1_8 = 9.4; [L30] signed short int var_1_9 = 128; [L31] signed short int var_1_10 = 128; [L32] unsigned char var_1_11 = 0; [L33] unsigned long int var_1_12 = 100; [L34] float var_1_13 = 128.4; [L35] double var_1_14 = 3.5; [L36] unsigned char var_1_15 = 16; [L37] unsigned char var_1_16 = 2; [L38] unsigned char last_1_var_1_15 = 16; VAL [isInitial=0, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=0, var_1_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=0, var_1_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L110] RET updateLastVariables() [L111] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L74] var_1_3 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L75] RET assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L76] var_1_4 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L77] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L78] var_1_5 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L79] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L80] var_1_7 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_8=47/5, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_8=47/5, var_1_9=128] [L81] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_8=47/5, var_1_9=128] [L82] var_1_8 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=128] [L83] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=128] [L84] var_1_9 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L85] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L86] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L86] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L87] var_1_10 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L88] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L89] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L89] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L90] var_1_11 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L91] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L92] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L92] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L93] var_1_14 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L94] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L95] var_1_16 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L96] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L97] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_16=0, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_16=0, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L97] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_16=0, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L111] RET updateVariables() [L112] CALL step() [L42] var_1_12 = last_1_var_1_15 [L43] unsigned long int stepLocal_1 = var_1_12; [L44] signed short int stepLocal_0 = var_1_9; VAL [isInitial=1, last_1_var_1_15=16, stepLocal_0=16383, stepLocal_1=16, var_1_10=16384, var_1_11=1, var_1_12=16, var_1_13=642/5, var_1_15=16, var_1_16=0, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L45] COND FALSE !(stepLocal_0 >= var_1_10) VAL [isInitial=1, last_1_var_1_15=16, stepLocal_1=16, var_1_10=16384, var_1_11=1, var_1_12=16, var_1_13=642/5, var_1_15=16, var_1_16=0, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=16383] [L52] COND TRUE \read(var_1_2) [L53] var_1_1 = (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))) VAL [isInitial=1, last_1_var_1_15=16, stepLocal_1=16, var_1_10=16384, var_1_11=1, var_1_12=16, var_1_13=642/5, var_1_15=16, var_1_16=0, var_1_2=1, var_1_6=-10, var_1_9=16383] [L55] COND TRUE (- (var_1_7 - var_1_8)) <= var_1_3 [L56] var_1_6 = ((8 + var_1_15) - var_1_15) VAL [isInitial=1, last_1_var_1_15=16, stepLocal_1=16, var_1_10=16384, var_1_11=1, var_1_12=16, var_1_13=642/5, var_1_15=16, var_1_16=0, var_1_2=1, var_1_6=8, var_1_9=16383] [L66] COND TRUE var_1_7 < (var_1_8 - var_1_14) [L67] var_1_13 = ((((var_1_4) > (((((((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) > (var_1_3)) ? (((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) : (var_1_3))))) ? (var_1_4) : (((((((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) > (var_1_3)) ? (((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) : (var_1_3)))))) VAL [isInitial=1, last_1_var_1_15=16, stepLocal_1=16, var_1_10=16384, var_1_11=1, var_1_12=16, var_1_13=637/5, var_1_15=16, var_1_16=0, var_1_2=1, var_1_3=637/5, var_1_4=637/5, var_1_5=637/5, var_1_6=8, var_1_9=16383] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return ((((var_1_2 ? (var_1_1 == ((double) (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))))) : 1) && (((- (var_1_7 - var_1_8)) <= var_1_3) ? (var_1_6 == ((signed short int) ((8 + var_1_15) - var_1_15))) : (var_1_2 ? (var_1_11 ? (var_1_6 == ((signed short int) var_1_15)) : 1) : (var_1_6 == ((signed short int) var_1_15))))) && (var_1_12 == ((unsigned long int) last_1_var_1_15))) && ((var_1_7 < (var_1_8 - var_1_14)) ? (var_1_13 == ((float) ((((var_1_4) > (((((((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) > (var_1_3)) ? (((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) : (var_1_3))))) ? (var_1_4) : (((((((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) > (var_1_3)) ? (((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) : (var_1_3)))))))) : 1)) && ((var_1_9 >= var_1_10) ? (((var_1_9 + last_1_var_1_15) >= var_1_12) ? (var_1_15 == ((unsigned char) var_1_16)) : (var_1_15 == ((unsigned char) var_1_16))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=16, var_1_13=637/5, var_1_15=16, var_1_16=0, var_1_2=1, var_1_3=637/5, var_1_4=637/5, var_1_5=637/5, var_1_6=8, var_1_9=16383] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=16, var_1_13=637/5, var_1_15=16, var_1_16=0, var_1_2=1, var_1_3=637/5, var_1_4=637/5, var_1_5=637/5, var_1_6=8, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=16, var_1_13=637/5, var_1_15=16, var_1_16=0, var_1_2=1, var_1_3=637/5, var_1_4=637/5, var_1_5=637/5, var_1_6=8, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 16, 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, 73 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, 73 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred 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.2s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 480/480 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-10 09:01:12,455 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-17.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 a1b9f7d8308e518fe4c72a6190b2fee610f7c5e29f3d722e14bc1423462ff2ad --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:01:14,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:01:14,632 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:01:14,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:01:14,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:01:14,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:01:14,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:01:14,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:01:14,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:01:14,680 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:01:14,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:01:14,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:01:14,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:01:14,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:01:14,684 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:01:14,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:01:14,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:01:14,685 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:01:14,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:01:14,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:01:14,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:01:14,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:01:14,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:01:14,691 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:01:14,691 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:01:14,691 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:01:14,691 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:01:14,692 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:01:14,692 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:01:14,692 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:01:14,692 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:01:14,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:01:14,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:01:14,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:01:14,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:01:14,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:01:14,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:01:14,694 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:01:14,696 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:01:14,696 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:01:14,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:01:14,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:01:14,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:01:14,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:01:14,697 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 -> a1b9f7d8308e518fe4c72a6190b2fee610f7c5e29f3d722e14bc1423462ff2ad [2024-11-10 09:01:15,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:01:15,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:01:15,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:01:15,050 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:01:15,050 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:01:15,051 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-17.i [2024-11-10 09:01:16,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:01:16,704 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:01:16,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-17.i [2024-11-10 09:01:16,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126e6d636/a99b2c3f521247da8d1efa2903c10f73/FLAG6a40ea6c1 [2024-11-10 09:01:16,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126e6d636/a99b2c3f521247da8d1efa2903c10f73 [2024-11-10 09:01:16,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:01:16,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:01:16,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:01:16,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:01:16,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:01:16,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:01:16" (1/1) ... [2024-11-10 09:01:16,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ad6b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:16, skipping insertion in model container [2024-11-10 09:01:16,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:01:16" (1/1) ... [2024-11-10 09:01:16,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:01:16,930 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-17.i[913,926] [2024-11-10 09:01:16,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:01:16,988 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:01:17,000 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-17.i[913,926] [2024-11-10 09:01:17,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:01:17,048 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:01:17,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:17 WrapperNode [2024-11-10 09:01:17,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:01:17,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:01:17,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:01:17,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:01:17,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:17" (1/1) ... [2024-11-10 09:01:17,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:17" (1/1) ... [2024-11-10 09:01:17,093 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-10 09:01:17,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:01:17,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:01:17,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:01:17,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:01:17,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:17" (1/1) ... [2024-11-10 09:01:17,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:17" (1/1) ... [2024-11-10 09:01:17,109 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:17" (1/1) ... [2024-11-10 09:01:17,122 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-10 09:01:17,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:17" (1/1) ... [2024-11-10 09:01:17,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:17" (1/1) ... [2024-11-10 09:01:17,135 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:17" (1/1) ... [2024-11-10 09:01:17,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:17" (1/1) ... [2024-11-10 09:01:17,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:17" (1/1) ... [2024-11-10 09:01:17,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:17" (1/1) ... [2024-11-10 09:01:17,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:01:17,148 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:01:17,148 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:01:17,148 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:01:17,148 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:17" (1/1) ... [2024-11-10 09:01:17,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:01:17,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:01:17,182 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-10 09:01:17,189 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-10 09:01:17,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:01:17,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:01:17,233 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:01:17,233 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:01:17,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:01:17,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:01:17,331 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:01:17,348 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:01:23,143 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 09:01:23,143 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:01:23,159 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:01:23,161 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:01:23,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:01:23 BoogieIcfgContainer [2024-11-10 09:01:23,162 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:01:23,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:01:23,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:01:23,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:01:23,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:01:16" (1/3) ... [2024-11-10 09:01:23,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782d2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:01:23, skipping insertion in model container [2024-11-10 09:01:23,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:17" (2/3) ... [2024-11-10 09:01:23,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782d2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:01:23, skipping insertion in model container [2024-11-10 09:01:23,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:01:23" (3/3) ... [2024-11-10 09:01:23,170 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-17.i [2024-11-10 09:01:23,183 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:01:23,184 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:01:23,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:01:23,236 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;@55419ae9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:01:23,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:01:23,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:01:23,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 09:01:23,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:01:23,250 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:23,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:01:23,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:01:23,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1320687168, now seen corresponding path program 1 times [2024-11-10 09:01:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:01:23,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126670890] [2024-11-10 09:01:23,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:01:23,269 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-10 09:01:23,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:01:23,273 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-10 09:01:23,274 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-10 09:01:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:23,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:01:23,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:01:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2024-11-10 09:01:23,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:01:23,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:01:23,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126670890] [2024-11-10 09:01:23,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126670890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:01:23,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:01:23,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:01:23,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275413761] [2024-11-10 09:01:23,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:01:23,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:01:23,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:01:23,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:01:23,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:01:23,756 INFO L87 Difference]: Start difference. First operand has 56 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:01:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:01:23,781 INFO L93 Difference]: Finished difference Result 104 states and 171 transitions. [2024-11-10 09:01:23,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:01:23,783 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2024-11-10 09:01:23,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:01:23,789 INFO L225 Difference]: With dead ends: 104 [2024-11-10 09:01:23,789 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 09:01:23,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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-10 09:01:23,796 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:01:23,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:01:23,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 09:01:23,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-10 09:01:23,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:01:23,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-10 09:01:23,838 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 106 [2024-11-10 09:01:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:01:23,839 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-10 09:01:23,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:01:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-10 09:01:23,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 09:01:23,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:01:23,841 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:23,854 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-10 09:01:24,042 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-10 09:01:24,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:01:24,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:01:24,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1976727300, now seen corresponding path program 1 times [2024-11-10 09:01:24,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:01:24,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093402845] [2024-11-10 09:01:24,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:01:24,045 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-10 09:01:24,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:01:24,048 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-10 09:01:24,055 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-10 09:01:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:24,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 09:01:24,451 INFO L278 TraceCheckSpWp]: Computing forward predicates...