./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.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 64360fc7d3c5d5814f250bc67771c1266affbe7be077c4ce76d53cff763882cf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:26:13,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:26:13,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:26:13,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:26:13,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:26:13,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:26:13,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:26:13,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:26:13,680 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:26:13,680 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:26:13,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:26:13,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:26:13,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:26:13,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:26:13,682 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:26:13,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:26:13,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:26:13,683 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:26:13,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:26:13,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:26:13,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:26:13,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:26:13,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:26:13,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:26:13,685 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:26:13,685 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:26:13,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:26:13,685 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:26:13,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:26:13,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:26:13,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:26:13,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:26:13,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:26:13,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:26:13,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:26:13,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:26:13,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:26:13,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:26:13,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:26:13,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:26:13,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:26:13,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:26:13,689 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 -> 64360fc7d3c5d5814f250bc67771c1266affbe7be077c4ce76d53cff763882cf [2024-10-14 11:26:13,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:26:13,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:26:13,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:26:13,908 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:26:13,908 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:26:13,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i [2024-10-14 11:26:15,074 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:26:15,239 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:26:15,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i [2024-10-14 11:26:15,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101a1a7ee/c4a256dceb084c11a913d3cc91bdf839/FLAG037aceaca [2024-10-14 11:26:15,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101a1a7ee/c4a256dceb084c11a913d3cc91bdf839 [2024-10-14 11:26:15,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:26:15,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:26:15,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:26:15,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:26:15,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:26:15,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:26:15" (1/1) ... [2024-10-14 11:26:15,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ea181d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:26:15, skipping insertion in model container [2024-10-14 11:26:15,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:26:15" (1/1) ... [2024-10-14 11:26:15,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:26:15,405 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i[916,929] [2024-10-14 11:26:15,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:26:15,480 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:26:15,489 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i[916,929] [2024-10-14 11:26:15,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:26:15,580 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:26:15,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:26:15 WrapperNode [2024-10-14 11:26:15,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:26:15,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:26:15,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:26:15,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:26:15,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:26:15" (1/1) ... [2024-10-14 11:26:15,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:26:15" (1/1) ... [2024-10-14 11:26:15,635 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-10-14 11:26:15,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:26:15,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:26:15,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:26:15,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:26:15,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:26:15" (1/1) ... [2024-10-14 11:26:15,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:26:15" (1/1) ... [2024-10-14 11:26:15,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:26:15" (1/1) ... [2024-10-14 11:26:15,676 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:26:15,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:26:15" (1/1) ... [2024-10-14 11:26:15,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:26:15" (1/1) ... [2024-10-14 11:26:15,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:26:15" (1/1) ... [2024-10-14 11:26:15,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:26:15" (1/1) ... [2024-10-14 11:26:15,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:26:15" (1/1) ... [2024-10-14 11:26:15,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:26:15" (1/1) ... [2024-10-14 11:26:15,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:26:15,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:26:15,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:26:15,714 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:26:15,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:26:15" (1/1) ... [2024-10-14 11:26:15,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:26:15,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:26:15,741 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-10-14 11:26:15,746 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-10-14 11:26:15,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:26:15,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:26:15,779 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:26:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:26:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:26:15,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:26:15,851 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:26:15,852 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:26:16,183 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-14 11:26:16,183 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:26:16,232 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:26:16,233 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:26:16,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:26:16 BoogieIcfgContainer [2024-10-14 11:26:16,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:26:16,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:26:16,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:26:16,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:26:16,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:26:15" (1/3) ... [2024-10-14 11:26:16,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4222bb79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:26:16, skipping insertion in model container [2024-10-14 11:26:16,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:26:15" (2/3) ... [2024-10-14 11:26:16,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4222bb79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:26:16, skipping insertion in model container [2024-10-14 11:26:16,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:26:16" (3/3) ... [2024-10-14 11:26:16,243 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-51.i [2024-10-14 11:26:16,259 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:26:16,260 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:26:16,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:26:16,318 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;@73f71382, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:26:16,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:26:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 11:26:16,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 11:26:16,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:26:16,336 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:26:16,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:26:16,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:26:16,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1230719355, now seen corresponding path program 1 times [2024-10-14 11:26:16,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:26:16,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187224561] [2024-10-14 11:26:16,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:26:16,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:26:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:26:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:26:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:26:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 11:26:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:26:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:26:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:26:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:26:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:26:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:26:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:26:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:26:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:26:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:26:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:26:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:26:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:26:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:26:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:26:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:26:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:26:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:26:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 11:26:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:26:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 11:26:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:26:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 11:26:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 11:26:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 11:26:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 11:26:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:26:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 11:26:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 11:26:16,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:26:16,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187224561] [2024-10-14 11:26:16,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187224561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:26:16,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:26:16,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:26:16,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295535936] [2024-10-14 11:26:16,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:26:16,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:26:16,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:26:16,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:26:16,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:26:16,756 INFO L87 Difference]: Start difference. First operand has 88 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 11:26:16,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:26:16,803 INFO L93 Difference]: Finished difference Result 173 states and 314 transitions. [2024-10-14 11:26:16,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:26:16,806 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 199 [2024-10-14 11:26:16,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:26:16,814 INFO L225 Difference]: With dead ends: 173 [2024-10-14 11:26:16,815 INFO L226 Difference]: Without dead ends: 86 [2024-10-14 11:26:16,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:26:16,823 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:26:16,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:26:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-14 11:26:16,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-14 11:26:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 11:26:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 137 transitions. [2024-10-14 11:26:16,886 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 137 transitions. Word has length 199 [2024-10-14 11:26:16,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:26:16,886 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 137 transitions. [2024-10-14 11:26:16,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 11:26:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 137 transitions. [2024-10-14 11:26:16,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 11:26:16,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:26:16,906 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:26:16,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:26:16,908 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:26:16,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:26:16,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1349404215, now seen corresponding path program 1 times [2024-10-14 11:26:16,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:26:16,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590444345] [2024-10-14 11:26:16,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:26:16,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:26:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:26:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:26:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:26:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 11:26:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:26:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:26:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:26:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:26:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:26:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:26:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:26:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:26:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:26:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:26:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:26:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:26:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:26:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:26:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:26:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:26:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:26:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:26:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 11:26:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:26:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 11:26:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:26:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 11:26:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 11:26:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 11:26:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 11:26:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:26:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 11:26:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 11:26:17,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:26:17,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590444345] [2024-10-14 11:26:17,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590444345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:26:17,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:26:17,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:26:17,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559950527] [2024-10-14 11:26:17,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:26:17,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:26:17,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:26:17,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:26:17,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:26:17,763 INFO L87 Difference]: Start difference. First operand 86 states and 137 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:26:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:26:17,963 INFO L93 Difference]: Finished difference Result 256 states and 409 transitions. [2024-10-14 11:26:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:26:17,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 199 [2024-10-14 11:26:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:26:17,967 INFO L225 Difference]: With dead ends: 256 [2024-10-14 11:26:17,967 INFO L226 Difference]: Without dead ends: 171 [2024-10-14 11:26:17,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 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-10-14 11:26:17,971 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 69 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:26:17,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 348 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:26:17,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-14 11:26:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-10-14 11:26:18,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 11:26:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 268 transitions. [2024-10-14 11:26:18,011 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 268 transitions. Word has length 199 [2024-10-14 11:26:18,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:26:18,012 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 268 transitions. [2024-10-14 11:26:18,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:26:18,012 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 268 transitions. [2024-10-14 11:26:18,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 11:26:18,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:26:18,017 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:26:18,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:26:18,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:26:18,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:26:18,018 INFO L85 PathProgramCache]: Analyzing trace with hash -69540537, now seen corresponding path program 1 times [2024-10-14 11:26:18,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:26:18,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260229237] [2024-10-14 11:26:18,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:26:18,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:26:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:26:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:26:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:26:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 11:26:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:26:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:26:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:26:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:26:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:26:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:26:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:26:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:26:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:26:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:26:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:26:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:26:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:26:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:26:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:26:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:26:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:26:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:26:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 11:26:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:26:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 11:26:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:26:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 11:26:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 11:26:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 11:26:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 11:26:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:26:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 11:26:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-14 11:26:18,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:26:18,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260229237] [2024-10-14 11:26:18,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260229237] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:26:18,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980474639] [2024-10-14 11:26:18,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:26:18,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:26:18,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:26:18,547 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-10-14 11:26:18,548 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-10-14 11:26:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:18,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 11:26:18,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:26:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1011 proven. 51 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2024-10-14 11:26:18,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:26:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-14 11:26:19,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980474639] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:26:19,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 11:26:19,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-14 11:26:19,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141758603] [2024-10-14 11:26:19,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 11:26:19,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 11:26:19,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:26:19,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 11:26:19,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:26:19,152 INFO L87 Difference]: Start difference. First operand 169 states and 268 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-10-14 11:26:19,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:26:19,354 INFO L93 Difference]: Finished difference Result 353 states and 549 transitions. [2024-10-14 11:26:19,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 11:26:19,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 199 [2024-10-14 11:26:19,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:26:19,357 INFO L225 Difference]: With dead ends: 353 [2024-10-14 11:26:19,357 INFO L226 Difference]: Without dead ends: 185 [2024-10-14 11:26:19,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 457 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:26:19,358 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 119 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:26:19,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 226 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:26:19,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-14 11:26:19,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2024-10-14 11:26:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 108 states have internal predecessors, (144), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 11:26:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 272 transitions. [2024-10-14 11:26:19,397 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 272 transitions. Word has length 199 [2024-10-14 11:26:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:26:19,397 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 272 transitions. [2024-10-14 11:26:19,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-10-14 11:26:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 272 transitions. [2024-10-14 11:26:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 11:26:19,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:26:19,399 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:26:19,416 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-10-14 11:26:19,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:26:19,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:26:19,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:26:19,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1080657787, now seen corresponding path program 1 times [2024-10-14 11:26:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:26:19,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886065378] [2024-10-14 11:26:19,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:26:19,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:26:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:19,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:26:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:26:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:26:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 11:26:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:26:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:26:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:26:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:26:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:26:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:26:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:26:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:26:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:26:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:26:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:26:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:26:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:26:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:26:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:26:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:26:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:26:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:26:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 11:26:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:26:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 11:26:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:26:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 11:26:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 11:26:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 11:26:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 11:26:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:26:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 11:26:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 11:26:20,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:26:20,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886065378] [2024-10-14 11:26:20,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886065378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:26:20,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:26:20,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 11:26:20,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648891737] [2024-10-14 11:26:20,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:26:20,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 11:26:20,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:26:20,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 11:26:20,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:26:20,068 INFO L87 Difference]: Start difference. First operand 177 states and 272 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:26:20,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:26:20,276 INFO L93 Difference]: Finished difference Result 356 states and 549 transitions. [2024-10-14 11:26:20,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 11:26:20,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 199 [2024-10-14 11:26:20,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:26:20,279 INFO L225 Difference]: With dead ends: 356 [2024-10-14 11:26:20,279 INFO L226 Difference]: Without dead ends: 267 [2024-10-14 11:26:20,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:26:20,280 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 184 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:26:20,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 471 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:26:20,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-14 11:26:20,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 177. [2024-10-14 11:26:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 108 states have internal predecessors, (144), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 11:26:20,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 272 transitions. [2024-10-14 11:26:20,310 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 272 transitions. Word has length 199 [2024-10-14 11:26:20,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:26:20,311 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 272 transitions. [2024-10-14 11:26:20,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:26:20,312 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 272 transitions. [2024-10-14 11:26:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-14 11:26:20,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:26:20,314 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:26:20,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:26:20,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:26:20,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:26:20,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1911793355, now seen corresponding path program 1 times [2024-10-14 11:26:20,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:26:20,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261007316] [2024-10-14 11:26:20,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:26:20,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:26:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:26:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:26:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:26:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 11:26:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:26:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:26:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:26:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:26:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:26:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:26:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:26:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:26:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:26:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:26:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:26:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:26:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:26:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:26:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:26:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:26:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:26:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:26:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 11:26:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:26:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 11:26:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:26:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 11:26:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 11:26:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 11:26:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 11:26:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:26:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 11:26:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:20,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 11:26:20,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:26:20,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261007316] [2024-10-14 11:26:20,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261007316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:26:20,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:26:20,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 11:26:20,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085221678] [2024-10-14 11:26:20,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:26:20,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 11:26:20,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:26:20,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 11:26:20,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:26:20,692 INFO L87 Difference]: Start difference. First operand 177 states and 272 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:26:21,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:26:21,027 INFO L93 Difference]: Finished difference Result 518 states and 787 transitions. [2024-10-14 11:26:21,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 11:26:21,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 200 [2024-10-14 11:26:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:26:21,031 INFO L225 Difference]: With dead ends: 518 [2024-10-14 11:26:21,031 INFO L226 Difference]: Without dead ends: 429 [2024-10-14 11:26:21,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:26:21,032 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 172 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:26:21,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 431 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:26:21,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-14 11:26:21,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 362. [2024-10-14 11:26:21,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 223 states have (on average 1.3139013452914798) internal successors, (293), 223 states have internal predecessors, (293), 128 states have call successors, (128), 10 states have call predecessors, (128), 10 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2024-10-14 11:26:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 549 transitions. [2024-10-14 11:26:21,095 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 549 transitions. Word has length 200 [2024-10-14 11:26:21,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:26:21,096 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 549 transitions. [2024-10-14 11:26:21,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:26:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 549 transitions. [2024-10-14 11:26:21,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-14 11:26:21,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:26:21,098 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:26:21,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 11:26:21,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:26:21,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:26:21,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1615696844, now seen corresponding path program 1 times [2024-10-14 11:26:21,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:26:21,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711926676] [2024-10-14 11:26:21,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:26:21,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:26:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:26:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:26:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:26:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 11:26:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:26:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:26:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:26:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:26:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:26:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:26:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:26:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:26:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:26:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:26:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:26:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:26:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:26:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:26:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:26:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:26:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:26:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:26:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 11:26:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:26:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 11:26:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:26:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 11:26:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 11:26:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 11:26:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 11:26:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:26:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 11:26:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-14 11:26:21,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:26:21,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711926676] [2024-10-14 11:26:21,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711926676] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:26:21,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523437769] [2024-10-14 11:26:21,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:26:21,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:26:21,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:26:21,781 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-10-14 11:26:21,783 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-10-14 11:26:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:21,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 11:26:21,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:26:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 1168 trivial. 0 not checked. [2024-10-14 11:26:22,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:27:20,114 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_~var_1_30~0 65536)) (.cse5 (mod c_~var_1_29~0 65536)) (.cse4 (* c_~last_1_var_1_33~0 65535))) (and (or (let ((.cse1 (mod (+ c_~var_1_29~0 .cse4) 65536))) (and (forall ((~var_1_6~0 Int)) (let ((.cse0 (* c_~var_1_1~0 ~var_1_6~0))) (or (not (= (mod .cse0 64) 0)) (< 0 (+ .cse1 (div .cse0 64)))))) (forall ((~var_1_6~0 Int)) (let ((.cse2 (* c_~var_1_1~0 ~var_1_6~0))) (or (< 0 (+ .cse1 (div .cse2 64) 1)) (= (mod .cse2 64) 0)))) (forall ((~var_1_6~0 Int)) (let ((.cse3 (* c_~var_1_1~0 ~var_1_6~0))) (or (< 0 (+ .cse1 (div .cse3 64))) (< .cse3 0)))))) (< .cse5 (+ .cse6 1))) (or (< .cse6 .cse5) (let ((.cse7 (mod (+ c_~var_1_30~0 .cse4) 65536))) (and (forall ((~var_1_6~0 Int)) (let ((.cse8 (* c_~var_1_1~0 ~var_1_6~0))) (or (< 0 (+ .cse7 (div .cse8 64))) (< .cse8 0)))) (forall ((~var_1_6~0 Int)) (let ((.cse9 (* c_~var_1_1~0 ~var_1_6~0))) (or (< 0 (+ .cse7 (div .cse9 64) 1)) (= (mod .cse9 64) 0)))) (forall ((~var_1_6~0 Int)) (let ((.cse10 (* c_~var_1_1~0 ~var_1_6~0))) (or (< 0 (+ .cse7 (div .cse10 64))) (not (= (mod .cse10 64) 0)))))))))) is different from false [2024-10-14 11:27:20,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523437769] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:27:20,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 11:27:20,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14] total 20 [2024-10-14 11:27:20,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025746592] [2024-10-14 11:27:20,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 11:27:20,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 11:27:20,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:27:20,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 11:27:20,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=377, Unknown=14, NotChecked=40, Total=506 [2024-10-14 11:27:20,374 INFO L87 Difference]: Start difference. First operand 362 states and 549 transitions. Second operand has 20 states, 20 states have (on average 4.8) internal successors, (96), 19 states have internal predecessors, (96), 6 states have call successors, (64), 5 states have call predecessors, (64), 7 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) [2024-10-14 11:27:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:27:22,029 INFO L93 Difference]: Finished difference Result 993 states and 1473 transitions. [2024-10-14 11:27:22,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 11:27:22,030 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.8) internal successors, (96), 19 states have internal predecessors, (96), 6 states have call successors, (64), 5 states have call predecessors, (64), 7 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) Word has length 200 [2024-10-14 11:27:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:27:22,033 INFO L225 Difference]: With dead ends: 993 [2024-10-14 11:27:22,033 INFO L226 Difference]: Without dead ends: 632 [2024-10-14 11:27:22,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 57.4s TimeCoverageRelationStatistics Valid=385, Invalid=1411, Unknown=14, NotChecked=82, Total=1892 [2024-10-14 11:27:22,035 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 464 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 11:27:22,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 833 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 11:27:22,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-10-14 11:27:22,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 461. [2024-10-14 11:27:22,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 283 states have (on average 1.2756183745583038) internal successors, (361), 283 states have internal predecessors, (361), 160 states have call successors, (160), 17 states have call predecessors, (160), 17 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-10-14 11:27:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 681 transitions. [2024-10-14 11:27:22,086 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 681 transitions. Word has length 200 [2024-10-14 11:27:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:27:22,087 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 681 transitions. [2024-10-14 11:27:22,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.8) internal successors, (96), 19 states have internal predecessors, (96), 6 states have call successors, (64), 5 states have call predecessors, (64), 7 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) [2024-10-14 11:27:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 681 transitions. [2024-10-14 11:27:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-14 11:27:22,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:27:22,089 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:27:22,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 11:27:22,289 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,SelfDestructingSolverStorable5 [2024-10-14 11:27:22,290 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:27:22,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:27:22,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1708373451, now seen corresponding path program 1 times [2024-10-14 11:27:22,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:27:22,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463874603] [2024-10-14 11:27:22,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:27:22,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:27:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:27:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:27:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:27:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 11:27:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:27:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:27:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:27:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:27:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:27:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:27:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:27:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:27:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:27:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:27:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:27:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:27:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:27:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:27:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:27:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:27:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:27:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:27:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 11:27:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:27:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 11:27:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:27:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 11:27:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 11:27:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 11:27:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 11:27:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:27:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 11:27:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 11:27:22,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:27:22,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463874603] [2024-10-14 11:27:22,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463874603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:27:22,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:27:22,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 11:27:22,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52133585] [2024-10-14 11:27:22,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:27:22,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 11:27:22,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:27:22,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 11:27:22,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:27:22,737 INFO L87 Difference]: Start difference. First operand 461 states and 681 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:27:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:27:23,122 INFO L93 Difference]: Finished difference Result 637 states and 943 transitions. [2024-10-14 11:27:23,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 11:27:23,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 200 [2024-10-14 11:27:23,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:27:23,128 INFO L225 Difference]: With dead ends: 637 [2024-10-14 11:27:23,128 INFO L226 Difference]: Without dead ends: 548 [2024-10-14 11:27:23,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:27:23,129 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 265 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:27:23,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 260 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:27:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-14 11:27:23,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 280. [2024-10-14 11:27:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 170 states have (on average 1.2352941176470589) internal successors, (210), 170 states have internal predecessors, (210), 96 states have call successors, (96), 13 states have call predecessors, (96), 13 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-14 11:27:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 402 transitions. [2024-10-14 11:27:23,170 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 402 transitions. Word has length 200 [2024-10-14 11:27:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:27:23,170 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 402 transitions. [2024-10-14 11:27:23,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:27:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 402 transitions. [2024-10-14 11:27:23,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-14 11:27:23,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:27:23,173 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:27:23,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 11:27:23,174 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:27:23,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:27:23,174 INFO L85 PathProgramCache]: Analyzing trace with hash -167325496, now seen corresponding path program 1 times [2024-10-14 11:27:23,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:27:23,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767970849] [2024-10-14 11:27:23,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:27:23,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:27:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 11:27:23,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2139581357] [2024-10-14 11:27:23,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:27:23,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:27:23,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:27:23,378 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:27:23,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 11:27:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:27:23,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:27:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:27:23,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:27:23,705 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:27:23,706 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:27:23,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 11:27:23,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:27:23,912 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:27:24,015 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:27:24,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:27:24 BoogieIcfgContainer [2024-10-14 11:27:24,019 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:27:24,019 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:27:24,019 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:27:24,019 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:27:24,020 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:26:16" (3/4) ... [2024-10-14 11:27:24,021 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:27:24,023 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:27:24,023 INFO L158 Benchmark]: Toolchain (without parser) took 68759.56ms. Allocated memory was 159.4MB in the beginning and 400.6MB in the end (delta: 241.2MB). Free memory was 86.3MB in the beginning and 301.1MB in the end (delta: -214.8MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2024-10-14 11:27:24,023 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory was 109.8MB in the beginning and 109.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:27:24,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.16ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 86.2MB in the beginning and 184.9MB in the end (delta: -98.8MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-10-14 11:27:24,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.15ms. Allocated memory is still 216.0MB. Free memory was 184.9MB in the beginning and 178.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 11:27:24,024 INFO L158 Benchmark]: Boogie Preprocessor took 77.61ms. Allocated memory is still 216.0MB. Free memory was 178.7MB in the beginning and 169.2MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 11:27:24,024 INFO L158 Benchmark]: RCFGBuilder took 519.60ms. Allocated memory is still 216.0MB. Free memory was 169.2MB in the beginning and 131.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-14 11:27:24,024 INFO L158 Benchmark]: TraceAbstraction took 67783.65ms. Allocated memory was 216.0MB in the beginning and 400.6MB in the end (delta: 184.5MB). Free memory was 130.4MB in the beginning and 301.1MB in the end (delta: -170.7MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-10-14 11:27:24,024 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 400.6MB. Free memory is still 301.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:27:24,026 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.14ms. Allocated memory is still 159.4MB. Free memory was 109.8MB in the beginning and 109.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.16ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 86.2MB in the beginning and 184.9MB in the end (delta: -98.8MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.15ms. Allocated memory is still 216.0MB. Free memory was 184.9MB in the beginning and 178.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.61ms. Allocated memory is still 216.0MB. Free memory was 178.7MB in the beginning and 169.2MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 519.60ms. Allocated memory is still 216.0MB. Free memory was 169.2MB in the beginning and 131.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 67783.65ms. Allocated memory was 216.0MB in the beginning and 400.6MB in the end (delta: 184.5MB). Free memory was 130.4MB in the beginning and 301.1MB in the end (delta: -170.7MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 400.6MB. Free memory is still 301.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 198, overapproximation of someBinaryDOUBLEComparisonOperation at line 198, overapproximation of someUnaryDOUBLEoperation at line 23. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 0; [L23] float var_1_3 = -0.1; [L24] float var_1_4 = 127.25; [L25] float var_1_5 = 2.75; [L26] signed char var_1_6 = 1; [L27] signed char var_1_7 = -2; [L28] signed char var_1_8 = 25; [L29] signed char var_1_9 = 32; [L30] signed char var_1_11 = 0; [L31] signed long int var_1_12 = 2; [L32] unsigned long int var_1_13 = 256; [L33] unsigned long int var_1_16 = 3775050608; [L34] unsigned char var_1_18 = 16; [L35] unsigned char var_1_19 = 100; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_21 = 0; [L38] unsigned char var_1_22 = 0; [L39] unsigned char var_1_23 = 4; [L40] unsigned char var_1_24 = 32; [L41] unsigned char var_1_25 = 16; [L42] unsigned char var_1_26 = 32; [L43] unsigned char var_1_27 = 0; [L44] unsigned short int var_1_28 = 4; [L45] unsigned short int var_1_29 = 38930; [L46] unsigned short int var_1_30 = 59162; [L47] unsigned short int var_1_31 = 1; [L48] unsigned short int var_1_32 = 30817; [L49] unsigned long int var_1_33 = 50; [L50] double var_1_34 = 50.25; [L51] double var_1_35 = 10000000000000.75; [L52] unsigned long int last_1_var_1_13 = 256; [L53] unsigned short int last_1_var_1_31 = 1; [L54] unsigned long int last_1_var_1_33 = 50; [L202] isInitial = 1 [L203] FCALL initially() [L204] COND TRUE 1 [L205] CALL updateLastVariables() [L193] last_1_var_1_13 = var_1_13 [L194] last_1_var_1_31 = var_1_31 [L195] last_1_var_1_33 = var_1_33 [L205] RET updateLastVariables() [L206] CALL updateVariables() [L141] var_1_3 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L142] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L143] var_1_4 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L144] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L145] var_1_5 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L146] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L147] var_1_6 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L148] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L149] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L149] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L150] var_1_8 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L151] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L152] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L152] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L153] var_1_11 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_11 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L154] RET assume_abort_if_not(var_1_11 >= -126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L155] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L155] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L156] var_1_16 = __VERIFIER_nondet_ulong() [L157] CALL assume_abort_if_not(var_1_16 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L157] RET assume_abort_if_not(var_1_16 >= 2147483647) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L158] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L158] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L159] var_1_19 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L160] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L161] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L161] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L162] var_1_21 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L163] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L164] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L164] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L165] var_1_24 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L166] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L167] CALL assume_abort_if_not(var_1_24 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L167] RET assume_abort_if_not(var_1_24 <= 64) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L168] var_1_25 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L169] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L170] CALL assume_abort_if_not(var_1_25 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L170] RET assume_abort_if_not(var_1_25 <= 63) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L171] var_1_26 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_26 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L172] RET assume_abort_if_not(var_1_26 >= 31) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L173] CALL assume_abort_if_not(var_1_26 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L173] RET assume_abort_if_not(var_1_26 <= 64) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L174] var_1_27 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L175] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L176] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L176] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L177] var_1_29 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L178] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L179] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L179] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L180] var_1_30 = __VERIFIER_nondet_ushort() [L181] CALL assume_abort_if_not(var_1_30 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L181] RET assume_abort_if_not(var_1_30 >= 32767) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L182] CALL assume_abort_if_not(var_1_30 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L182] RET assume_abort_if_not(var_1_30 <= 65534) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L183] var_1_32 = __VERIFIER_nondet_ushort() [L184] CALL assume_abort_if_not(var_1_32 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L184] RET assume_abort_if_not(var_1_32 >= 16384) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L185] CALL assume_abort_if_not(var_1_32 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L185] RET assume_abort_if_not(var_1_32 <= 32767) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L186] var_1_34 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_34 >= -922337.2036854776000e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L187] RET assume_abort_if_not((var_1_34 >= -922337.2036854776000e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L188] var_1_35 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L189] RET assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L190] CALL assume_abort_if_not(var_1_35 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L190] RET assume_abort_if_not(var_1_35 != 0.0F) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L206] RET updateVariables() [L207] CALL step() [L58] COND FALSE !(last_1_var_1_13 > ((((last_1_var_1_31) > (var_1_16)) ? (last_1_var_1_31) : (var_1_16)))) [L61] var_1_28 = (var_1_25 + var_1_19) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L63] COND FALSE !((- var_1_3) <= (var_1_4 - var_1_5)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L70] COND TRUE var_1_4 != var_1_5 [L71] var_1_7 = var_1_6 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L75] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, 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=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L76] COND FALSE !(var_1_18 > ((32u / var_1_16) + 32u)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, 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=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L79] COND FALSE !(\read(var_1_21)) [L82] var_1_23 = var_1_27 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, 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=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L84] COND TRUE var_1_5 <= (- ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)))) [L85] var_1_31 = ((25454 + var_1_32) - var_1_1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, 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=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L89] unsigned short int stepLocal_2 = var_1_31; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_2=41838, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, 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=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L90] COND FALSE !(stepLocal_2 == var_1_11) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, 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=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L97] COND TRUE (var_1_31 / var_1_16) <= var_1_28 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, 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=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L98] COND TRUE var_1_28 <= var_1_18 [L99] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, 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=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L102] unsigned char stepLocal_1 = var_1_20; [L103] unsigned char stepLocal_0 = var_1_22; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_0=0, stepLocal_1=0, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, 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=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L104] COND FALSE !(var_1_22 || stepLocal_1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_0=0, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, 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=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L107] COND FALSE !(var_1_20 && stepLocal_0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, 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=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L111] signed long int stepLocal_4 = (var_1_6 * var_1_1) / -64; [L112] unsigned short int stepLocal_3 = var_1_28; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, stepLocal_4=0, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, 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=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L113] COND TRUE stepLocal_4 >= var_1_28 [L114] var_1_13 = ((((var_1_28) < (var_1_31)) ? (var_1_28) : (var_1_31))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, var_1_11=-126, var_1_12=2, var_1_13=0, var_1_16=2147483680, 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=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L120] unsigned long int stepLocal_6 = var_1_16; [L121] signed long int stepLocal_5 = (- var_1_18) / var_1_26; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, stepLocal_5=0, stepLocal_6=2147483680, var_1_11=-126, var_1_12=2, var_1_13=0, var_1_16=2147483680, 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=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L122] COND FALSE !(var_1_34 < (var_1_5 / var_1_35)) [L137] var_1_33 = var_1_30 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, stepLocal_5=0, stepLocal_6=2147483680, var_1_11=-126, var_1_12=2, var_1_13=0, var_1_16=2147483680, 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=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L207] RET step() [L208] CALL, EXPR property() [L198-L199] return (((((((((((((- var_1_3) <= (var_1_4 - var_1_5)) ? ((var_1_3 >= (var_1_5 / 255.75f)) ? (var_1_1 == ((signed char) var_1_6)) : (var_1_1 == ((signed char) var_1_6))) : 1) && ((var_1_4 != var_1_5) ? (var_1_7 == ((signed char) var_1_6)) : (var_1_7 == ((signed char) var_1_8)))) && ((var_1_22 || var_1_20) ? (var_1_9 == ((signed char) ((((((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) > (((((-2) < 0 ) ? -(-2) : (-2))))) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (((((-2) < 0 ) ? -(-2) : (-2))))))) > (var_1_6)) ? (((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) > (((((-2) < 0 ) ? -(-2) : (-2))))) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (((((-2) < 0 ) ? -(-2) : (-2))))))) : (var_1_6))))) : ((var_1_20 && var_1_22) ? (var_1_9 == ((signed char) ((((var_1_11) < (var_1_8)) ? (var_1_11) : (var_1_8))))) : 1))) && ((var_1_31 == var_1_11) ? ((! var_1_22) ? (var_1_22 ? (var_1_12 == ((signed long int) var_1_18)) : 1) : 1) : 1)) && ((((var_1_6 * var_1_1) / -64) >= var_1_28) ? (var_1_13 == ((unsigned long int) ((((var_1_28) < (var_1_31)) ? (var_1_28) : (var_1_31))))) : ((50u >= var_1_28) ? (var_1_13 == ((unsigned long int) (var_1_16 - var_1_18))) : 1))) && (var_1_18 == ((unsigned char) var_1_19))) && (((var_1_31 / var_1_16) <= var_1_28) ? ((var_1_28 <= var_1_18) ? (var_1_20 == ((unsigned char) var_1_21)) : 1) : 1)) && ((var_1_18 > ((32u / var_1_16) + 32u)) ? (var_1_22 == ((unsigned char) var_1_21)) : 1)) && (var_1_21 ? (var_1_23 == ((unsigned char) ((var_1_24 + var_1_25) + ((var_1_26 + 32) - var_1_27)))) : (var_1_23 == ((unsigned char) var_1_27)))) && ((last_1_var_1_13 > ((((last_1_var_1_31) > (var_1_16)) ? (last_1_var_1_31) : (var_1_16)))) ? (var_1_28 == ((unsigned short int) (((((var_1_29) > (var_1_30)) ? (var_1_29) : (var_1_30))) - last_1_var_1_33))) : (var_1_28 == ((unsigned short int) (var_1_25 + var_1_19))))) && ((var_1_5 <= (- ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3))))) ? (var_1_31 == ((unsigned short int) ((25454 + var_1_32) - var_1_1))) : (var_1_31 == ((unsigned short int) ((((((((var_1_19) < (var_1_23)) ? (var_1_19) : (var_1_23)))) > (var_1_29)) ? (((((var_1_19) < (var_1_23)) ? (var_1_19) : (var_1_23)))) : (var_1_29))))))) && ((var_1_34 < (var_1_5 / var_1_35)) ? ((var_1_16 > ((((64u) < (var_1_28)) ? (64u) : (var_1_28)))) ? (((var_1_4 - var_1_5) <= var_1_3) ? (var_1_33 == ((unsigned long int) (((((8u) < 0 ) ? -(8u) : (8u))) + 25u))) : (var_1_33 == ((unsigned long int) ((((var_1_27) > ((var_1_29 + ((((16u) < (var_1_18)) ? (16u) : (var_1_18)))))) ? (var_1_27) : ((var_1_29 + ((((16u) < (var_1_18)) ? (16u) : (var_1_18)))))))))) : ((((- var_1_18) / var_1_26) < var_1_25) ? (var_1_33 == ((unsigned long int) var_1_30)) : (var_1_33 == ((unsigned long int) var_1_7)))) : (var_1_33 == ((unsigned long int) var_1_30))) ; [L208] RET, EXPR property() [L208] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=0, var_1_16=2147483680, 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=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=0, var_1_16=2147483680, 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=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.6s, OverallIterations: 8, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1286 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1273 mSDsluCounter, 2703 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1823 mSDsCounter, 634 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1533 IncrementalHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 634 mSolverCounterUnsat, 880 mSDtfsCounter, 1533 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1173 GetRequests, 1100 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 57.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=6, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 606 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 62.0s InterpolantComputationTime, 2197 NumberOfCodeBlocks, 2197 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1984 ConstructedInterpolants, 0 QuantifiedInterpolants, 6818 SizeOfPredicates, 8 NumberOfNonLiveVariables, 905 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 19576/19840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 11:27:24,248 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-14 11:27:24,364 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.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 64360fc7d3c5d5814f250bc67771c1266affbe7be077c4ce76d53cff763882cf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:27:25,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:27:25,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:27:25,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:27:25,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:27:25,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:27:25,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:27:25,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:27:25,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:27:25,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:27:25,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:27:25,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:27:25,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:27:25,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:27:25,984 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:27:25,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:27:25,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:27:25,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:27:25,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:27:25,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:27:25,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:27:25,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:27:25,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:27:25,988 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:27:25,988 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:27:25,988 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:27:25,988 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:27:25,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:27:25,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:27:25,989 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:27:25,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:27:25,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:27:25,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:27:25,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:27:25,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:27:25,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:27:25,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:27:25,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:27:25,990 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:27:25,991 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:27:25,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:27:25,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:27:25,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:27:25,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:27:25,993 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:27:25,993 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 -> 64360fc7d3c5d5814f250bc67771c1266affbe7be077c4ce76d53cff763882cf [2024-10-14 11:27:26,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:27:26,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:27:26,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:27:26,273 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:27:26,273 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:27:26,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i [2024-10-14 11:27:27,538 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:27:27,713 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:27:27,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i [2024-10-14 11:27:27,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4766336e7/3e85c55999a8422cb7d81cacfe3aa246/FLAG28ff05254 [2024-10-14 11:27:27,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4766336e7/3e85c55999a8422cb7d81cacfe3aa246 [2024-10-14 11:27:27,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:27:27,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:27:27,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:27:27,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:27:27,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:27:27,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:27:27" (1/1) ... [2024-10-14 11:27:27,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e106270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:27, skipping insertion in model container [2024-10-14 11:27:27,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:27:27" (1/1) ... [2024-10-14 11:27:27,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:27:27,920 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i[916,929] [2024-10-14 11:27:27,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:27:28,009 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:27:28,018 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i[916,929] [2024-10-14 11:27:28,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:27:28,082 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:27:28,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:28 WrapperNode [2024-10-14 11:27:28,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:27:28,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:27:28,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:27:28,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:27:28,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:28" (1/1) ... [2024-10-14 11:27:28,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:28" (1/1) ... [2024-10-14 11:27:28,140 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-10-14 11:27:28,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:27:28,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:27:28,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:27:28,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:27:28,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:28" (1/1) ... [2024-10-14 11:27:28,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:28" (1/1) ... [2024-10-14 11:27:28,160 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:28" (1/1) ... [2024-10-14 11:27:28,176 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:27:28,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:28" (1/1) ... [2024-10-14 11:27:28,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:28" (1/1) ... [2024-10-14 11:27:28,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:28" (1/1) ... [2024-10-14 11:27:28,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:28" (1/1) ... [2024-10-14 11:27:28,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:28" (1/1) ... [2024-10-14 11:27:28,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:28" (1/1) ... [2024-10-14 11:27:28,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:27:28,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:27:28,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:27:28,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:27:28,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:28" (1/1) ... [2024-10-14 11:27:28,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:27:28,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:27:28,242 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-10-14 11:27:28,244 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-10-14 11:27:28,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:27:28,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:27:28,283 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:27:28,283 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:27:28,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:27:28,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:27:28,350 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:27:28,352 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:27:41,889 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-14 11:27:41,889 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:27:41,933 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:27:41,934 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:27:41,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:27:41 BoogieIcfgContainer [2024-10-14 11:27:41,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:27:41,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:27:41,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:27:41,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:27:41,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:27:27" (1/3) ... [2024-10-14 11:27:41,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95d364b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:27:41, skipping insertion in model container [2024-10-14 11:27:41,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:27:28" (2/3) ... [2024-10-14 11:27:41,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95d364b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:27:41, skipping insertion in model container [2024-10-14 11:27:41,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:27:41" (3/3) ... [2024-10-14 11:27:41,944 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-51.i [2024-10-14 11:27:41,956 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:27:41,957 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:27:42,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:27:42,015 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;@70901882, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:27:42,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:27:42,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 11:27:42,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 11:27:42,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:27:42,030 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:27:42,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:27:42,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:27:42,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1230719355, now seen corresponding path program 1 times [2024-10-14 11:27:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:27:42,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177399382] [2024-10-14 11:27:42,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:27:42,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:27:42,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:27:42,051 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-10-14 11:27:42,073 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-10-14 11:27:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:42,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:27:42,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:27:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 1130 trivial. 0 not checked. [2024-10-14 11:27:42,938 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:27:42,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:27:42,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177399382] [2024-10-14 11:27:42,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177399382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:27:42,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:27:42,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:27:42,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802236750] [2024-10-14 11:27:42,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:27:42,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:27:42,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:27:42,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:27:42,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:27:42,969 INFO L87 Difference]: Start difference. First operand has 88 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 11:27:47,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:27:47,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:27:47,416 INFO L93 Difference]: Finished difference Result 173 states and 314 transitions. [2024-10-14 11:27:47,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:27:47,556 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 199 [2024-10-14 11:27:47,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:27:47,561 INFO L225 Difference]: With dead ends: 173 [2024-10-14 11:27:47,562 INFO L226 Difference]: Without dead ends: 86 [2024-10-14 11:27:47,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:27:47,566 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-14 11:27:47,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-14 11:27:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-14 11:27:47,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-14 11:27:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 11:27:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 137 transitions. [2024-10-14 11:27:47,597 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 137 transitions. Word has length 199 [2024-10-14 11:27:47,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:27:47,598 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 137 transitions. [2024-10-14 11:27:47,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 11:27:47,598 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 137 transitions. [2024-10-14 11:27:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 11:27:47,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:27:47,601 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:27:47,628 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-10-14 11:27:47,801 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-10-14 11:27:47,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:27:47,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:27:47,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1349404215, now seen corresponding path program 1 times [2024-10-14 11:27:47,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:27:47,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655714190] [2024-10-14 11:27:47,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:27:47,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:27:47,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:27:47,810 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-10-14 11:27:47,811 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-10-14 11:27:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:27:48,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 11:27:48,626 INFO L278 TraceCheckSpWp]: Computing forward predicates...