./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-91.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_50-while_file-91.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 2d8b2be6d6ac251f6f2682006f5d119ef2b6d6ee8107fbc3310af784e3db17b0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:00:23,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:00:24,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:00:24,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:00:24,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:00:24,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:00:24,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:00:24,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:00:24,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:00:24,039 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:00:24,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:00:24,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:00:24,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:00:24,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:00:24,040 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:00:24,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:00:24,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:00:24,041 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:00:24,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:00:24,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:00:24,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:00:24,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:00:24,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:00:24,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:00:24,043 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:00:24,043 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:00:24,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:00:24,044 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:00:24,044 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:00:24,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:00:24,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:00:24,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:00:24,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:00:24,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:00:24,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:00:24,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:00:24,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:00:24,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:00:24,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:00:24,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:00:24,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:00:24,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:00:24,047 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 -> 2d8b2be6d6ac251f6f2682006f5d119ef2b6d6ee8107fbc3310af784e3db17b0 [2024-11-16 17:00:24,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:00:24,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:00:24,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:00:24,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:00:24,294 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:00:24,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-91.i [2024-11-16 17:00:25,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:00:25,751 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:00:25,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-91.i [2024-11-16 17:00:25,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1681cdc39/adc1e0dc1f58492797347e029266eb77/FLAG01d260e6e [2024-11-16 17:00:25,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1681cdc39/adc1e0dc1f58492797347e029266eb77 [2024-11-16 17:00:25,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:00:25,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:00:25,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:00:25,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:00:25,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:00:25,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:00:25" (1/1) ... [2024-11-16 17:00:25,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31907bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:25, skipping insertion in model container [2024-11-16 17:00:25,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:00:25" (1/1) ... [2024-11-16 17:00:25,805 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:00:25,945 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_50-while_file-91.i[915,928] [2024-11-16 17:00:26,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:00:26,025 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:00:26,035 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_50-while_file-91.i[915,928] [2024-11-16 17:00:26,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:00:26,075 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:00:26,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:26 WrapperNode [2024-11-16 17:00:26,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:00:26,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:00:26,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:00:26,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:00:26,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:26" (1/1) ... [2024-11-16 17:00:26,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:26" (1/1) ... [2024-11-16 17:00:26,133 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-11-16 17:00:26,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:00:26,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:00:26,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:00:26,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:00:26,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:26" (1/1) ... [2024-11-16 17:00:26,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:26" (1/1) ... [2024-11-16 17:00:26,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:26" (1/1) ... [2024-11-16 17:00:26,197 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 17:00:26,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:26" (1/1) ... [2024-11-16 17:00:26,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:26" (1/1) ... [2024-11-16 17:00:26,212 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:26" (1/1) ... [2024-11-16 17:00:26,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:26" (1/1) ... [2024-11-16 17:00:26,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:26" (1/1) ... [2024-11-16 17:00:26,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:26" (1/1) ... [2024-11-16 17:00:26,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:00:26,229 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:00:26,232 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:00:26,232 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:00:26,233 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:26" (1/1) ... [2024-11-16 17:00:26,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:00:26,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:00:26,289 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 17:00:26,293 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 17:00:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:00:26,331 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:00:26,331 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:00:26,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:00:26,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:00:26,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:00:26,399 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:00:26,401 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:00:26,665 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 17:00:26,666 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:00:26,678 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:00:26,679 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:00:26,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:00:26 BoogieIcfgContainer [2024-11-16 17:00:26,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:00:26,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:00:26,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:00:26,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:00:26,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:00:25" (1/3) ... [2024-11-16 17:00:26,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb1bf64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:00:26, skipping insertion in model container [2024-11-16 17:00:26,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:26" (2/3) ... [2024-11-16 17:00:26,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb1bf64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:00:26, skipping insertion in model container [2024-11-16 17:00:26,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:00:26" (3/3) ... [2024-11-16 17:00:26,693 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-91.i [2024-11-16 17:00:26,716 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:00:26,716 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:00:26,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:00:26,775 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;@1fcb08a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:00:26,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:00:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 17:00:26,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 17:00:26,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:00:26,789 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:26,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:00:26,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:00:26,794 INFO L85 PathProgramCache]: Analyzing trace with hash 118676896, now seen corresponding path program 1 times [2024-11-16 17:00:26,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:00:26,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527309511] [2024-11-16 17:00:26,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:00:26,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:00:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:00:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:00:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:00:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:00:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:00:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:00:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:00:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:00:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:00:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:00:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:00:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:00:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 17:00:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:00:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:00:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:00:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 17:00:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 17:00:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 17:00:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 17:00:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 17:00:27,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:00:27,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527309511] [2024-11-16 17:00:27,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527309511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:00:27,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:00:27,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:00:27,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144063129] [2024-11-16 17:00:27,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:00:27,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:00:27,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:00:27,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:00:27,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:00:27,203 INFO L87 Difference]: Start difference. First operand has 67 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 17:00:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:00:27,228 INFO L93 Difference]: Finished difference Result 126 states and 211 transitions. [2024-11-16 17:00:27,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:00:27,230 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2024-11-16 17:00:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:00:27,236 INFO L225 Difference]: With dead ends: 126 [2024-11-16 17:00:27,237 INFO L226 Difference]: Without dead ends: 62 [2024-11-16 17:00:27,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 17:00:27,245 INFO L432 NwaCegarLoop]: 91 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, 91 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 17:00:27,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:00:27,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-16 17:00:27,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-16 17:00:27,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 17:00:27,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2024-11-16 17:00:27,285 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 132 [2024-11-16 17:00:27,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:00:27,285 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2024-11-16 17:00:27,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 17:00:27,286 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2024-11-16 17:00:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 17:00:27,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:00:27,289 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:27,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:00:27,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:00:27,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:00:27,290 INFO L85 PathProgramCache]: Analyzing trace with hash 414086014, now seen corresponding path program 1 times [2024-11-16 17:00:27,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:00:27,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095164199] [2024-11-16 17:00:27,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:00:27,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:00:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:00:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:00:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:00:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:00:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:00:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:00:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:00:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:00:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:00:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:00:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:00:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:00:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 17:00:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:00:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:00:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:00:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 17:00:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 17:00:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 17:00:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 17:00:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:27,522 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 17:00:27,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:00:27,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095164199] [2024-11-16 17:00:27,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095164199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:00:27,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:00:27,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:00:27,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985422788] [2024-11-16 17:00:27,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:00:27,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 17:00:27,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:00:27,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 17:00:27,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:00:27,525 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 17:00:27,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:00:27,578 INFO L93 Difference]: Finished difference Result 177 states and 261 transitions. [2024-11-16 17:00:27,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 17:00:27,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-11-16 17:00:27,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:00:27,582 INFO L225 Difference]: With dead ends: 177 [2024-11-16 17:00:27,582 INFO L226 Difference]: Without dead ends: 118 [2024-11-16 17:00:27,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:00:27,585 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 81 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:00:27,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 238 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:00:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-16 17:00:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 64. [2024-11-16 17:00:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 17:00:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2024-11-16 17:00:27,599 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 132 [2024-11-16 17:00:27,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:00:27,601 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2024-11-16 17:00:27,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 17:00:27,601 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2024-11-16 17:00:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 17:00:27,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:00:27,603 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:27,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:00:27,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:00:27,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:00:27,603 INFO L85 PathProgramCache]: Analyzing trace with hash -179434037, now seen corresponding path program 1 times [2024-11-16 17:00:27,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:00:27,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108720988] [2024-11-16 17:00:27,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:00:27,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:00:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 17:00:27,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1980145551] [2024-11-16 17:00:27,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:00:27,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:00:27,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:00:27,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 17:00:27,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 17:00:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:00:27,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 17:00:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:00:27,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 17:00:27,939 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 17:00:27,940 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:00:27,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 17:00:28,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:00:28,145 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 17:00:28,221 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:00:28,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:00:28 BoogieIcfgContainer [2024-11-16 17:00:28,223 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:00:28,224 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:00:28,224 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:00:28,224 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:00:28,224 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:00:26" (3/4) ... [2024-11-16 17:00:28,226 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 17:00:28,227 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:00:28,228 INFO L158 Benchmark]: Toolchain (without parser) took 2453.27ms. Allocated memory is still 190.8MB. Free memory was 124.1MB in the beginning and 96.8MB in the end (delta: 27.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-16 17:00:28,228 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 109.1MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:00:28,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.84ms. Allocated memory is still 190.8MB. Free memory was 123.9MB in the beginning and 108.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 17:00:28,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.71ms. Allocated memory is still 190.8MB. Free memory was 108.1MB in the beginning and 104.1MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:00:28,229 INFO L158 Benchmark]: Boogie Preprocessor took 93.58ms. Allocated memory is still 190.8MB. Free memory was 104.1MB in the beginning and 161.7MB in the end (delta: -57.6MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-11-16 17:00:28,229 INFO L158 Benchmark]: IcfgBuilder took 450.77ms. Allocated memory is still 190.8MB. Free memory was 161.7MB in the beginning and 139.8MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 17:00:28,230 INFO L158 Benchmark]: TraceAbstraction took 1538.18ms. Allocated memory is still 190.8MB. Free memory was 139.0MB in the beginning and 96.8MB in the end (delta: 42.3MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2024-11-16 17:00:28,230 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 190.8MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:00:28,234 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.09ms. Allocated memory is still 109.1MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.84ms. Allocated memory is still 190.8MB. Free memory was 123.9MB in the beginning and 108.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.71ms. Allocated memory is still 190.8MB. Free memory was 108.1MB in the beginning and 104.1MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.58ms. Allocated memory is still 190.8MB. Free memory was 104.1MB in the beginning and 161.7MB in the end (delta: -57.6MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * IcfgBuilder took 450.77ms. Allocated memory is still 190.8MB. Free memory was 161.7MB in the beginning and 139.8MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1538.18ms. Allocated memory is still 190.8MB. Free memory was 139.0MB in the beginning and 96.8MB in the end (delta: 42.3MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 190.8MB. Free memory is still 96.8MB. 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 someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryArithmeticFLOAToperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -64; [L23] signed short int var_1_5 = 8; [L24] signed short int var_1_6 = 8; [L25] signed short int var_1_7 = 5; [L26] signed short int var_1_8 = 0; [L27] signed char var_1_9 = 5; [L28] signed char var_1_11 = 16; [L29] signed short int var_1_12 = 25; [L30] signed short int var_1_13 = 64; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 16; [L33] float var_1_17 = 1.2; [L34] float var_1_18 = 5.8; [L35] float var_1_19 = 10.25; [L36] float var_1_20 = 2.5; [L37] signed short int var_1_21 = 200; [L38] unsigned char var_1_24 = 1; [L39] unsigned char var_1_25 = 0; [L40] signed char var_1_26 = -5; [L41] signed short int last_1_var_1_1 = -64; [L42] signed short int last_1_var_1_13 = 64; [L43] unsigned char last_1_var_1_15 = 1; [L44] signed char last_1_var_1_26 = -5; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L127] last_1_var_1_1 = var_1_1 [L128] last_1_var_1_13 = var_1_13 [L129] last_1_var_1_15 = var_1_15 [L130] last_1_var_1_26 = var_1_26 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L140] RET updateLastVariables() [L141] CALL updateVariables() [L94] var_1_5 = __VERIFIER_nondet_short() [L95] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L95] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L96] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L96] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L97] var_1_6 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L98] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L99] CALL assume_abort_if_not(var_1_6 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L99] RET assume_abort_if_not(var_1_6 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L100] var_1_7 = __VERIFIER_nondet_short() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L102] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L102] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L103] var_1_8 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L104] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L105] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L105] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L106] var_1_11 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L107] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L108] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L108] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L109] var_1_12 = __VERIFIER_nondet_short() [L110] CALL assume_abort_if_not(var_1_12 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L110] RET assume_abort_if_not(var_1_12 >= -32768) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L111] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L111] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L112] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L112] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L113] var_1_16 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L114] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L115] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L115] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L116] var_1_18 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L117] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L118] var_1_19 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L119] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L120] var_1_20 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L121] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L122] var_1_25 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L123] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L124] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L124] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L141] RET updateVariables() [L142] CALL step() [L48] COND FALSE !(last_1_var_1_13 == last_1_var_1_1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L55] signed long int stepLocal_3 = (var_1_6 + var_1_8) - var_1_5; [L56] signed short int stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_2=-64, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L57] COND FALSE !(var_1_11 < stepLocal_2) [L64] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L66] COND TRUE var_1_11 < 5 [L67] var_1_17 = ((((var_1_18) > ((var_1_19 - var_1_20))) ? (var_1_18) : ((var_1_19 - var_1_20)))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L69] var_1_24 = var_1_25 [L70] var_1_26 = var_1_11 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=200, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L71] COND FALSE !(\read(var_1_24)) [L76] var_1_21 = (var_1_15 - 2) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L78] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_0=0, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L79] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_0=0, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L82] COND TRUE stepLocal_0 <= (var_1_21 / var_1_12) [L83] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L88] signed long int stepLocal_1 = var_1_1 * (var_1_15 % var_1_12); VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_1=0, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L89] COND TRUE (- var_1_15) >= stepLocal_1 [L90] var_1_13 = var_1_26 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L142] RET step() [L143] CALL, EXPR property() [L133-L134] return ((((((((last_1_var_1_13 == last_1_var_1_1) ? ((last_1_var_1_1 <= ((((last_1_var_1_13) > (last_1_var_1_26)) ? (last_1_var_1_13) : (last_1_var_1_26)))) ? (var_1_1 == ((signed short int) (last_1_var_1_1 + (((((last_1_var_1_15 - last_1_var_1_15)) < ((last_1_var_1_15 - last_1_var_1_15))) ? ((last_1_var_1_15 - last_1_var_1_15)) : ((last_1_var_1_15 - last_1_var_1_15))))))) : (var_1_1 == ((signed short int) (((((last_1_var_1_15 - last_1_var_1_15)) < (((last_1_var_1_15 - last_1_var_1_15) + -256))) ? ((last_1_var_1_15 - last_1_var_1_15)) : (((last_1_var_1_15 - last_1_var_1_15) + -256))))))) : 1) && (var_1_24 ? (var_1_9 == ((signed char) var_1_11)) : ((var_1_15 <= (var_1_21 / var_1_12)) ? (var_1_9 == ((signed char) var_1_11)) : (var_1_9 == ((signed char) var_1_11))))) && (((- var_1_15) >= (var_1_1 * (var_1_15 % var_1_12))) ? (var_1_13 == ((signed short int) var_1_26)) : 1)) && ((var_1_11 < var_1_1) ? ((var_1_7 == ((var_1_6 + var_1_8) - var_1_5)) ? (var_1_15 == ((unsigned char) var_1_16)) : (var_1_15 == ((unsigned char) var_1_16))) : (var_1_15 == ((unsigned char) var_1_16)))) && ((var_1_11 < 5) ? (var_1_17 == ((float) ((((var_1_18) > ((var_1_19 - var_1_20))) ? (var_1_18) : ((var_1_19 - var_1_20)))))) : 1)) && (var_1_24 ? ((var_1_24 && var_1_24) ? (var_1_21 == ((signed short int) var_1_15)) : 1) : (var_1_21 == ((signed short int) (var_1_15 - 2))))) && (var_1_24 == ((unsigned char) var_1_25))) && (var_1_26 == ((signed char) var_1_11)) ; VAL [\result=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 329 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 249 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 54 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 530 NumberOfCodeBlocks, 530 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 270 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1520/1520 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 17:00:28,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-91.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 2d8b2be6d6ac251f6f2682006f5d119ef2b6d6ee8107fbc3310af784e3db17b0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:00:30,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:00:30,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 17:00:30,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:00:30,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:00:30,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:00:30,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:00:30,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:00:30,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:00:30,269 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:00:30,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:00:30,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:00:30,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:00:30,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:00:30,273 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:00:30,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:00:30,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:00:30,273 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:00:30,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:00:30,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:00:30,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:00:30,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:00:30,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:00:30,275 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 17:00:30,275 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 17:00:30,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:00:30,276 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 17:00:30,276 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:00:30,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:00:30,276 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:00:30,277 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:00:30,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:00:30,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:00:30,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:00:30,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:00:30,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:00:30,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:00:30,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:00:30,279 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 17:00:30,279 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 17:00:30,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:00:30,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:00:30,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:00:30,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:00:30,280 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 -> 2d8b2be6d6ac251f6f2682006f5d119ef2b6d6ee8107fbc3310af784e3db17b0 [2024-11-16 17:00:30,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:00:30,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:00:30,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:00:30,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:00:30,560 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:00:30,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-91.i [2024-11-16 17:00:31,950 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:00:32,124 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:00:32,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-91.i [2024-11-16 17:00:32,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd6e6b0cb/3f98b802fd4f408ca875cd133e744feb/FLAGd3ec964ec [2024-11-16 17:00:32,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd6e6b0cb/3f98b802fd4f408ca875cd133e744feb [2024-11-16 17:00:32,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:00:32,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:00:32,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:00:32,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:00:32,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:00:32,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:00:32" (1/1) ... [2024-11-16 17:00:32,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700f8116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:32, skipping insertion in model container [2024-11-16 17:00:32,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:00:32" (1/1) ... [2024-11-16 17:00:32,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:00:32,349 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_50-while_file-91.i[915,928] [2024-11-16 17:00:32,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:00:32,419 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:00:32,431 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_50-while_file-91.i[915,928] [2024-11-16 17:00:32,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:00:32,479 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:00:32,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:32 WrapperNode [2024-11-16 17:00:32,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:00:32,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:00:32,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:00:32,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:00:32,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:32" (1/1) ... [2024-11-16 17:00:32,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:32" (1/1) ... [2024-11-16 17:00:32,532 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-11-16 17:00:32,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:00:32,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:00:32,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:00:32,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:00:32,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:32" (1/1) ... [2024-11-16 17:00:32,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:32" (1/1) ... [2024-11-16 17:00:32,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:32" (1/1) ... [2024-11-16 17:00:32,562 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 17:00:32,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:32" (1/1) ... [2024-11-16 17:00:32,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:32" (1/1) ... [2024-11-16 17:00:32,573 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:32" (1/1) ... [2024-11-16 17:00:32,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:32" (1/1) ... [2024-11-16 17:00:32,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:32" (1/1) ... [2024-11-16 17:00:32,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:32" (1/1) ... [2024-11-16 17:00:32,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:00:32,582 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:00:32,582 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:00:32,582 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:00:32,583 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:32" (1/1) ... [2024-11-16 17:00:32,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:00:32,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:00:32,614 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 17:00:32,616 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 17:00:32,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:00:32,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 17:00:32,648 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:00:32,649 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:00:32,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:00:32,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:00:32,733 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:00:32,738 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:00:33,277 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 17:00:33,280 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:00:33,295 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:00:33,296 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:00:33,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:00:33 BoogieIcfgContainer [2024-11-16 17:00:33,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:00:33,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:00:33,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:00:33,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:00:33,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:00:32" (1/3) ... [2024-11-16 17:00:33,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f49c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:00:33, skipping insertion in model container [2024-11-16 17:00:33,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:00:32" (2/3) ... [2024-11-16 17:00:33,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f49c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:00:33, skipping insertion in model container [2024-11-16 17:00:33,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:00:33" (3/3) ... [2024-11-16 17:00:33,307 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-91.i [2024-11-16 17:00:33,321 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:00:33,322 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:00:33,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:00:33,391 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;@151b4805, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:00:33,391 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:00:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 17:00:33,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 17:00:33,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:00:33,407 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:33,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:00:33,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:00:33,412 INFO L85 PathProgramCache]: Analyzing trace with hash 118676896, now seen corresponding path program 1 times [2024-11-16 17:00:33,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:00:33,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213595857] [2024-11-16 17:00:33,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:00:33,422 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 17:00:33,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:00:33,425 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 17:00:33,427 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 17:00:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:33,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 17:00:33,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:00:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-16 17:00:33,720 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:00:33,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:00:33,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213595857] [2024-11-16 17:00:33,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213595857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:00:33,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:00:33,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:00:33,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423615020] [2024-11-16 17:00:33,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:00:33,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:00:33,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:00:33,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:00:33,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:00:33,752 INFO L87 Difference]: Start difference. First operand has 67 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 17:00:33,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:00:33,774 INFO L93 Difference]: Finished difference Result 126 states and 211 transitions. [2024-11-16 17:00:33,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:00:33,776 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2024-11-16 17:00:33,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:00:33,783 INFO L225 Difference]: With dead ends: 126 [2024-11-16 17:00:33,783 INFO L226 Difference]: Without dead ends: 62 [2024-11-16 17:00:33,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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 17:00:33,790 INFO L432 NwaCegarLoop]: 91 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, 91 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 17:00:33,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:00:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-16 17:00:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-16 17:00:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 17:00:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2024-11-16 17:00:33,825 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 132 [2024-11-16 17:00:33,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:00:33,825 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2024-11-16 17:00:33,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 17:00:33,826 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2024-11-16 17:00:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 17:00:33,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:00:33,828 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:33,836 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 17:00:34,028 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 17:00:34,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:00:34,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:00:34,031 INFO L85 PathProgramCache]: Analyzing trace with hash 414086014, now seen corresponding path program 1 times [2024-11-16 17:00:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:00:34,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852855509] [2024-11-16 17:00:34,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:00:34,032 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 17:00:34,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:00:34,033 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 17:00:34,050 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 17:00:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:34,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 17:00:34,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:00:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 17:00:34,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:00:34,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:00:34,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852855509] [2024-11-16 17:00:34,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852855509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:00:34,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:00:34,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 17:00:34,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594608202] [2024-11-16 17:00:34,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:00:34,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:00:34,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:00:34,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:00:34,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 17:00:34,378 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 17:00:35,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:00:35,123 INFO L93 Difference]: Finished difference Result 181 states and 260 transitions. [2024-11-16 17:00:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 17:00:35,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-11-16 17:00:35,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:00:35,125 INFO L225 Difference]: With dead ends: 181 [2024-11-16 17:00:35,125 INFO L226 Difference]: Without dead ends: 122 [2024-11-16 17:00:35,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-16 17:00:35,127 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 108 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 17:00:35,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 292 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 17:00:35,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-16 17:00:35,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 65. [2024-11-16 17:00:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 17:00:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2024-11-16 17:00:35,141 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 132 [2024-11-16 17:00:35,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:00:35,146 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2024-11-16 17:00:35,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 17:00:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2024-11-16 17:00:35,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 17:00:35,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:00:35,148 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:35,159 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 17:00:35,348 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 17:00:35,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:00:35,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:00:35,349 INFO L85 PathProgramCache]: Analyzing trace with hash -179434037, now seen corresponding path program 1 times [2024-11-16 17:00:35,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:00:35,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722312720] [2024-11-16 17:00:35,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:00:35,350 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 17:00:35,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:00:35,353 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 17:00:35,353 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 17:00:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:00:35,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 17:00:35,620 INFO L278 TraceCheckSpWp]: Computing forward predicates...