./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2f4df22d87e0e8ce7674fab52fd296a9e3ffce9a03a9a1e4bf59c1ee4f7637ff --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:59:21,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:59:21,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:59:21,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:59:21,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:59:21,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:59:21,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:59:21,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:59:21,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:59:21,662 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:59:21,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:59:21,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:59:21,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:59:21,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:59:21,664 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:59:21,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:59:21,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:59:21,667 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:59:21,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:59:21,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:59:21,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:59:21,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:59:21,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:59:21,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:59:21,670 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:59:21,670 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:59:21,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:59:21,671 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:59:21,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:59:21,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:59:21,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:59:21,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:59:21,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:59:21,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:59:21,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:59:21,674 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:59:21,674 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:59:21,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:59:21,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:59:21,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:59:21,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:59:21,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:59:21,676 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-clean/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-clean/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 -> 2f4df22d87e0e8ce7674fab52fd296a9e3ffce9a03a9a1e4bf59c1ee4f7637ff [2024-10-11 10:59:21,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:59:21,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:59:21,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:59:21,923 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:59:21,923 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:59:21,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i [2024-10-11 10:59:23,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:59:23,481 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:59:23,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i [2024-10-11 10:59:23,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0240ec781/6c5ab802451144638fd540cb04b00b27/FLAG629330aed [2024-10-11 10:59:23,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0240ec781/6c5ab802451144638fd540cb04b00b27 [2024-10-11 10:59:23,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:59:23,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:59:23,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:59:23,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:59:23,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:59:23,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:59:23" (1/1) ... [2024-10-11 10:59:23,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d6f8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:23, skipping insertion in model container [2024-10-11 10:59:23,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:59:23" (1/1) ... [2024-10-11 10:59:23,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:59:24,106 WARN L248 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_floatingpointinfluence_no-floats_file-77.i[916,929] [2024-10-11 10:59:24,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:59:24,216 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:59:24,228 WARN L248 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_floatingpointinfluence_no-floats_file-77.i[916,929] [2024-10-11 10:59:24,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:59:24,270 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:59:24,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:24 WrapperNode [2024-10-11 10:59:24,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:59:24,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:59:24,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:59:24,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:59:24,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:24" (1/1) ... [2024-10-11 10:59:24,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:24" (1/1) ... [2024-10-11 10:59:24,339 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-10-11 10:59:24,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:59:24,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:59:24,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:59:24,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:59:24,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:24" (1/1) ... [2024-10-11 10:59:24,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:24" (1/1) ... [2024-10-11 10:59:24,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:24" (1/1) ... [2024-10-11 10:59:24,390 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-10-11 10:59:24,391 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:24" (1/1) ... [2024-10-11 10:59:24,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:24" (1/1) ... [2024-10-11 10:59:24,400 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:24" (1/1) ... [2024-10-11 10:59:24,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:24" (1/1) ... [2024-10-11 10:59:24,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:24" (1/1) ... [2024-10-11 10:59:24,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:24" (1/1) ... [2024-10-11 10:59:24,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:59:24,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:59:24,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:59:24,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:59:24,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:24" (1/1) ... [2024-10-11 10:59:24,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:59:24,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:59:24,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:59:24,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:59:24,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:59:24,487 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:59:24,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:59:24,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:59:24,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:59:24,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:59:24,553 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:59:24,555 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:59:24,815 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 10:59:24,815 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:59:24,845 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:59:24,846 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:59:24,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:59:24 BoogieIcfgContainer [2024-10-11 10:59:24,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:59:24,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:59:24,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:59:24,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:59:24,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:59:23" (1/3) ... [2024-10-11 10:59:24,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4c22c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:59:24, skipping insertion in model container [2024-10-11 10:59:24,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:24" (2/3) ... [2024-10-11 10:59:24,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4c22c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:59:24, skipping insertion in model container [2024-10-11 10:59:24,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:59:24" (3/3) ... [2024-10-11 10:59:24,858 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-77.i [2024-10-11 10:59:24,873 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:59:24,874 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:59:24,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:59:24,926 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5f857932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:59:24,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:59:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 10:59:24,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 10:59:24,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:59:24,948 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 10:59:24,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:59:24,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:59:24,954 INFO L85 PathProgramCache]: Analyzing trace with hash -124053791, now seen corresponding path program 1 times [2024-10-11 10:59:24,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:59:24,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405611782] [2024-10-11 10:59:24,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:59:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:59:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:59:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:59:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:59:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:59:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:59:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:59:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:59:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:59:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:59:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:59:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:59:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:59:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:59:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:59:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:59:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:59:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:59:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:59:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:59:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:59:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 10:59:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:59:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 10:59:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 10:59:25,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:59:25,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405611782] [2024-10-11 10:59:25,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405611782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:59:25,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:59:25,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:59:25,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117697903] [2024-10-11 10:59:25,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:59:25,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:59:25,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:59:25,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:59:25,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:59:25,281 INFO L87 Difference]: Start difference. First operand has 54 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 10:59:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:59:25,345 INFO L93 Difference]: Finished difference Result 105 states and 191 transitions. [2024-10-11 10:59:25,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:59:25,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 136 [2024-10-11 10:59:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:59:25,371 INFO L225 Difference]: With dead ends: 105 [2024-10-11 10:59:25,377 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 10:59:25,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-10-11 10:59:25,387 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:59:25,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:59:25,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 10:59:25,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 10:59:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 10:59:25,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2024-10-11 10:59:25,427 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 136 [2024-10-11 10:59:25,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:59:25,427 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2024-10-11 10:59:25,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 10:59:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2024-10-11 10:59:25,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 10:59:25,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:59:25,430 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 10:59:25,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:59:25,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:59:25,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:59:25,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1339576035, now seen corresponding path program 1 times [2024-10-11 10:59:25,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:59:25,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238215628] [2024-10-11 10:59:25,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:59:25,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:59:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:59:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:59:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:59:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:59:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:59:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:59:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:59:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:59:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:59:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:59:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:59:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:59:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:59:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:59:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:59:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:59:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:59:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:59:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:59:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:59:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 10:59:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:59:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 10:59:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 10:59:32,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:59:32,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238215628] [2024-10-11 10:59:32,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238215628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:59:32,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:59:32,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 10:59:32,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154440387] [2024-10-11 10:59:32,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:59:32,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 10:59:32,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:59:32,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 10:59:32,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:59:32,834 INFO L87 Difference]: Start difference. First operand 52 states and 79 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:59:33,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:59:33,376 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2024-10-11 10:59:33,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 10:59:33,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2024-10-11 10:59:33,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:59:33,380 INFO L225 Difference]: With dead ends: 94 [2024-10-11 10:59:33,380 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 10:59:33,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:59:33,381 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 62 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:59:33,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 230 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:59:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 10:59:33,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2024-10-11 10:59:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 10:59:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 106 transitions. [2024-10-11 10:59:33,398 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 106 transitions. Word has length 136 [2024-10-11 10:59:33,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:59:33,398 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 106 transitions. [2024-10-11 10:59:33,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:59:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 106 transitions. [2024-10-11 10:59:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 10:59:33,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:59:33,400 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 10:59:33,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:59:33,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:59:33,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:59:33,401 INFO L85 PathProgramCache]: Analyzing trace with hash 2146044635, now seen corresponding path program 1 times [2024-10-11 10:59:33,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:59:33,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695712781] [2024-10-11 10:59:33,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:59:33,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:59:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:59:33,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [960874209] [2024-10-11 10:59:33,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:59:33,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:59:33,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:59:33,450 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:59:33,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:59:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:59:33,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:59:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:59:33,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:59:33,694 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:59:33,695 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:59:33,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 10:59:33,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:59:33,903 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 10:59:33,972 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:59:33,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:59:33 BoogieIcfgContainer [2024-10-11 10:59:33,975 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:59:33,976 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:59:33,976 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:59:33,976 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:59:33,977 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:59:24" (3/4) ... [2024-10-11 10:59:33,979 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:59:33,980 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:59:33,981 INFO L158 Benchmark]: Toolchain (without parser) took 10088.48ms. Allocated memory was 184.5MB in the beginning and 690.0MB in the end (delta: 505.4MB). Free memory was 114.5MB in the beginning and 637.6MB in the end (delta: -523.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:59:33,981 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:59:33,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.35ms. Allocated memory is still 184.5MB. Free memory was 114.3MB in the beginning and 152.2MB in the end (delta: -37.9MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-10-11 10:59:33,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.31ms. Allocated memory is still 184.5MB. Free memory was 152.2MB in the beginning and 149.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:59:33,982 INFO L158 Benchmark]: Boogie Preprocessor took 69.62ms. Allocated memory is still 184.5MB. Free memory was 149.3MB in the beginning and 145.1MB in the end (delta: 4.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 10:59:33,982 INFO L158 Benchmark]: RCFGBuilder took 436.46ms. Allocated memory is still 184.5MB. Free memory was 145.1MB in the beginning and 124.2MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 10:59:33,983 INFO L158 Benchmark]: TraceAbstraction took 9123.71ms. Allocated memory was 184.5MB in the beginning and 690.0MB in the end (delta: 505.4MB). Free memory was 123.0MB in the beginning and 637.6MB in the end (delta: -514.6MB). Peak memory consumption was 263.3MB. Max. memory is 16.1GB. [2024-10-11 10:59:33,983 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 690.0MB. Free memory is still 637.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:59:33,985 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.15ms. Allocated memory is still 184.5MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.35ms. Allocated memory is still 184.5MB. Free memory was 114.3MB in the beginning and 152.2MB in the end (delta: -37.9MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.31ms. Allocated memory is still 184.5MB. Free memory was 152.2MB in the beginning and 149.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.62ms. Allocated memory is still 184.5MB. Free memory was 149.3MB in the beginning and 145.1MB in the end (delta: 4.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 436.46ms. Allocated memory is still 184.5MB. Free memory was 145.1MB in the beginning and 124.2MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9123.71ms. Allocated memory was 184.5MB in the beginning and 690.0MB in the end (delta: 505.4MB). Free memory was 123.0MB in the beginning and 637.6MB in the end (delta: -514.6MB). Peak memory consumption was 263.3MB. Max. memory is 16.1GB. * Witness Printer took 3.86ms. Allocated memory is still 690.0MB. Free memory is still 637.6MB. 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 to_int at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 50; [L23] unsigned short int var_1_4 = 60871; [L24] unsigned short int var_1_5 = 1; [L25] unsigned short int var_1_6 = 28896; [L26] unsigned short int var_1_7 = 5; [L27] signed long int var_1_8 = 63; [L28] signed long int var_1_9 = 49; [L29] signed long int var_1_10 = 31; [L30] signed long int var_1_11 = 255; [L31] signed long int var_1_12 = 0; [L32] signed short int var_1_13 = -8; [L33] signed long int var_1_15 = 1000000000; [L34] unsigned short int var_1_16 = 4; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 1; [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] FCALL updateLastVariables() [L113] CALL updateVariables() [L67] var_1_4 = __VERIFIER_nondet_ushort() [L68] CALL assume_abort_if_not(var_1_4 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L68] RET assume_abort_if_not(var_1_4 >= 32767) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L69] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L69] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L70] var_1_5 = __VERIFIER_nondet_ushort() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L72] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L72] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=28896, var_1_7=5, var_1_8=63, var_1_9=49] [L73] var_1_6 = __VERIFIER_nondet_ushort() [L74] CALL assume_abort_if_not(var_1_6 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=5, var_1_8=63, var_1_9=49] [L74] RET assume_abort_if_not(var_1_6 >= 16383) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=5, var_1_8=63, var_1_9=49] [L75] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=5, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=5, var_1_8=63, var_1_9=49] [L75] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=5, var_1_8=63, var_1_9=49] [L76] var_1_7 = __VERIFIER_nondet_ushort() [L77] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_8=63, var_1_9=49] [L77] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_8=63, var_1_9=49] [L78] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=49] [L78] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=49] [L79] var_1_9 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L80] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L81] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=31, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L82] var_1_10 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=255, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L85] var_1_11 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L87] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L88] var_1_12 = __VERIFIER_nondet_long() [L89] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L89] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L90] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=1000000000, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L91] var_1_15 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L92] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L93] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L94] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=1, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L95] var_1_17 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L96] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L97] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=1, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L98] var_1_18 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L99] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L100] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=63, var_1_9=0] [L113] RET updateVariables() [L114] CALL step() [L40] COND FALSE !(var_1_7 > var_1_5) [L43] var_1_8 = (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - (var_1_12 - 3.4f)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_9=0] [L45] unsigned short int stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=-49152, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=-8, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_9=0] [L46] COND FALSE !(stepLocal_0 <= var_1_5) [L51] var_1_13 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=129, var_1_15=2, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_9=0] [L53] COND FALSE !(var_1_6 > (var_1_13 * ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7))))) [L60] var_1_16 = var_1_6 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=129, var_1_15=2, var_1_16=-49152, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_9=0] [L62] COND FALSE !(var_1_8 != var_1_8) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=129, var_1_15=2, var_1_16=-49152, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_9=0] [L114] RET step() [L115] CALL, EXPR property() [L105-L106] return ((((var_1_8 != var_1_8) ? (var_1_1 == ((unsigned short int) (var_1_4 - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7))))))) : 1) && ((var_1_7 > var_1_5) ? (var_1_8 == ((signed long int) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_8 == ((signed long int) (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - (var_1_12 - 3.4f)))))) && ((var_1_6 <= var_1_5) ? ((((((var_1_8) > ((var_1_12 / var_1_15))) ? (var_1_8) : ((var_1_12 / var_1_15)))) > ((((var_1_10) < (var_1_8)) ? (var_1_10) : (var_1_8)))) ? (var_1_13 == ((signed short int) var_1_7)) : 1) : (var_1_13 == ((signed short int) var_1_7)))) && ((var_1_6 > (var_1_13 * ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7))))) ? ((var_1_17 || var_1_18) ? (var_1_16 == ((unsigned short int) var_1_4)) : (var_1_16 == ((unsigned short int) var_1_7))) : (var_1_16 == ((unsigned short int) var_1_6))) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=129, var_1_15=2, var_1_16=-49152, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2147483647, var_1_13=129, var_1_15=2, var_1_16=-49152, var_1_17=0, var_1_18=0, var_1_1=50, var_1_4=98304, var_1_5=65665, var_1_6=-49152, var_1_7=-65407, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 306 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 152 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 154 mSDtfsCounter, 74 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=2, InterpolantAutomatonStates: 8, 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, 2 MinimizatonAttempts, 20 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 544 NumberOfCodeBlocks, 544 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 1509 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2024/2024 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-10-11 10:59:34,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2f4df22d87e0e8ce7674fab52fd296a9e3ffce9a03a9a1e4bf59c1ee4f7637ff --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:59:36,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:59:36,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:59:36,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:59:36,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:59:36,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:59:36,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:59:36,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:59:36,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:59:36,174 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:59:36,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:59:36,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:59:36,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:59:36,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:59:36,176 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:59:36,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:59:36,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:59:36,177 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:59:36,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:59:36,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:59:36,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:59:36,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:59:36,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:59:36,179 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:59:36,179 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:59:36,179 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:59:36,180 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:59:36,180 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:59:36,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:59:36,180 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:59:36,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:59:36,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:59:36,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:59:36,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:59:36,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:59:36,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:59:36,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:59:36,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:59:36,192 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:59:36,192 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:59:36,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:59:36,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:59:36,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:59:36,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:59:36,193 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:59:36,193 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-clean/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-clean/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 -> 2f4df22d87e0e8ce7674fab52fd296a9e3ffce9a03a9a1e4bf59c1ee4f7637ff [2024-10-11 10:59:36,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:59:36,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:59:36,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:59:36,463 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:59:36,464 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:59:36,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i [2024-10-11 10:59:37,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:59:38,171 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:59:38,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-77.i [2024-10-11 10:59:38,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a6123393d/1af57a15df6f4197ab70fbd74d6cd45d/FLAGb7d20fd92 [2024-10-11 10:59:38,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a6123393d/1af57a15df6f4197ab70fbd74d6cd45d [2024-10-11 10:59:38,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:59:38,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:59:38,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:59:38,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:59:38,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:59:38,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:59:38" (1/1) ... [2024-10-11 10:59:38,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17678714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:38, skipping insertion in model container [2024-10-11 10:59:38,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:59:38" (1/1) ... [2024-10-11 10:59:38,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:59:38,364 WARN L248 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_floatingpointinfluence_no-floats_file-77.i[916,929] [2024-10-11 10:59:38,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:59:38,425 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:59:38,443 WARN L248 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_floatingpointinfluence_no-floats_file-77.i[916,929] [2024-10-11 10:59:38,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:59:38,492 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:59:38,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:38 WrapperNode [2024-10-11 10:59:38,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:59:38,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:59:38,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:59:38,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:59:38,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:38" (1/1) ... [2024-10-11 10:59:38,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:38" (1/1) ... [2024-10-11 10:59:38,541 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-10-11 10:59:38,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:59:38,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:59:38,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:59:38,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:59:38,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:38" (1/1) ... [2024-10-11 10:59:38,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:38" (1/1) ... [2024-10-11 10:59:38,555 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:38" (1/1) ... [2024-10-11 10:59:38,571 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-10-11 10:59:38,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:38" (1/1) ... [2024-10-11 10:59:38,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:38" (1/1) ... [2024-10-11 10:59:38,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:38" (1/1) ... [2024-10-11 10:59:38,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:38" (1/1) ... [2024-10-11 10:59:38,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:38" (1/1) ... [2024-10-11 10:59:38,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:38" (1/1) ... [2024-10-11 10:59:38,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:59:38,627 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:59:38,627 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:59:38,627 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:59:38,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:38" (1/1) ... [2024-10-11 10:59:38,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:59:38,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:59:38,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:59:38,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:59:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:59:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:59:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:59:38,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:59:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:59:38,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:59:38,783 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:59:38,785 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:59:46,863 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 10:59:46,863 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:59:46,894 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:59:46,895 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:59:46,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:59:46 BoogieIcfgContainer [2024-10-11 10:59:46,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:59:46,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:59:46,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:59:46,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:59:46,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:59:38" (1/3) ... [2024-10-11 10:59:46,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786ec27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:59:46, skipping insertion in model container [2024-10-11 10:59:46,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:59:38" (2/3) ... [2024-10-11 10:59:46,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786ec27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:59:46, skipping insertion in model container [2024-10-11 10:59:46,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:59:46" (3/3) ... [2024-10-11 10:59:46,901 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-77.i [2024-10-11 10:59:46,912 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:59:46,913 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:59:46,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:59:46,973 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;@343b8e06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:59:46,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:59:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 10:59:46,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 10:59:46,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:59:46,995 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 10:59:46,995 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:59:47,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:59:47,002 INFO L85 PathProgramCache]: Analyzing trace with hash -124053791, now seen corresponding path program 1 times [2024-10-11 10:59:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:59:47,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496523256] [2024-10-11 10:59:47,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:59:47,016 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-10-11 10:59:47,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:59:47,024 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 10:59:47,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 10:59:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:47,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:59:47,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:59:47,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2024-10-11 10:59:47,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:59:47,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:59:47,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496523256] [2024-10-11 10:59:47,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496523256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:59:47,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:59:47,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:59:47,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425051315] [2024-10-11 10:59:47,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:59:47,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:59:47,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:59:47,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:59:47,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:59:47,455 INFO L87 Difference]: Start difference. First operand has 54 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 10:59:50,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:59:50,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:59:50,543 INFO L93 Difference]: Finished difference Result 105 states and 191 transitions. [2024-10-11 10:59:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:59:50,571 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 136 [2024-10-11 10:59:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:59:50,579 INFO L225 Difference]: With dead ends: 105 [2024-10-11 10:59:50,580 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 10:59:50,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-10-11 10:59:50,591 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:59:50,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 10:59:50,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 10:59:50,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 10:59:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 10:59:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2024-10-11 10:59:50,651 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 136 [2024-10-11 10:59:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:59:50,651 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2024-10-11 10:59:50,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 10:59:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2024-10-11 10:59:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 10:59:50,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:59:50,666 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 10:59:50,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 10:59:50,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 10:59:50,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:59:50,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:59:50,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1339576035, now seen corresponding path program 1 times [2024-10-11 10:59:50,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:59:50,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303742680] [2024-10-11 10:59:50,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:59:50,872 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-10-11 10:59:50,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:59:50,877 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 10:59:50,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 10:59:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:59:51,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:59:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:59:51,265 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-11 10:59:51,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1600271115] [2024-10-11 10:59:51,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:59:51,266 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 10:59:51,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 10:59:51,273 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 10:59:51,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-11 10:59:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:51,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 10:59:51,755 INFO L278 TraceCheckSpWp]: Computing forward predicates...