./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-99.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-99.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 9704c260bb320bd8ff033a8e82239ebc7c1dec84cc605a8d02c980829b53fa09 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:01:17,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:01:17,280 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:01:17,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:01:17,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:01:17,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:01:17,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:01:17,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:01:17,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:01:17,317 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:01:17,317 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:01:17,317 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:01:17,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:01:17,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:01:17,319 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:01:17,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:01:17,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:01:17,320 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:01:17,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:01:17,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:01:17,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:01:17,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:01:17,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:01:17,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:01:17,322 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:01:17,323 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:01:17,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:01:17,323 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:01:17,323 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:01:17,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:01:17,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:01:17,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:01:17,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:01:17,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:01:17,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:01:17,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:01:17,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:01:17,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:01:17,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:01:17,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:01:17,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:01:17,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:01:17,328 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 -> 9704c260bb320bd8ff033a8e82239ebc7c1dec84cc605a8d02c980829b53fa09 [2024-11-16 17:01:17,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:01:17,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:01:17,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:01:17,642 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:01:17,643 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:01:17,645 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-99.i [2024-11-16 17:01:19,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:01:19,394 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:01:19,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-99.i [2024-11-16 17:01:19,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ba19095f/987bdca507c043a6b09ebe49cb4cd517/FLAGb9d25420b [2024-11-16 17:01:19,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ba19095f/987bdca507c043a6b09ebe49cb4cd517 [2024-11-16 17:01:19,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:01:19,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:01:19,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:01:19,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:01:19,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:01:19,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:01:19" (1/1) ... [2024-11-16 17:01:19,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29346f29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:19, skipping insertion in model container [2024-11-16 17:01:19,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:01:19" (1/1) ... [2024-11-16 17:01:19,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:01:19,961 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-99.i[915,928] [2024-11-16 17:01:20,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:01:20,068 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:01:20,083 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-99.i[915,928] [2024-11-16 17:01:20,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:01:20,153 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:01:20,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:20 WrapperNode [2024-11-16 17:01:20,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:01:20,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:01:20,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:01:20,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:01:20,161 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:01:20" (1/1) ... [2024-11-16 17:01:20,178 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:01:20" (1/1) ... [2024-11-16 17:01:20,214 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-11-16 17:01:20,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:01:20,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:01:20,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:01:20,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:01:20,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:20" (1/1) ... [2024-11-16 17:01:20,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:20" (1/1) ... [2024-11-16 17:01:20,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:20" (1/1) ... [2024-11-16 17:01:20,278 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:01:20,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:20" (1/1) ... [2024-11-16 17:01:20,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:20" (1/1) ... [2024-11-16 17:01:20,288 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:20" (1/1) ... [2024-11-16 17:01:20,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:20" (1/1) ... [2024-11-16 17:01:20,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:20" (1/1) ... [2024-11-16 17:01:20,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:20" (1/1) ... [2024-11-16 17:01:20,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:01:20,299 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:01:20,303 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:01:20,303 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:01:20,304 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:20" (1/1) ... [2024-11-16 17:01:20,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:01:20,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:01:20,343 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:01:20,349 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:01:20,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:01:20,400 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:01:20,400 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:01:20,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:01:20,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:01:20,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:01:20,498 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:01:20,499 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:01:20,928 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L138: havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2024-11-16 17:01:20,973 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 17:01:20,973 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:01:21,000 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:01:21,001 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:01:21,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:01:21 BoogieIcfgContainer [2024-11-16 17:01:21,001 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:01:21,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:01:21,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:01:21,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:01:21,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:01:19" (1/3) ... [2024-11-16 17:01:21,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b6d38d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:01:21, skipping insertion in model container [2024-11-16 17:01:21,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:20" (2/3) ... [2024-11-16 17:01:21,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b6d38d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:01:21, skipping insertion in model container [2024-11-16 17:01:21,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:01:21" (3/3) ... [2024-11-16 17:01:21,010 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-99.i [2024-11-16 17:01:21,024 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:01:21,025 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:01:21,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:01:21,093 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;@6521273b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:01:21,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:01:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 60 states have internal predecessors, (80), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 17:01:21,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-16 17:01:21,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:01:21,116 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:21,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:01:21,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:01:21,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2129307533, now seen corresponding path program 1 times [2024-11-16 17:01:21,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:01:21,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336649243] [2024-11-16 17:01:21,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:21,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:01:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:01:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:01:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:01:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:01:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:01:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:01:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:01:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:01:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:01:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:01:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:01:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:01:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 17:01:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:01:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 17:01:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 17:01:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 17:01:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 17:01:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 17:01:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 17:01:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 17:01:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:01:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:01:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:01:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 17:01:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:01:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 17:01:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 17:01:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-16 17:01:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:21,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 17:01:21,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:01:21,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336649243] [2024-11-16 17:01:21,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336649243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:01:21,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:01:21,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:01:21,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886602135] [2024-11-16 17:01:21,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:01:21,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:01:21,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:01:21,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:01:21,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:01:21,697 INFO L87 Difference]: Start difference. First operand has 91 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 60 states have internal predecessors, (80), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-16 17:01:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:01:21,751 INFO L93 Difference]: Finished difference Result 174 states and 298 transitions. [2024-11-16 17:01:21,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:01:21,755 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 185 [2024-11-16 17:01:21,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:01:21,766 INFO L225 Difference]: With dead ends: 174 [2024-11-16 17:01:21,768 INFO L226 Difference]: Without dead ends: 86 [2024-11-16 17:01:21,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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:01:21,779 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:01:21,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:01:21,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-16 17:01:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-16 17:01:21,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 17:01:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 130 transitions. [2024-11-16 17:01:21,830 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 130 transitions. Word has length 185 [2024-11-16 17:01:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:01:21,832 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 130 transitions. [2024-11-16 17:01:21,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-16 17:01:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 130 transitions. [2024-11-16 17:01:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-16 17:01:21,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:01:21,837 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:21,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:01:21,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:01:21,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:01:21,838 INFO L85 PathProgramCache]: Analyzing trace with hash 243817136, now seen corresponding path program 1 times [2024-11-16 17:01:21,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:01:21,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553212480] [2024-11-16 17:01:21,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:21,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:01:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:22,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:01:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:22,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:01:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:22,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:01:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:22,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:01:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:22,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:01:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:22,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:01:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:22,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:01:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:22,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:01:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:01:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:01:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:01:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:01:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 17:01:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:01:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 17:01:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 17:01:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 17:01:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 17:01:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 17:01:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 17:01:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 17:01:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:01:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:01:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:01:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 17:01:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:01:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 17:01:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 17:01:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-16 17:01:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 21 proven. 141 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2024-11-16 17:01:23,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:01:23,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553212480] [2024-11-16 17:01:23,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553212480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:01:23,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647636405] [2024-11-16 17:01:23,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:23,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:01:23,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:01:23,153 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:01:23,178 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:01:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:23,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 17:01:23,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:01:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 455 proven. 141 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2024-11-16 17:01:24,273 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:01:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 21 proven. 144 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-11-16 17:01:24,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647636405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:01:24,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 17:01:24,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-16 17:01:24,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290125519] [2024-11-16 17:01:24,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 17:01:24,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 17:01:24,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:01:24,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 17:01:24,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-16 17:01:24,804 INFO L87 Difference]: Start difference. First operand 86 states and 130 transitions. Second operand has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2024-11-16 17:01:25,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:01:25,958 INFO L93 Difference]: Finished difference Result 371 states and 536 transitions. [2024-11-16 17:01:25,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-16 17:01:25,959 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 185 [2024-11-16 17:01:25,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:01:25,963 INFO L225 Difference]: With dead ends: 371 [2024-11-16 17:01:25,965 INFO L226 Difference]: Without dead ends: 288 [2024-11-16 17:01:25,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 423 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2024-11-16 17:01:25,970 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 450 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 17:01:25,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 618 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 17:01:25,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-16 17:01:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 96. [2024-11-16 17:01:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 63 states have (on average 1.253968253968254) internal successors, (79), 63 states have internal predecessors, (79), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 17:01:26,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 137 transitions. [2024-11-16 17:01:26,015 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 137 transitions. Word has length 185 [2024-11-16 17:01:26,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:01:26,017 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 137 transitions. [2024-11-16 17:01:26,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2024-11-16 17:01:26,018 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 137 transitions. [2024-11-16 17:01:26,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-16 17:01:26,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:01:26,022 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:26,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 17:01:26,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:01:26,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:01:26,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:01:26,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1751368945, now seen corresponding path program 1 times [2024-11-16 17:01:26,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:01:26,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146552048] [2024-11-16 17:01:26,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:26,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:01:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 17:01:26,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [254744396] [2024-11-16 17:01:26,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:26,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:01:26,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:01:26,327 INFO L229 MonitoredProcess]: Starting monitored process 3 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:01:26,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 17:01:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:01:26,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 17:01:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:01:26,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 17:01:26,605 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 17:01:26,606 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:01:26,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 17:01:26,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-16 17:01:26,811 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 17:01:26,921 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:01:26,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:01:26 BoogieIcfgContainer [2024-11-16 17:01:26,925 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:01:26,926 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:01:26,926 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:01:26,926 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:01:26,926 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:01:21" (3/4) ... [2024-11-16 17:01:26,931 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 17:01:26,932 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:01:26,934 INFO L158 Benchmark]: Toolchain (without parser) took 7190.28ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 109.7MB in the beginning and 95.9MB in the end (delta: 13.9MB). Peak memory consumption was 104.8MB. Max. memory is 16.1GB. [2024-11-16 17:01:26,934 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory was 118.9MB in the beginning and 118.7MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:01:26,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.68ms. Allocated memory is still 159.4MB. Free memory was 109.7MB in the beginning and 93.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 17:01:26,938 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.83ms. Allocated memory is still 159.4MB. Free memory was 93.0MB in the beginning and 88.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 17:01:26,938 INFO L158 Benchmark]: Boogie Preprocessor took 83.95ms. Allocated memory is still 159.4MB. Free memory was 88.8MB in the beginning and 83.0MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 17:01:26,939 INFO L158 Benchmark]: IcfgBuilder took 701.87ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 119.6MB in the end (delta: -36.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 17:01:26,939 INFO L158 Benchmark]: TraceAbstraction took 5922.34ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 118.8MB in the beginning and 95.9MB in the end (delta: 22.9MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. [2024-11-16 17:01:26,939 INFO L158 Benchmark]: Witness Printer took 6.64ms. Allocated memory is still 247.5MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:01:26,941 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.22ms. Allocated memory is still 159.4MB. Free memory was 118.9MB in the beginning and 118.7MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.68ms. Allocated memory is still 159.4MB. Free memory was 109.7MB in the beginning and 93.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.83ms. Allocated memory is still 159.4MB. Free memory was 93.0MB in the beginning and 88.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.95ms. Allocated memory is still 159.4MB. Free memory was 88.8MB in the beginning and 83.0MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 701.87ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 119.6MB in the end (delta: -36.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5922.34ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 118.8MB in the beginning and 95.9MB in the end (delta: 22.9MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. * Witness Printer took 6.64ms. Allocated memory is still 247.5MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryArithmeticDOUBLEoperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 0; [L27] signed long int var_1_6 = 25; [L28] double var_1_10 = 99999999999.25; [L29] double var_1_11 = 255.25; [L30] double var_1_12 = 1.125; [L31] unsigned char var_1_13 = 2; [L32] unsigned char var_1_14 = 5; [L33] unsigned char var_1_15 = 32; [L34] unsigned char var_1_16 = 4; [L35] unsigned char var_1_17 = 2; [L36] signed char var_1_18 = 4; [L37] signed char var_1_19 = 16; [L38] signed char var_1_20 = 32; [L39] signed char var_1_21 = 25; [L40] signed char var_1_22 = 1; [L41] signed char var_1_23 = 100; [L42] double var_1_24 = 3.125; [L43] double var_1_25 = 0.0; [L44] unsigned short int var_1_26 = 32; [L45] unsigned short int var_1_27 = 36217; [L46] unsigned char var_1_28 = 2; VAL [isInitial=0, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L142] isInitial = 1 [L143] FCALL initially() [L144] COND TRUE 1 [L145] FCALL updateLastVariables() [L146] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L91] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L91] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L92] var_1_3 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=25] [L93] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=25] [L94] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L94] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L95] var_1_4 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=25] [L96] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=25] [L97] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L97] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L98] var_1_5 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_6=25] [L99] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_6=25] [L100] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L100] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L101] var_1_11 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L102] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=399999999997/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L103] var_1_12 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L104] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L105] var_1_14 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L106] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L107] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L107] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L108] var_1_16 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L109] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L110] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L110] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L111] var_1_17 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L112] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L113] CALL assume_abort_if_not(var_1_17 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L113] RET assume_abort_if_not(var_1_17 <= 127) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L114] var_1_19 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L115] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L116] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L116] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L117] var_1_20 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L118] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L119] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L119] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L120] var_1_21 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_21 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L121] RET assume_abort_if_not(var_1_21 >= -63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L122] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L122] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L123] var_1_22 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_22 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L124] RET assume_abort_if_not(var_1_22 >= -1) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L125] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L125] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L126] var_1_23 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L127] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L128] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L128] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L129] var_1_25 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_25 >= 4611686.018427382800e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L130] RET assume_abort_if_not((var_1_25 >= 4611686.018427382800e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L131] var_1_27 = __VERIFIER_nondet_ushort() [L132] CALL assume_abort_if_not(var_1_27 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L132] RET assume_abort_if_not(var_1_27 >= 32767) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L133] CALL assume_abort_if_not(var_1_27 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L133] RET assume_abort_if_not(var_1_27 <= 65534) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L146] RET updateVariables() [L147] CALL step() [L50] COND TRUE \read(var_1_2) [L51] var_1_1 = (var_1_3 || var_1_4) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L55] COND TRUE ! var_1_5 [L56] var_1_15 = (((((var_1_16 + var_1_17)) > (var_1_14)) ? ((var_1_16 + var_1_17)) : (var_1_14))) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L58] var_1_18 = ((((((var_1_19 - var_1_20) + var_1_21)) > ((var_1_22 - var_1_23))) ? (((var_1_19 - var_1_20) + var_1_21)) : ((var_1_22 - var_1_23)))) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L59] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L62] var_1_28 = var_1_16 [L63] var_1_6 = ((var_1_28 - var_1_26) + var_1_26) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L64] COND FALSE !(var_1_26 < (var_1_6 * var_1_28)) [L71] var_1_10 = var_1_12 VAL [isInitial=1, var_1_10=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L73] signed long int stepLocal_0 = - var_1_26; VAL [isInitial=1, stepLocal_0=-32, var_1_10=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L74] COND TRUE var_1_12 != var_1_10 [L75] var_1_13 = var_1_14 VAL [isInitial=1, stepLocal_0=-32, var_1_10=2, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L83] signed char stepLocal_1 = var_1_23; VAL [isInitial=1, stepLocal_0=-32, stepLocal_1=0, var_1_10=2, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L84] EXPR var_1_20 ^ var_1_28 VAL [isInitial=1, stepLocal_0=-32, stepLocal_1=0, var_1_10=2, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L84] COND TRUE stepLocal_1 >= (var_1_20 ^ var_1_28) [L85] var_1_24 = ((((((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) > (((var_1_25 - 25.5) - 127.125))) ? (((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) : (((var_1_25 - 25.5) - 127.125)))) VAL [isInitial=1, stepLocal_0=-32, var_1_10=2, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L147] RET step() [L148] CALL, EXPR property() [L138] EXPR ((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 || (var_1_4 || var_1_5))))) && (var_1_6 == ((signed long int) ((var_1_28 - var_1_26) + var_1_26)))) && ((var_1_26 < (var_1_6 * var_1_28)) ? (var_1_3 ? ((var_1_26 <= var_1_6) ? (var_1_10 == ((double) (var_1_11 - var_1_12))) : 1) : 1) : (var_1_10 == ((double) var_1_12)))) && ((var_1_12 != var_1_10) ? (var_1_13 == ((unsigned char) var_1_14)) : (((- var_1_26) > var_1_14) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) 25))))) && ((! var_1_5) ? (var_1_15 == ((unsigned char) (((((var_1_16 + var_1_17)) > (var_1_14)) ? ((var_1_16 + var_1_17)) : (var_1_14))))) : 1)) && (var_1_18 == ((signed char) ((((((var_1_19 - var_1_20) + var_1_21)) > ((var_1_22 - var_1_23))) ? (((var_1_19 - var_1_20) + var_1_21)) : ((var_1_22 - var_1_23))))))) && ((var_1_23 >= (var_1_20 ^ var_1_28)) ? (var_1_24 == ((double) ((((((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) > (((var_1_25 - 25.5) - 127.125))) ? (((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) : (((var_1_25 - 25.5) - 127.125)))))) : 1) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L138-L139] return ((((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 || (var_1_4 || var_1_5))))) && (var_1_6 == ((signed long int) ((var_1_28 - var_1_26) + var_1_26)))) && ((var_1_26 < (var_1_6 * var_1_28)) ? (var_1_3 ? ((var_1_26 <= var_1_6) ? (var_1_10 == ((double) (var_1_11 - var_1_12))) : 1) : 1) : (var_1_10 == ((double) var_1_12)))) && ((var_1_12 != var_1_10) ? (var_1_13 == ((unsigned char) var_1_14)) : (((- var_1_26) > var_1_14) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) 25))))) && ((! var_1_5) ? (var_1_15 == ((unsigned char) (((((var_1_16 + var_1_17)) > (var_1_14)) ? ((var_1_16 + var_1_17)) : (var_1_14))))) : 1)) && (var_1_18 == ((signed char) ((((((var_1_19 - var_1_20) + var_1_21)) > ((var_1_22 - var_1_23))) ? (((var_1_19 - var_1_20) + var_1_21)) : ((var_1_22 - var_1_23))))))) && ((var_1_23 >= (var_1_20 ^ var_1_28)) ? (var_1_24 == ((double) ((((((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) > (((var_1_25 - 25.5) - 127.125))) ? (((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) : (((var_1_25 - 25.5) - 127.125)))))) : 1)) && (var_1_1 ? (var_1_26 == ((unsigned short int) ((((((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) < ((var_1_27 - var_1_17))) ? (((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) : ((var_1_27 - var_1_17)))))) : 1)) && (var_1_28 == ((unsigned char) var_1_16)) ; [L148] RET, EXPR property() [L148] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 3, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 479 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 450 mSDsluCounter, 746 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 481 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 629 IncrementalHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 265 mSDtfsCounter, 629 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 559 GetRequests, 512 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=2, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 192 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 925 NumberOfCodeBlocks, 925 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 736 ConstructedInterpolants, 0 QuantifiedInterpolants, 3037 SizeOfPredicates, 4 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6070/6496 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:01:26,983 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-99.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 9704c260bb320bd8ff033a8e82239ebc7c1dec84cc605a8d02c980829b53fa09 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:01:29,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:01:29,308 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 17:01:29,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:01:29,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:01:29,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:01:29,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:01:29,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:01:29,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:01:29,344 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:01:29,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:01:29,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:01:29,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:01:29,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:01:29,351 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:01:29,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:01:29,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:01:29,352 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:01:29,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:01:29,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:01:29,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:01:29,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:01:29,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:01:29,355 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 17:01:29,355 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 17:01:29,356 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:01:29,356 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 17:01:29,356 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:01:29,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:01:29,357 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:01:29,357 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:01:29,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:01:29,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:01:29,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:01:29,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:01:29,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:01:29,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:01:29,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:01:29,360 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 17:01:29,360 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 17:01:29,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:01:29,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:01:29,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:01:29,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:01:29,361 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 -> 9704c260bb320bd8ff033a8e82239ebc7c1dec84cc605a8d02c980829b53fa09 [2024-11-16 17:01:29,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:01:29,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:01:29,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:01:29,720 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:01:29,720 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:01:29,721 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-99.i [2024-11-16 17:01:31,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:01:31,440 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:01:31,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-99.i [2024-11-16 17:01:31,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78dcded3f/41fb4e6986f84e31b7f06e051531015d/FLAG356497c21 [2024-11-16 17:01:31,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78dcded3f/41fb4e6986f84e31b7f06e051531015d [2024-11-16 17:01:31,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:01:31,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:01:31,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:01:31,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:01:31,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:01:31,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:01:31" (1/1) ... [2024-11-16 17:01:31,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4942ffe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:31, skipping insertion in model container [2024-11-16 17:01:31,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:01:31" (1/1) ... [2024-11-16 17:01:31,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:01:31,687 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-99.i[915,928] [2024-11-16 17:01:31,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:01:31,788 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:01:31,799 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-99.i[915,928] [2024-11-16 17:01:31,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:01:31,879 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:01:31,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:31 WrapperNode [2024-11-16 17:01:31,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:01:31,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:01:31,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:01:31,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:01:31,887 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:01:31" (1/1) ... [2024-11-16 17:01:31,906 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:01:31" (1/1) ... [2024-11-16 17:01:31,946 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-11-16 17:01:31,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:01:31,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:01:31,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:01:31,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:01:31,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:31" (1/1) ... [2024-11-16 17:01:31,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:31" (1/1) ... [2024-11-16 17:01:31,964 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:31" (1/1) ... [2024-11-16 17:01:31,981 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:01:31,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:31" (1/1) ... [2024-11-16 17:01:31,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:31" (1/1) ... [2024-11-16 17:01:32,002 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:31" (1/1) ... [2024-11-16 17:01:32,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:31" (1/1) ... [2024-11-16 17:01:32,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:31" (1/1) ... [2024-11-16 17:01:32,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:31" (1/1) ... [2024-11-16 17:01:32,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:01:32,018 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:01:32,018 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:01:32,018 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:01:32,019 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:31" (1/1) ... [2024-11-16 17:01:32,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:01:32,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:01:32,059 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:01:32,068 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:01:32,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:01:32,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 17:01:32,112 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:01:32,113 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:01:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:01:32,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:01:32,221 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:01:32,223 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:01:35,515 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 17:01:35,515 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:01:35,533 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:01:35,534 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:01:35,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:01:35 BoogieIcfgContainer [2024-11-16 17:01:35,534 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:01:35,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:01:35,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:01:35,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:01:35,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:01:31" (1/3) ... [2024-11-16 17:01:35,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437e2e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:01:35, skipping insertion in model container [2024-11-16 17:01:35,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:31" (2/3) ... [2024-11-16 17:01:35,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437e2e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:01:35, skipping insertion in model container [2024-11-16 17:01:35,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:01:35" (3/3) ... [2024-11-16 17:01:35,543 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-99.i [2024-11-16 17:01:35,565 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:01:35,566 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:01:35,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:01:35,630 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;@131b6fb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:01:35,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:01:35,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 49 states have internal predecessors, (62), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 17:01:35,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-16 17:01:35,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:01:35,648 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:35,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:01:35,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:01:35,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1232185757, now seen corresponding path program 1 times [2024-11-16 17:01:35,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:01:35,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830421959] [2024-11-16 17:01:35,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:35,667 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:01:35,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:01:35,670 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:01:35,672 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:01:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:36,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 17:01:36,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:01:36,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2024-11-16 17:01:36,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:01:36,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:01:36,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830421959] [2024-11-16 17:01:36,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830421959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:01:36,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:01:36,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:01:36,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182987435] [2024-11-16 17:01:36,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:01:36,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:01:36,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:01:36,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:01:36,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:01:36,169 INFO L87 Difference]: Start difference. First operand has 80 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 49 states have internal predecessors, (62), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-16 17:01:36,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:01:36,204 INFO L93 Difference]: Finished difference Result 152 states and 262 transitions. [2024-11-16 17:01:36,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:01:36,206 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 182 [2024-11-16 17:01:36,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:01:36,216 INFO L225 Difference]: With dead ends: 152 [2024-11-16 17:01:36,216 INFO L226 Difference]: Without dead ends: 75 [2024-11-16 17:01:36,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 181 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:01:36,226 INFO L432 NwaCegarLoop]: 112 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, 112 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:01:36,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:01:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-16 17:01:36,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-16 17:01:36,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 17:01:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 112 transitions. [2024-11-16 17:01:36,285 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 112 transitions. Word has length 182 [2024-11-16 17:01:36,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:01:36,285 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 112 transitions. [2024-11-16 17:01:36,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-16 17:01:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2024-11-16 17:01:36,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-16 17:01:36,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:01:36,289 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:36,300 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:01:36,490 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:01:36,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:01:36,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:01:36,491 INFO L85 PathProgramCache]: Analyzing trace with hash -412712614, now seen corresponding path program 1 times [2024-11-16 17:01:36,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:01:36,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941559104] [2024-11-16 17:01:36,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:36,493 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:01:36,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:01:36,494 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:01:36,495 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:01:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:36,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 17:01:36,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:01:38,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 455 proven. 141 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2024-11-16 17:01:38,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:01:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 21 proven. 144 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-11-16 17:01:39,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:01:39,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941559104] [2024-11-16 17:01:39,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941559104] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:01:39,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 17:01:39,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-16 17:01:39,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483300205] [2024-11-16 17:01:39,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 17:01:39,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 17:01:39,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:01:39,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 17:01:39,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-16 17:01:39,486 INFO L87 Difference]: Start difference. First operand 75 states and 112 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-16 17:01:41,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:01:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:01:43,000 INFO L93 Difference]: Finished difference Result 245 states and 350 transitions. [2024-11-16 17:01:43,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-16 17:01:43,001 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 182 [2024-11-16 17:01:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:01:43,004 INFO L225 Difference]: With dead ends: 245 [2024-11-16 17:01:43,004 INFO L226 Difference]: Without dead ends: 173 [2024-11-16 17:01:43,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-11-16 17:01:43,007 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 168 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-16 17:01:43,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 319 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-16 17:01:43,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-16 17:01:43,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 85. [2024-11-16 17:01:43,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 17:01:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 119 transitions. [2024-11-16 17:01:43,045 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 119 transitions. Word has length 182 [2024-11-16 17:01:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:01:43,046 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 119 transitions. [2024-11-16 17:01:43,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-16 17:01:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 119 transitions. [2024-11-16 17:01:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-16 17:01:43,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:01:43,053 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:43,068 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:01:43,254 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:01:43,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:01:43,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:01:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash -283629895, now seen corresponding path program 1 times [2024-11-16 17:01:43,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:01:43,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89051081] [2024-11-16 17:01:43,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:43,256 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:01:43,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:01:43,259 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:01:43,260 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:01:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:43,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 17:01:43,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:01:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 27 proven. 760 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2024-11-16 17:01:45,341 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:01:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 27 proven. 57 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-16 17:01:46,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:01:46,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89051081] [2024-11-16 17:01:46,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89051081] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:01:46,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 17:01:46,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-16 17:01:46,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386601839] [2024-11-16 17:01:46,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 17:01:46,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 17:01:46,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:01:46,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 17:01:46,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-16 17:01:46,085 INFO L87 Difference]: Start difference. First operand 85 states and 119 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2024-11-16 17:01:49,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:01:49,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:01:49,804 INFO L93 Difference]: Finished difference Result 223 states and 298 transitions. [2024-11-16 17:01:49,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 17:01:49,805 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) Word has length 182 [2024-11-16 17:01:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:01:49,807 INFO L225 Difference]: With dead ends: 223 [2024-11-16 17:01:49,807 INFO L226 Difference]: Without dead ends: 141 [2024-11-16 17:01:49,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2024-11-16 17:01:49,812 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 180 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-16 17:01:49,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 233 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-16 17:01:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-16 17:01:49,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 125. [2024-11-16 17:01:49,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 79 states have (on average 1.139240506329114) internal successors, (90), 80 states have internal predecessors, (90), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 17:01:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2024-11-16 17:01:49,838 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 182 [2024-11-16 17:01:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:01:49,839 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2024-11-16 17:01:49,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2024-11-16 17:01:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2024-11-16 17:01:49,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-16 17:01:49,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:01:49,842 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:49,856 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 (4)] Ended with exit code 0 [2024-11-16 17:01:50,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:01:50,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:01:50,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:01:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash -333790736, now seen corresponding path program 1 times [2024-11-16 17:01:50,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:01:50,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815301] [2024-11-16 17:01:50,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:50,051 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:01:50,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:01:50,054 INFO L229 MonitoredProcess]: Starting monitored process 5 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:01:50,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 17:01:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:50,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 17:01:50,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:01:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 17:01:51,157 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:01:51,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:01:51,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815301] [2024-11-16 17:01:51,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:01:51,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:01:51,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:01:51,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593019017] [2024-11-16 17:01:51,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:01:51,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:01:51,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:01:51,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:01:51,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:01:51,160 INFO L87 Difference]: Start difference. First operand 125 states and 166 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 17:01:52,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:01:52,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:01:52,688 INFO L93 Difference]: Finished difference Result 369 states and 492 transitions. [2024-11-16 17:01:52,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:01:52,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2024-11-16 17:01:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:01:52,724 INFO L225 Difference]: With dead ends: 369 [2024-11-16 17:01:52,726 INFO L226 Difference]: Without dead ends: 247 [2024-11-16 17:01:52,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:01:52,728 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 22 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 17:01:52,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 307 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 17:01:52,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-16 17:01:52,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244. [2024-11-16 17:01:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 153 states have (on average 1.1372549019607843) internal successors, (174), 155 states have internal predecessors, (174), 76 states have call successors, (76), 14 states have call predecessors, (76), 14 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-16 17:01:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 326 transitions. [2024-11-16 17:01:52,788 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 326 transitions. Word has length 183 [2024-11-16 17:01:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:01:52,789 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 326 transitions. [2024-11-16 17:01:52,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 17:01:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 326 transitions. [2024-11-16 17:01:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-16 17:01:52,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:01:52,793 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:52,810 INFO L540 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 (5)] Forceful destruction successful, exit code 0 [2024-11-16 17:01:52,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:01:52,995 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:01:52,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:01:52,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1409019599, now seen corresponding path program 1 times [2024-11-16 17:01:52,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:01:52,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754596793] [2024-11-16 17:01:52,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:52,996 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:01:52,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:01:52,999 INFO L229 MonitoredProcess]: Starting monitored process 6 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:01:53,001 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 (6)] Waiting until timeout for monitored process [2024-11-16 17:01:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:53,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-16 17:01:53,487 INFO L278 TraceCheckSpWp]: Computing forward predicates...