./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-93.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-93.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f01803fb0f4402adea224acc3f7b69fb2efec828f8f728a37b5dbc3d362b16ca --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:38:28,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:38:28,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:38:28,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:38:28,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:38:28,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:38:28,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:38:28,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:38:28,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:38:28,789 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:38:28,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:38:28,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:38:28,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:38:28,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:38:28,793 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:38:28,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:38:28,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:38:28,794 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:38:28,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:38:28,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:38:28,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:38:28,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:38:28,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:38:28,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:38:28,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:38:28,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:38:28,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:38:28,797 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:38:28,797 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:38:28,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:38:28,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:38:28,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:38:28,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:38:28,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:38:28,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:38:28,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:38:28,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:38:28,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:38:28,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:38:28,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:38:28,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:38:28,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:38:28,801 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f01803fb0f4402adea224acc3f7b69fb2efec828f8f728a37b5dbc3d362b16ca [2024-11-16 16:38:29,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:38:29,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:38:29,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:38:29,041 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:38:29,042 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:38:29,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-93.i [2024-11-16 16:38:30,369 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:38:30,534 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:38:30,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-93.i [2024-11-16 16:38:30,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12667d59b/cb847727c7ef4b3f90b4d7330ce7ee12/FLAGdb9ca7bc1 [2024-11-16 16:38:30,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12667d59b/cb847727c7ef4b3f90b4d7330ce7ee12 [2024-11-16 16:38:30,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:38:30,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:38:30,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:38:30,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:38:30,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:38:30,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:38:30" (1/1) ... [2024-11-16 16:38:30,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1570d565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:30, skipping insertion in model container [2024-11-16 16:38:30,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:38:30" (1/1) ... [2024-11-16 16:38:30,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:38:30,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-93.i[915,928] [2024-11-16 16:38:30,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:38:30,806 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:38:30,815 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-93.i[915,928] [2024-11-16 16:38:30,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:38:30,843 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:38:30,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:30 WrapperNode [2024-11-16 16:38:30,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:38:30,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:38:30,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:38:30,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:38:30,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:30" (1/1) ... [2024-11-16 16:38:30,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:30" (1/1) ... [2024-11-16 16:38:30,876 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-16 16:38:30,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:38:30,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:38:30,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:38:30,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:38:30,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:30" (1/1) ... [2024-11-16 16:38:30,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:30" (1/1) ... [2024-11-16 16:38:30,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:30" (1/1) ... [2024-11-16 16:38:30,905 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 16:38:30,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:30" (1/1) ... [2024-11-16 16:38:30,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:30" (1/1) ... [2024-11-16 16:38:30,910 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:30" (1/1) ... [2024-11-16 16:38:30,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:30" (1/1) ... [2024-11-16 16:38:30,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:30" (1/1) ... [2024-11-16 16:38:30,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:30" (1/1) ... [2024-11-16 16:38:30,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:38:30,922 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:38:30,922 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:38:30,922 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:38:30,923 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:30" (1/1) ... [2024-11-16 16:38:30,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:38:30,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:38:30,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 16:38:30,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 16:38:31,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:38:31,014 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:38:31,015 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:38:31,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:38:31,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:38:31,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:38:31,082 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:38:31,084 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:38:31,302 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 16:38:31,302 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:38:31,315 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:38:31,316 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:38:31,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:38:31 BoogieIcfgContainer [2024-11-16 16:38:31,316 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:38:31,318 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:38:31,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:38:31,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:38:31,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:38:30" (1/3) ... [2024-11-16 16:38:31,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a89b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:38:31, skipping insertion in model container [2024-11-16 16:38:31,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:30" (2/3) ... [2024-11-16 16:38:31,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a89b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:38:31, skipping insertion in model container [2024-11-16 16:38:31,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:38:31" (3/3) ... [2024-11-16 16:38:31,326 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-93.i [2024-11-16 16:38:31,339 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:38:31,340 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:38:31,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:38:31,410 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;@129eab00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:38:31,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:38:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:38:31,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 16:38:31,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:38:31,433 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:38:31,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:38:31,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:38:31,438 INFO L85 PathProgramCache]: Analyzing trace with hash -573772578, now seen corresponding path program 1 times [2024-11-16 16:38:31,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:38:31,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101997729] [2024-11-16 16:38:31,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:38:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:38:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:38:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:38:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:38:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 16:38:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:38:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 16:38:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 16:38:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:38:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:38:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:38:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:38:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:38:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 16:38:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 16:38:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 16:38:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 16:38:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 16:38:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 16:38:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:38:31,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:38:31,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101997729] [2024-11-16 16:38:31,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101997729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:38:31,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:38:31,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:38:31,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310742821] [2024-11-16 16:38:31,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:38:31,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:38:31,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:38:31,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:38:31,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:38:31,776 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:38:31,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:38:31,802 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2024-11-16 16:38:31,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:38:31,804 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2024-11-16 16:38:31,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:38:31,811 INFO L225 Difference]: With dead ends: 106 [2024-11-16 16:38:31,811 INFO L226 Difference]: Without dead ends: 52 [2024-11-16 16:38:31,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:38:31,819 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:38:31,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:38:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-16 16:38:31,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-16 16:38:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:38:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-11-16 16:38:31,853 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 115 [2024-11-16 16:38:31,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:38:31,854 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-11-16 16:38:31,854 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:38:31,854 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-11-16 16:38:31,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 16:38:31,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:38:31,860 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:38:31,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:38:31,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:38:31,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:38:31,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1854537470, now seen corresponding path program 1 times [2024-11-16 16:38:31,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:38:31,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34854662] [2024-11-16 16:38:31,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:38:31,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:38:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:38:31,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 16:38:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:38:32,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 16:38:32,118 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 16:38:32,119 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 16:38:32,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:38:32,123 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-16 16:38:32,184 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 16:38:32,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:38:32 BoogieIcfgContainer [2024-11-16 16:38:32,188 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 16:38:32,189 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 16:38:32,189 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 16:38:32,189 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 16:38:32,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:38:31" (3/4) ... [2024-11-16 16:38:32,192 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 16:38:32,193 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 16:38:32,193 INFO L158 Benchmark]: Toolchain (without parser) took 1633.83ms. Allocated memory is still 148.9MB. Free memory was 80.4MB in the beginning and 105.5MB in the end (delta: -25.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:38:32,194 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 148.9MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:38:32,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.64ms. Allocated memory is still 148.9MB. Free memory was 80.2MB in the beginning and 116.2MB in the end (delta: -36.0MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-11-16 16:38:32,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.11ms. Allocated memory is still 148.9MB. Free memory was 116.2MB in the beginning and 114.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 16:38:32,196 INFO L158 Benchmark]: Boogie Preprocessor took 41.58ms. Allocated memory is still 148.9MB. Free memory was 114.1MB in the beginning and 112.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 16:38:32,197 INFO L158 Benchmark]: IcfgBuilder took 394.29ms. Allocated memory is still 148.9MB. Free memory was 112.0MB in the beginning and 96.7MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 16:38:32,197 INFO L158 Benchmark]: TraceAbstraction took 869.65ms. Allocated memory is still 148.9MB. Free memory was 95.8MB in the beginning and 105.5MB in the end (delta: -9.8MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2024-11-16 16:38:32,197 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 148.9MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:38:32,200 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.20ms. Allocated memory is still 148.9MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.64ms. Allocated memory is still 148.9MB. Free memory was 80.2MB in the beginning and 116.2MB in the end (delta: -36.0MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.11ms. Allocated memory is still 148.9MB. Free memory was 116.2MB in the beginning and 114.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.58ms. Allocated memory is still 148.9MB. Free memory was 114.1MB in the beginning and 112.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 394.29ms. Allocated memory is still 148.9MB. Free memory was 112.0MB in the beginning and 96.7MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 869.65ms. Allocated memory is still 148.9MB. Free memory was 95.8MB in the beginning and 105.5MB in the end (delta: -9.8MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 148.9MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someUnaryDOUBLEoperation at line 23. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 255.3; [L23] double var_1_3 = -0.9; [L24] double var_1_4 = 2.6; [L25] double var_1_5 = 128.5; [L26] float var_1_7 = 1.25; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 1; [L29] unsigned char var_1_10 = 0; [L30] signed char var_1_11 = -1; [L31] signed char var_1_12 = -10; [L32] signed char var_1_13 = -32; [L33] signed char var_1_14 = -2; [L34] unsigned long int var_1_15 = 500; [L35] unsigned long int var_1_16 = 16; [L36] float last_1_var_1_1 = 255.3; [L37] unsigned char last_1_var_1_8 = 0; VAL [isInitial=0, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] last_1_var_1_1 = var_1_1 [L98] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L67] var_1_3 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L68] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L69] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L69] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L70] var_1_4 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L71] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L72] var_1_5 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L73] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L74] CALL assume_abort_if_not(var_1_5 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L74] RET assume_abort_if_not(var_1_5 != 0.0F) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L75] var_1_7 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L76] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L78] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L79] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L80] var_1_10 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L81] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L82] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L83] var_1_12 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L84] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L85] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L85] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L88] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L89] var_1_14 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L91] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L92] var_1_16 = __VERIFIER_nondet_ulong() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=-2, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=-2, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L94] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=-2, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L109] RET updateVariables() [L110] CALL step() [L41] COND FALSE !(((- last_1_var_1_1) / var_1_3) != (var_1_4 / var_1_5)) [L48] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=0, var_1_9=1] [L50] COND FALSE !(var_1_1 != var_1_1) [L55] var_1_8 = (! var_1_10) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] [L57] COND FALSE !(var_1_1 < var_1_1) [L62] var_1_11 = (var_1_13 + var_1_14) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=126, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=500, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] [L64] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=126, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=-2, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return ((((((- last_1_var_1_1) / var_1_3) != (var_1_4 / var_1_5)) ? (last_1_var_1_8 ? (var_1_1 == ((float) var_1_7)) : (var_1_1 == ((float) var_1_7))) : (var_1_1 == ((float) var_1_7))) && ((var_1_1 != var_1_1) ? ((var_1_1 < (var_1_1 * 15.25)) ? (var_1_8 == ((unsigned char) (! var_1_9))) : 1) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_1 < var_1_1) ? (var_1_10 ? (var_1_11 == ((signed char) var_1_12)) : 1) : (var_1_11 == ((signed char) (var_1_13 + var_1_14))))) && (var_1_15 == ((unsigned long int) var_1_16)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=126, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=-2, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=126, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=-2, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=126, var_1_12=125, var_1_13=63, var_1_14=63, var_1_15=-2, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 75 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 612/612 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 16:38:32,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-93.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f01803fb0f4402adea224acc3f7b69fb2efec828f8f728a37b5dbc3d362b16ca --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:38:34,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:38:34,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 16:38:34,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:38:34,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:38:34,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:38:34,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:38:34,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:38:34,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:38:34,170 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:38:34,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:38:34,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:38:34,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:38:34,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:38:34,171 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:38:34,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:38:34,172 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:38:34,172 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:38:34,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:38:34,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:38:34,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:38:34,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:38:34,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:38:34,175 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 16:38:34,176 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 16:38:34,179 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:38:34,179 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 16:38:34,179 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:38:34,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:38:34,180 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:38:34,180 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:38:34,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:38:34,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:38:34,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:38:34,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:38:34,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:38:34,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:38:34,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:38:34,181 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 16:38:34,182 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 16:38:34,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:38:34,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:38:34,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:38:34,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:38:34,183 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f01803fb0f4402adea224acc3f7b69fb2efec828f8f728a37b5dbc3d362b16ca [2024-11-16 16:38:34,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:38:34,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:38:34,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:38:34,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:38:34,436 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:38:34,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-93.i [2024-11-16 16:38:35,697 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:38:35,867 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:38:35,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-93.i [2024-11-16 16:38:35,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811091062/6ab5d3564a5a4e9a96109c6195a13978/FLAGb320005b9 [2024-11-16 16:38:35,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811091062/6ab5d3564a5a4e9a96109c6195a13978 [2024-11-16 16:38:35,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:38:35,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:38:35,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:38:35,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:38:35,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:38:35,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:38:35" (1/1) ... [2024-11-16 16:38:35,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2926c676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:35, skipping insertion in model container [2024-11-16 16:38:35,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:38:35" (1/1) ... [2024-11-16 16:38:35,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:38:36,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-93.i[915,928] [2024-11-16 16:38:36,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:38:36,123 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:38:36,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-93.i[915,928] [2024-11-16 16:38:36,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:38:36,166 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:38:36,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:36 WrapperNode [2024-11-16 16:38:36,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:38:36,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:38:36,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:38:36,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:38:36,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:36" (1/1) ... [2024-11-16 16:38:36,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:36" (1/1) ... [2024-11-16 16:38:36,215 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-11-16 16:38:36,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:38:36,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:38:36,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:38:36,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:38:36,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:36" (1/1) ... [2024-11-16 16:38:36,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:36" (1/1) ... [2024-11-16 16:38:36,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:36" (1/1) ... [2024-11-16 16:38:36,244 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 16:38:36,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:36" (1/1) ... [2024-11-16 16:38:36,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:36" (1/1) ... [2024-11-16 16:38:36,256 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:36" (1/1) ... [2024-11-16 16:38:36,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:36" (1/1) ... [2024-11-16 16:38:36,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:36" (1/1) ... [2024-11-16 16:38:36,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:36" (1/1) ... [2024-11-16 16:38:36,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:38:36,266 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:38:36,266 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:38:36,266 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:38:36,270 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:36" (1/1) ... [2024-11-16 16:38:36,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:38:36,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:38:36,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 16:38:36,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 16:38:36,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:38:36,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 16:38:36,332 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:38:36,332 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:38:36,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:38:36,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:38:36,413 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:38:36,416 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:38:47,145 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 16:38:47,145 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:38:47,161 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:38:47,163 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:38:47,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:38:47 BoogieIcfgContainer [2024-11-16 16:38:47,163 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:38:47,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:38:47,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:38:47,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:38:47,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:38:35" (1/3) ... [2024-11-16 16:38:47,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45876bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:38:47, skipping insertion in model container [2024-11-16 16:38:47,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:38:36" (2/3) ... [2024-11-16 16:38:47,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45876bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:38:47, skipping insertion in model container [2024-11-16 16:38:47,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:38:47" (3/3) ... [2024-11-16 16:38:47,170 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-93.i [2024-11-16 16:38:47,186 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:38:47,186 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:38:47,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:38:47,240 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;@62b012da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:38:47,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:38:47,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:38:47,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 16:38:47,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:38:47,255 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:38:47,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:38:47,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:38:47,260 INFO L85 PathProgramCache]: Analyzing trace with hash -573772578, now seen corresponding path program 1 times [2024-11-16 16:38:47,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:38:47,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678819729] [2024-11-16 16:38:47,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:38:47,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:38:47,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:38:47,281 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:38:47,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 16:38:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:48,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 16:38:48,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:38:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-16 16:38:48,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:38:48,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:38:48,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678819729] [2024-11-16 16:38:48,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678819729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:38:48,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:38:48,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:38:48,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596415901] [2024-11-16 16:38:48,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:38:48,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:38:48,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:38:48,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:38:48,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:38:48,715 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:38:48,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:38:48,734 INFO L93 Difference]: Finished difference Result 105 states and 175 transitions. [2024-11-16 16:38:48,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:38:48,736 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2024-11-16 16:38:48,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:38:48,740 INFO L225 Difference]: With dead ends: 105 [2024-11-16 16:38:48,741 INFO L226 Difference]: Without dead ends: 51 [2024-11-16 16:38:48,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:38:48,746 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:38:48,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:38:48,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-16 16:38:48,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-16 16:38:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:38:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2024-11-16 16:38:48,783 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 115 [2024-11-16 16:38:48,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:38:48,783 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2024-11-16 16:38:48,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:38:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2024-11-16 16:38:48,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 16:38:48,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:38:48,786 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:38:48,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 16:38:48,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:38:48,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:38:48,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:38:48,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1854537470, now seen corresponding path program 1 times [2024-11-16 16:38:48,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:38:48,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141942030] [2024-11-16 16:38:48,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:38:48,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:38:48,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:38:48,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:38:48,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 16:38:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:50,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 16:38:50,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:39:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-16 16:39:27,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:39:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:39:40,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:39:40,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141942030] [2024-11-16 16:39:40,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141942030] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 16:39:40,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 16:39:40,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-16 16:39:40,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357780908] [2024-11-16 16:39:40,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:39:40,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 16:39:40,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:39:40,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 16:39:40,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-16 16:39:40,802 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:39:45,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.57s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:39:49,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:39:53,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:39:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:39:59,470 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2024-11-16 16:39:59,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 16:39:59,471 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-16 16:39:59,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:39:59,472 INFO L225 Difference]: With dead ends: 90 [2024-11-16 16:39:59,473 INFO L226 Difference]: Without dead ends: 87 [2024-11-16 16:39:59,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2024-11-16 16:39:59,474 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 76 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 22 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:39:59,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 359 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 62 Invalid, 3 Unknown, 0 Unchecked, 17.2s Time] [2024-11-16 16:39:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-16 16:39:59,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2024-11-16 16:39:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 16:39:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 95 transitions. [2024-11-16 16:39:59,486 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 95 transitions. Word has length 115 [2024-11-16 16:39:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:39:59,487 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 95 transitions. [2024-11-16 16:39:59,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:39:59,487 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 95 transitions. [2024-11-16 16:39:59,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-16 16:39:59,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:59,489 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:59,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 16:39:59,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:39:59,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:59,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:59,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1732333450, now seen corresponding path program 1 times [2024-11-16 16:39:59,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:39:59,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230176153] [2024-11-16 16:39:59,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:59,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:39:59,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:39:59,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:39:59,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 16:40:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:00,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 16:40:00,995 INFO L278 TraceCheckSpWp]: Computing forward predicates...