./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-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-66.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4ab91c42a4ee5026a7e0836ff3c7333b9b4fcfd29b459af3488580e0e554eec --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:19:47,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:19:48,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:19:48,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:19:48,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:19:48,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:19:48,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:19:48,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:19:48,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:19:48,048 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:19:48,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:19:48,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:19:48,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:19:48,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:19:48,050 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:19:48,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:19:48,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:19:48,051 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:19:48,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:19:48,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:19:48,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:19:48,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:19:48,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:19:48,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:19:48,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:19:48,053 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:19:48,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:19:48,053 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:19:48,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:19:48,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:19:48,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:19:48,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:19:48,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:19:48,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:19:48,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:19:48,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:19:48,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:19:48,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:19:48,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:19:48,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:19:48,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:19:48,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:19:48,057 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4ab91c42a4ee5026a7e0836ff3c7333b9b4fcfd29b459af3488580e0e554eec [2024-10-11 11:19:48,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:19:48,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:19:48,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:19:48,336 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:19:48,336 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:19:48,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-66.i [2024-10-11 11:19:49,624 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:19:49,783 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:19:49,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-66.i [2024-10-11 11:19:49,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/86f63f13a/f34b8b0c10544a499303d146d72f8c0f/FLAG8c8f7116e [2024-10-11 11:19:49,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/86f63f13a/f34b8b0c10544a499303d146d72f8c0f [2024-10-11 11:19:49,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:19:49,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:19:49,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:19:49,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:19:49,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:19:49,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:19:49" (1/1) ... [2024-10-11 11:19:49,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b65f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:49, skipping insertion in model container [2024-10-11 11:19:49,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:19:49" (1/1) ... [2024-10-11 11:19:49,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:19:49,983 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-66.i[916,929] [2024-10-11 11:19:50,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:19:50,048 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:19:50,059 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-66.i[916,929] [2024-10-11 11:19:50,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:19:50,106 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:19:50,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:50 WrapperNode [2024-10-11 11:19:50,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:19:50,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:19:50,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:19:50,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:19:50,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:50" (1/1) ... [2024-10-11 11:19:50,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:50" (1/1) ... [2024-10-11 11:19:50,161 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-10-11 11:19:50,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:19:50,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:19:50,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:19:50,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:19:50,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:50" (1/1) ... [2024-10-11 11:19:50,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:50" (1/1) ... [2024-10-11 11:19:50,174 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:50" (1/1) ... [2024-10-11 11:19:50,194 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:19:50,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:50" (1/1) ... [2024-10-11 11:19:50,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:50" (1/1) ... [2024-10-11 11:19:50,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:50" (1/1) ... [2024-10-11 11:19:50,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:50" (1/1) ... [2024-10-11 11:19:50,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:50" (1/1) ... [2024-10-11 11:19:50,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:50" (1/1) ... [2024-10-11 11:19:50,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:19:50,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:19:50,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:19:50,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:19:50,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:50" (1/1) ... [2024-10-11 11:19:50,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:19:50,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:19:50,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:19:50,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:19:50,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:19:50,330 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:19:50,330 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:19:50,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:19:50,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:19:50,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:19:50,416 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:19:50,418 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:19:50,743 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-11 11:19:50,743 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:19:50,768 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:19:50,769 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:19:50,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:19:50 BoogieIcfgContainer [2024-10-11 11:19:50,770 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:19:50,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:19:50,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:19:50,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:19:50,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:19:49" (1/3) ... [2024-10-11 11:19:50,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8fda1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:19:50, skipping insertion in model container [2024-10-11 11:19:50,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:50" (2/3) ... [2024-10-11 11:19:50,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8fda1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:19:50, skipping insertion in model container [2024-10-11 11:19:50,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:19:50" (3/3) ... [2024-10-11 11:19:50,779 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-66.i [2024-10-11 11:19:50,792 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:19:50,792 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:19:50,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:19:50,863 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;@48c5cdf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:19:50,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:19:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 61 states have internal predecessors, (91), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:19:50,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 11:19:50,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:19:50,886 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:19:50,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:19:50,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:19:50,893 INFO L85 PathProgramCache]: Analyzing trace with hash -736686827, now seen corresponding path program 1 times [2024-10-11 11:19:50,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:19:50,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533849379] [2024-10-11 11:19:50,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:19:50,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:19:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:19:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:19:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:19:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:19:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:19:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:19:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:19:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:19:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:19:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:19:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:19:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:19:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:19:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:19:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:19:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:19:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:19:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:19:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:19:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:19:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:19:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 11:19:51,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:19:51,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533849379] [2024-10-11 11:19:51,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533849379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:19:51,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:19:51,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:19:51,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931222824] [2024-10-11 11:19:51,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:19:51,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:19:51,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:19:51,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:19:51,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:19:51,401 INFO L87 Difference]: Start difference. First operand has 84 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 61 states have internal predecessors, (91), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 11:19:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:19:51,468 INFO L93 Difference]: Finished difference Result 204 states and 349 transitions. [2024-10-11 11:19:51,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:19:51,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2024-10-11 11:19:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:19:51,477 INFO L225 Difference]: With dead ends: 204 [2024-10-11 11:19:51,477 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 11:19:51,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:19:51,483 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 58 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:19:51,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 238 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:19:51,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 11:19:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 100. [2024-10-11 11:19:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 77 states have internal predecessors, (115), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:19:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 157 transitions. [2024-10-11 11:19:51,528 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 157 transitions. Word has length 145 [2024-10-11 11:19:51,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:19:51,530 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 157 transitions. [2024-10-11 11:19:51,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 11:19:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 157 transitions. [2024-10-11 11:19:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 11:19:51,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:19:51,536 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:19:51,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:19:51,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:19:51,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:19:51,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1752842135, now seen corresponding path program 1 times [2024-10-11 11:19:51,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:19:51,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129372590] [2024-10-11 11:19:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:19:51,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:19:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:19:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:19:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:19:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:19:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:19:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:19:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:19:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:19:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:19:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:19:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:19:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:19:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:19:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:19:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:19:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:19:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:19:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:19:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:19:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:19:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:19:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-11 11:19:52,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:19:52,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129372590] [2024-10-11 11:19:52,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129372590] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:19:52,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216779794] [2024-10-11 11:19:52,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:19:52,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:19:52,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:19:52,300 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:19:52,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:19:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:52,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 11:19:52,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:19:52,736 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 11:19:52,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:19:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-11 11:19:53,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216779794] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:19:53,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:19:53,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-11 11:19:53,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864104262] [2024-10-11 11:19:53,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:19:53,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 11:19:53,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:19:53,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 11:19:53,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:19:53,010 INFO L87 Difference]: Start difference. First operand 100 states and 157 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (43), 2 states have call predecessors, (43), 3 states have call successors, (43) [2024-10-11 11:19:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:19:53,261 INFO L93 Difference]: Finished difference Result 205 states and 318 transitions. [2024-10-11 11:19:53,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:19:53,262 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (43), 2 states have call predecessors, (43), 3 states have call successors, (43) Word has length 145 [2024-10-11 11:19:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:19:53,265 INFO L225 Difference]: With dead ends: 205 [2024-10-11 11:19:53,266 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 11:19:53,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-10-11 11:19:53,268 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 123 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:19:53,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 319 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:19:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 11:19:53,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2024-10-11 11:19:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.45) internal successors, (116), 80 states have internal predecessors, (116), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:19:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 158 transitions. [2024-10-11 11:19:53,288 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 158 transitions. Word has length 145 [2024-10-11 11:19:53,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:19:53,289 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 158 transitions. [2024-10-11 11:19:53,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (43), 2 states have call predecessors, (43), 3 states have call successors, (43) [2024-10-11 11:19:53,289 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 158 transitions. [2024-10-11 11:19:53,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 11:19:53,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:19:53,290 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:19:53,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:19:53,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:19:53,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:19:53,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:19:53,492 INFO L85 PathProgramCache]: Analyzing trace with hash 63898393, now seen corresponding path program 1 times [2024-10-11 11:19:53,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:19:53,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550553263] [2024-10-11 11:19:53,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:19:53,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:19:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:19:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:19:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:19:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:19:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:19:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:19:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:19:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:19:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:19:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:19:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:19:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:19:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:19:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:19:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:19:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:19:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:19:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:19:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:19:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:19:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:19:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 11:19:53,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:19:53,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550553263] [2024-10-11 11:19:53,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550553263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:19:53,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:19:53,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:19:53,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287882930] [2024-10-11 11:19:53,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:19:53,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:19:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:19:53,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:19:53,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:19:53,749 INFO L87 Difference]: Start difference. First operand 104 states and 158 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 11:19:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:19:53,782 INFO L93 Difference]: Finished difference Result 207 states and 315 transitions. [2024-10-11 11:19:53,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:19:53,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2024-10-11 11:19:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:19:53,786 INFO L225 Difference]: With dead ends: 207 [2024-10-11 11:19:53,786 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 11:19:53,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:19:53,787 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:19:53,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 114 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:19:53,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 11:19:53,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 11:19:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:19:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2024-10-11 11:19:53,796 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 145 [2024-10-11 11:19:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:19:53,797 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2024-10-11 11:19:53,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 11:19:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2024-10-11 11:19:53,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 11:19:53,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:19:53,803 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:19:53,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:19:53,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:19:53,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:19:53,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1930246313, now seen corresponding path program 1 times [2024-10-11 11:19:53,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:19:53,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486958678] [2024-10-11 11:19:53,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:19:53,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:19:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:53,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:19:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:19:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:19:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:19:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:19:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:19:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:19:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:19:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:19:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:19:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:19:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:19:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:19:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:19:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:19:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:19:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:19:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:19:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:19:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:19:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:19:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,043 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 11:19:54,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:19:54,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486958678] [2024-10-11 11:19:54,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486958678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:19:54,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:19:54,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:19:54,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726073056] [2024-10-11 11:19:54,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:19:54,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:19:54,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:19:54,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:19:54,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:19:54,045 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 11:19:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:19:54,074 INFO L93 Difference]: Finished difference Result 207 states and 307 transitions. [2024-10-11 11:19:54,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:19:54,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2024-10-11 11:19:54,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:19:54,076 INFO L225 Difference]: With dead ends: 207 [2024-10-11 11:19:54,076 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 11:19:54,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-11 11:19:54,077 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 77 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:19:54,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 223 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:19:54,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 11:19:54,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 11:19:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:19:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2024-10-11 11:19:54,085 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 145 [2024-10-11 11:19:54,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:19:54,086 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2024-10-11 11:19:54,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 11:19:54,086 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-10-11 11:19:54,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 11:19:54,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:19:54,087 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:19:54,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:19:54,088 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:19:54,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:19:54,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1652135474, now seen corresponding path program 1 times [2024-10-11 11:19:54,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:19:54,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589946154] [2024-10-11 11:19:54,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:19:54,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:19:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:19:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:19:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:19:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:19:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:19:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:19:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:19:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:19:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:19:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:19:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:19:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:19:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:19:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:19:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:19:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:19:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:19:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:19:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:19:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:19:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:19:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,395 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-11 11:19:54,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:19:54,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589946154] [2024-10-11 11:19:54,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589946154] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:19:54,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052902805] [2024-10-11 11:19:54,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:19:54,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:19:54,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:19:54,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:19:54,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 11:19:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:54,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 11:19:54,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:19:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 284 proven. 48 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-10-11 11:19:54,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:19:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-11 11:19:55,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052902805] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:19:55,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:19:55,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 18 [2024-10-11 11:19:55,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022829782] [2024-10-11 11:19:55,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:19:55,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 11:19:55,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:19:55,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 11:19:55,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-10-11 11:19:55,060 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 18 states, 18 states have (on average 6.888888888888889) internal successors, (124), 18 states have internal predecessors, (124), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2024-10-11 11:19:56,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:19:56,825 INFO L93 Difference]: Finished difference Result 683 states and 954 transitions. [2024-10-11 11:19:56,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-11 11:19:56,826 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.888888888888889) internal successors, (124), 18 states have internal predecessors, (124), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) Word has length 147 [2024-10-11 11:19:56,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:19:56,829 INFO L225 Difference]: With dead ends: 683 [2024-10-11 11:19:56,829 INFO L226 Difference]: Without dead ends: 580 [2024-10-11 11:19:56,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2140 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1274, Invalid=4888, Unknown=0, NotChecked=0, Total=6162 [2024-10-11 11:19:56,831 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1217 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 11:19:56,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 1315 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 11:19:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-11 11:19:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 476. [2024-10-11 11:19:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 369 states have (on average 1.3008130081300813) internal successors, (480), 372 states have internal predecessors, (480), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-11 11:19:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 656 transitions. [2024-10-11 11:19:56,881 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 656 transitions. Word has length 147 [2024-10-11 11:19:56,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:19:56,882 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 656 transitions. [2024-10-11 11:19:56,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.888888888888889) internal successors, (124), 18 states have internal predecessors, (124), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2024-10-11 11:19:56,882 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 656 transitions. [2024-10-11 11:19:56,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 11:19:56,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:19:56,884 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:19:56,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 11:19:57,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:19:57,085 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:19:57,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:19:57,086 INFO L85 PathProgramCache]: Analyzing trace with hash 439587608, now seen corresponding path program 1 times [2024-10-11 11:19:57,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:19:57,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078486186] [2024-10-11 11:19:57,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:19:57,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:19:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:19:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:19:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:19:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:19:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:19:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:19:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:19:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:19:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:19:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:19:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:19:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:19:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:19:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:19:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:19:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:19:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:19:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:19:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:19:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:19:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:19:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 11:19:57,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:19:57,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078486186] [2024-10-11 11:19:57,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078486186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:19:57,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:19:57,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:19:57,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395059770] [2024-10-11 11:19:57,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:19:57,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:19:57,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:19:57,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:19:57,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:19:57,256 INFO L87 Difference]: Start difference. First operand 476 states and 656 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 11:19:57,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:19:57,504 INFO L93 Difference]: Finished difference Result 1805 states and 2472 transitions. [2024-10-11 11:19:57,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 11:19:57,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 148 [2024-10-11 11:19:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:19:57,511 INFO L225 Difference]: With dead ends: 1805 [2024-10-11 11:19:57,511 INFO L226 Difference]: Without dead ends: 1330 [2024-10-11 11:19:57,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:19:57,513 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 394 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:19:57,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 701 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:19:57,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2024-10-11 11:19:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 944. [2024-10-11 11:19:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 756 states have (on average 1.3042328042328042) internal successors, (986), 762 states have internal predecessors, (986), 155 states have call successors, (155), 32 states have call predecessors, (155), 32 states have return successors, (155), 149 states have call predecessors, (155), 155 states have call successors, (155) [2024-10-11 11:19:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1296 transitions. [2024-10-11 11:19:57,599 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1296 transitions. Word has length 148 [2024-10-11 11:19:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:19:57,599 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1296 transitions. [2024-10-11 11:19:57,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 11:19:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1296 transitions. [2024-10-11 11:19:57,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 11:19:57,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:19:57,601 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:19:57,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:19:57,601 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:19:57,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:19:57,601 INFO L85 PathProgramCache]: Analyzing trace with hash 642175832, now seen corresponding path program 1 times [2024-10-11 11:19:57,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:19:57,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992238678] [2024-10-11 11:19:57,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:19:57,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:19:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:19:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:19:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:19:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:19:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:19:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:19:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:19:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:19:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:19:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:19:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:19:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:19:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:19:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:19:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:19:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:19:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:19:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:19:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:19:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:19:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:19:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 11:19:57,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:19:57,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992238678] [2024-10-11 11:19:57,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992238678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:19:57,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:19:57,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:19:57,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563445586] [2024-10-11 11:19:57,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:19:57,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:19:57,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:19:57,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:19:57,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:19:57,690 INFO L87 Difference]: Start difference. First operand 944 states and 1296 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 11:19:57,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:19:57,754 INFO L93 Difference]: Finished difference Result 1732 states and 2367 transitions. [2024-10-11 11:19:57,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:19:57,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 148 [2024-10-11 11:19:57,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:19:57,758 INFO L225 Difference]: With dead ends: 1732 [2024-10-11 11:19:57,758 INFO L226 Difference]: Without dead ends: 789 [2024-10-11 11:19:57,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:19:57,761 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 53 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:19:57,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 269 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:19:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-10-11 11:19:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 768. [2024-10-11 11:19:57,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 580 states have (on average 1.2465517241379311) internal successors, (723), 586 states have internal predecessors, (723), 155 states have call successors, (155), 32 states have call predecessors, (155), 32 states have return successors, (155), 149 states have call predecessors, (155), 155 states have call successors, (155) [2024-10-11 11:19:57,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1033 transitions. [2024-10-11 11:19:57,815 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1033 transitions. Word has length 148 [2024-10-11 11:19:57,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:19:57,815 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1033 transitions. [2024-10-11 11:19:57,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 11:19:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1033 transitions. [2024-10-11 11:19:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 11:19:57,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:19:57,817 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:19:57,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 11:19:57,817 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:19:57,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:19:57,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2053733232, now seen corresponding path program 1 times [2024-10-11 11:19:57,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:19:57,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092631036] [2024-10-11 11:19:57,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:19:57,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:19:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:19:57,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [657105482] [2024-10-11 11:19:57,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:19:57,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:19:57,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:19:57,911 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:19:57,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 11:19:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:19:58,010 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:19:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:19:58,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:19:58,148 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:19:58,148 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:19:58,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 11:19:58,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:19:58,353 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:19:58,453 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:19:58,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:19:58 BoogieIcfgContainer [2024-10-11 11:19:58,456 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:19:58,457 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:19:58,457 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:19:58,457 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:19:58,457 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:19:50" (3/4) ... [2024-10-11 11:19:58,459 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:19:58,459 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:19:58,460 INFO L158 Benchmark]: Toolchain (without parser) took 8645.40ms. Allocated memory was 155.2MB in the beginning and 293.6MB in the end (delta: 138.4MB). Free memory was 98.0MB in the beginning and 247.3MB in the end (delta: -149.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:19:58,460 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 155.2MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:19:58,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.20ms. Allocated memory is still 155.2MB. Free memory was 98.0MB in the beginning and 80.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 11:19:58,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.17ms. Allocated memory is still 155.2MB. Free memory was 80.2MB in the beginning and 76.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:19:58,461 INFO L158 Benchmark]: Boogie Preprocessor took 71.72ms. Allocated memory is still 155.2MB. Free memory was 75.7MB in the beginning and 124.6MB in the end (delta: -48.9MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2024-10-11 11:19:58,461 INFO L158 Benchmark]: RCFGBuilder took 535.15ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 124.5MB in the beginning and 142.6MB in the end (delta: -18.0MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-10-11 11:19:58,461 INFO L158 Benchmark]: TraceAbstraction took 7684.03ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 141.5MB in the beginning and 247.3MB in the end (delta: -105.8MB). Peak memory consumption was 144.8MB. Max. memory is 16.1GB. [2024-10-11 11:19:58,461 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 293.6MB. Free memory is still 247.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:19:58,462 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.10ms. Allocated memory is still 155.2MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.20ms. Allocated memory is still 155.2MB. Free memory was 98.0MB in the beginning and 80.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.17ms. Allocated memory is still 155.2MB. Free memory was 80.2MB in the beginning and 76.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.72ms. Allocated memory is still 155.2MB. Free memory was 75.7MB in the beginning and 124.6MB in the end (delta: -48.9MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * RCFGBuilder took 535.15ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 124.5MB in the beginning and 142.6MB in the end (delta: -18.0MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7684.03ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 141.5MB in the beginning and 247.3MB in the end (delta: -105.8MB). Peak memory consumption was 144.8MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 293.6MB. Free memory is still 247.3MB. 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 197, overapproximation of shiftLeft at line 116, overapproximation of someBinaryArithmeticDOUBLEoperation at line 148, overapproximation of someBinaryDOUBLEComparisonOperation at line 197. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 64; [L23] unsigned short int var_1_5 = 63575; [L24] unsigned long int var_1_6 = 10; [L25] unsigned long int var_1_8 = 3366149252; [L26] signed long int var_1_9 = -10; [L27] signed long int var_1_11 = 1938698816; [L28] unsigned char var_1_12 = 5; [L29] unsigned char var_1_13 = 64; [L30] unsigned char var_1_14 = 64; [L31] double var_1_15 = 99.625; [L32] double var_1_16 = 0.0; [L33] double var_1_17 = 999.5; [L34] double var_1_18 = 9.35; [L35] float var_1_19 = 99.875; [L36] float var_1_20 = 10000.71; [L37] double var_1_21 = 1000.5; [L38] double var_1_23 = 15.25; [L39] signed long int var_1_24 = 8; [L40] unsigned short int var_1_25 = 32; [L41] signed short int var_1_26 = 2; [L42] unsigned char var_1_27 = 0; [L43] unsigned char var_1_28 = 0; [L44] unsigned char var_1_29 = 0; [L45] unsigned char var_1_30 = 1; [L46] unsigned char var_1_32 = 0; [L47] float var_1_33 = 64.75; [L48] float var_1_34 = 9.2; [L49] unsigned short int last_1_var_1_1 = 64; [L50] signed long int last_1_var_1_9 = -10; [L51] unsigned char last_1_var_1_12 = 5; [L52] signed long int last_1_var_1_24 = 8; [L53] unsigned short int last_1_var_1_25 = 32; [L54] unsigned char last_1_var_1_27 = 0; [L55] unsigned char last_1_var_1_29 = 0; [L201] isInitial = 1 [L202] FCALL initially() [L203] COND TRUE 1 [L204] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_9 = var_1_9 [L190] last_1_var_1_12 = var_1_12 [L191] last_1_var_1_24 = var_1_24 [L192] last_1_var_1_25 = var_1_25 [L193] last_1_var_1_27 = var_1_27 [L194] last_1_var_1_29 = var_1_29 [L204] RET updateLastVariables() [L205] CALL updateVariables() [L152] var_1_5 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_5 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L153] RET assume_abort_if_not(var_1_5 >= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L154] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L154] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L155] var_1_8 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_8 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L156] RET assume_abort_if_not(var_1_8 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L157] CALL assume_abort_if_not(var_1_8 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L157] RET assume_abort_if_not(var_1_8 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L158] var_1_11 = __VERIFIER_nondet_long() [L159] CALL assume_abort_if_not(var_1_11 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L159] RET assume_abort_if_not(var_1_11 >= 1073741822) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L160] CALL assume_abort_if_not(var_1_11 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L160] RET assume_abort_if_not(var_1_11 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L161] var_1_13 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L162] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L163] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L163] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L164] var_1_14 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_14 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L165] RET assume_abort_if_not(var_1_14 >= 63) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L166] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L166] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L167] var_1_16 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L168] RET assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L169] var_1_17 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L170] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L171] var_1_18 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L172] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L173] var_1_20 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L174] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L175] var_1_28 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L176] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L177] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L177] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L178] var_1_30 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L179] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L180] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L180] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L181] var_1_32 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L182] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L183] CALL assume_abort_if_not(var_1_32 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L183] RET assume_abort_if_not(var_1_32 <= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L184] var_1_34 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L185] RET assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L205] RET updateVariables() [L206] CALL step() [L59] signed long int stepLocal_8 = 10000000; [L60] unsigned long int stepLocal_7 = 128u + last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_7=192, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L61] COND FALSE !(last_1_var_1_24 >= stepLocal_7) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=-10] [L66] COND FALSE !(\read(last_1_var_1_29)) [L73] var_1_9 = ((var_1_11 - 16) - last_1_var_1_24) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=2147483622] [L75] COND FALSE !(\read(last_1_var_1_29)) [L78] var_1_12 = (32 + ((((var_1_14 - 2) < 0 ) ? -(var_1_14 - 2) : (var_1_14 - 2)))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=2147483622] [L80] unsigned char stepLocal_4 = var_1_14; [L81] unsigned char stepLocal_3 = last_1_var_1_27; [L82] unsigned char stepLocal_2 = last_1_var_1_27; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_4=63, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=2147483622] [L83] COND TRUE (var_1_13 * (var_1_5 * last_1_var_1_9)) <= stepLocal_4 [L84] var_1_24 = 50 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=2147483622] [L94] var_1_15 = ((var_1_16 - var_1_17) - var_1_18) [L95] unsigned long int stepLocal_9 = 50u; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, stepLocal_9=50, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=2147483622] [L96] COND FALSE !(stepLocal_9 >= var_1_5) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=2147483622] [L99] COND FALSE !(\read(var_1_27)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=2147483622] [L102] signed short int stepLocal_1 = var_1_26; [L103] signed long int stepLocal_0 = var_1_24; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_1=2, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=2147483622] [L104] COND FALSE !(stepLocal_1 >= (var_1_26 + (var_1_14 * 16))) [L109] var_1_21 = (((((1.75) < (var_1_18)) ? (1.75) : (var_1_18))) - (9.9999999995E9 + var_1_17)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=2147483622] [L111] signed long int stepLocal_11 = (((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14)); [L112] unsigned char stepLocal_10 = var_1_27; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_10=0, stepLocal_11=63, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=2147483622] [L113] COND FALSE !(var_1_28 && stepLocal_10) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_11=63, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=2147483622] [L116] EXPR -25 << var_1_9 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_11=63, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=2147483622] [L116] COND TRUE stepLocal_11 > (-25 << var_1_9) [L117] var_1_29 = (var_1_27 || var_1_28) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=2147483622] [L122] COND FALSE !(last_1_var_1_12 >= last_1_var_1_24) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=2147483622] [L127] unsigned char stepLocal_12 = var_1_26 > var_1_1; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_12=0, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=2147483622] [L128] COND FALSE !(var_1_32 || stepLocal_12) [L131] var_1_33 = var_1_16 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=10, var_1_8=-2147483649, var_1_9=2147483622] [L133] COND TRUE (var_1_33 * 8.2) < 10.4 [L134] var_1_6 = (var_1_8 - var_1_9) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=-4294967271, var_1_8=-2147483649, var_1_9=2147483622] [L136] signed long int stepLocal_6 = 0; [L137] unsigned long int stepLocal_5 = 25u; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_5=25, stepLocal_6=0, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=-4294967271, var_1_8=-2147483649, var_1_9=2147483622] [L138] COND FALSE !(stepLocal_6 >= ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_5=25, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=-4294967271, var_1_8=-2147483649, var_1_9=2147483622] [L143] COND FALSE !(var_1_8 < stepLocal_5) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=-4294967271, var_1_8=-2147483649, var_1_9=2147483622] [L147] COND TRUE var_1_33 >= 0.25 [L148] var_1_19 = (var_1_17 + var_1_20) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=-4294967271, var_1_8=-2147483649, var_1_9=2147483622] [L206] RET step() [L207] CALL, EXPR property() [L197] EXPR (((((((((((((last_1_var_1_12 >= last_1_var_1_24) ? (last_1_var_1_29 ? (var_1_1 == ((unsigned short int) (var_1_5 - last_1_var_1_12))) : 1) : 1) && (((var_1_33 * 8.2) < 10.4) ? (var_1_6 == ((unsigned long int) (var_1_8 - var_1_9))) : 1)) && (last_1_var_1_29 ? (last_1_var_1_29 ? (var_1_9 == ((signed long int) (last_1_var_1_24 + 100))) : (var_1_9 == ((signed long int) (((((var_1_5 + last_1_var_1_24)) > (last_1_var_1_9)) ? ((var_1_5 + last_1_var_1_24)) : (last_1_var_1_9)))))) : (var_1_9 == ((signed long int) ((var_1_11 - 16) - last_1_var_1_24))))) && (last_1_var_1_29 ? (var_1_12 == ((unsigned char) (64 + var_1_13))) : (var_1_12 == ((unsigned char) (32 + ((((var_1_14 - 2) < 0 ) ? -(var_1_14 - 2) : (var_1_14 - 2)))))))) && (var_1_15 == ((double) ((var_1_16 - var_1_17) - var_1_18)))) && ((var_1_33 >= 0.25) ? (var_1_19 == ((float) (var_1_17 + var_1_20))) : 1)) && ((var_1_26 >= (var_1_26 + (var_1_14 * 16))) ? ((-256 > var_1_24) ? (var_1_21 == ((double) var_1_17)) : 1) : (var_1_21 == ((double) (((((1.75) < (var_1_18)) ? (1.75) : (var_1_18))) - (9.9999999995E9 + var_1_17)))))) && (var_1_27 ? (var_1_23 == ((double) ((((4.5) < 0 ) ? -(4.5) : (4.5))))) : 1)) && (((var_1_13 * (var_1_5 * last_1_var_1_9)) <= var_1_14) ? (var_1_24 == ((signed long int) 50)) : ((last_1_var_1_27 || last_1_var_1_27) ? ((last_1_var_1_27 || last_1_var_1_27) ? (var_1_24 == ((signed long int) last_1_var_1_12)) : 1) : (var_1_24 == ((signed long int) var_1_13))))) && ((0 >= ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6)))) ? (var_1_27 ? (var_1_25 == ((unsigned short int) (((((var_1_5 - var_1_9)) > ((var_1_12 + var_1_24))) ? ((var_1_5 - var_1_9)) : ((var_1_12 + var_1_24)))))) : 1) : ((var_1_8 < 25u) ? (var_1_25 == ((unsigned short int) var_1_6)) : 1))) && ((last_1_var_1_24 >= (128u + last_1_var_1_1)) ? ((10000000 != var_1_14) ? (var_1_26 == ((signed short int) last_1_var_1_25)) : 1) : 1)) && ((50u >= var_1_5) ? (var_1_27 == ((unsigned char) var_1_28)) : 1)) && ((var_1_28 && var_1_27) ? (var_1_29 == ((unsigned char) (var_1_28 && var_1_30))) : ((((((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14))) > (-25 << var_1_9)) ? (var_1_29 == ((unsigned char) (var_1_27 || var_1_28))) : (var_1_29 == ((unsigned char) ((var_1_23 <= ((((var_1_21) < (var_1_17)) ? (var_1_21) : (var_1_17)))) && var_1_32))))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=-4294967271, var_1_8=-2147483649, var_1_9=2147483622] [L197-L198] return ((((((((((((((last_1_var_1_12 >= last_1_var_1_24) ? (last_1_var_1_29 ? (var_1_1 == ((unsigned short int) (var_1_5 - last_1_var_1_12))) : 1) : 1) && (((var_1_33 * 8.2) < 10.4) ? (var_1_6 == ((unsigned long int) (var_1_8 - var_1_9))) : 1)) && (last_1_var_1_29 ? (last_1_var_1_29 ? (var_1_9 == ((signed long int) (last_1_var_1_24 + 100))) : (var_1_9 == ((signed long int) (((((var_1_5 + last_1_var_1_24)) > (last_1_var_1_9)) ? ((var_1_5 + last_1_var_1_24)) : (last_1_var_1_9)))))) : (var_1_9 == ((signed long int) ((var_1_11 - 16) - last_1_var_1_24))))) && (last_1_var_1_29 ? (var_1_12 == ((unsigned char) (64 + var_1_13))) : (var_1_12 == ((unsigned char) (32 + ((((var_1_14 - 2) < 0 ) ? -(var_1_14 - 2) : (var_1_14 - 2)))))))) && (var_1_15 == ((double) ((var_1_16 - var_1_17) - var_1_18)))) && ((var_1_33 >= 0.25) ? (var_1_19 == ((float) (var_1_17 + var_1_20))) : 1)) && ((var_1_26 >= (var_1_26 + (var_1_14 * 16))) ? ((-256 > var_1_24) ? (var_1_21 == ((double) var_1_17)) : 1) : (var_1_21 == ((double) (((((1.75) < (var_1_18)) ? (1.75) : (var_1_18))) - (9.9999999995E9 + var_1_17)))))) && (var_1_27 ? (var_1_23 == ((double) ((((4.5) < 0 ) ? -(4.5) : (4.5))))) : 1)) && (((var_1_13 * (var_1_5 * last_1_var_1_9)) <= var_1_14) ? (var_1_24 == ((signed long int) 50)) : ((last_1_var_1_27 || last_1_var_1_27) ? ((last_1_var_1_27 || last_1_var_1_27) ? (var_1_24 == ((signed long int) last_1_var_1_12)) : 1) : (var_1_24 == ((signed long int) var_1_13))))) && ((0 >= ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6)))) ? (var_1_27 ? (var_1_25 == ((unsigned short int) (((((var_1_5 - var_1_9)) > ((var_1_12 + var_1_24))) ? ((var_1_5 - var_1_9)) : ((var_1_12 + var_1_24)))))) : 1) : ((var_1_8 < 25u) ? (var_1_25 == ((unsigned short int) var_1_6)) : 1))) && ((last_1_var_1_24 >= (128u + last_1_var_1_1)) ? ((10000000 != var_1_14) ? (var_1_26 == ((signed short int) last_1_var_1_25)) : 1) : 1)) && ((50u >= var_1_5) ? (var_1_27 == ((unsigned char) var_1_28)) : 1)) && ((var_1_28 && var_1_27) ? (var_1_29 == ((unsigned char) (var_1_28 && var_1_30))) : ((((((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14))) > (-25 << var_1_9)) ? (var_1_29 == ((unsigned char) (var_1_27 || var_1_28))) : (var_1_29 == ((unsigned char) ((var_1_23 <= ((((var_1_21) < (var_1_17)) ? (var_1_21) : (var_1_17)))) && var_1_32)))))) && ((var_1_32 || (var_1_26 > var_1_1)) ? (var_1_33 == ((float) (((((var_1_20 + ((((var_1_17) > (var_1_34)) ? (var_1_17) : (var_1_34))))) < (var_1_16)) ? ((var_1_20 + ((((var_1_17) > (var_1_34)) ? (var_1_17) : (var_1_34))))) : (var_1_16))))) : (var_1_33 == ((float) var_1_16))) ; [L207] RET, EXPR property() [L207] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=-4294967271, var_1_8=-2147483649, var_1_9=2147483622] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=2147483646, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=-4294967271, var_1_8=-2147483649, var_1_9=2147483622] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2003 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2003 mSDsluCounter, 3179 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2106 mSDsCounter, 500 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1509 IncrementalHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 500 mSolverCounterUnsat, 1073 mSDtfsCounter, 1509 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 981 GetRequests, 879 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2167 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=944occurred in iteration=6, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 534 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1611 NumberOfCodeBlocks, 1611 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1596 ConstructedInterpolants, 0 QuantifiedInterpolants, 4367 SizeOfPredicates, 5 NumberOfNonLiveVariables, 761 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 8910/9240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:19:58,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-66.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4ab91c42a4ee5026a7e0836ff3c7333b9b4fcfd29b459af3488580e0e554eec --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:20:00,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:20:00,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:20:00,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:20:00,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:20:00,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:20:00,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:20:00,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:20:00,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:20:00,361 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:20:00,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:20:00,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:20:00,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:20:00,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:20:00,362 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:20:00,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:20:00,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:20:00,363 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:20:00,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:20:00,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:20:00,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:20:00,367 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:20:00,367 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:20:00,367 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:20:00,367 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:20:00,367 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:20:00,368 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:20:00,368 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:20:00,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:20:00,368 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:20:00,368 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:20:00,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:20:00,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:20:00,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:20:00,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:20:00,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:20:00,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:20:00,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:20:00,369 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:20:00,369 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:20:00,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:20:00,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:20:00,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:20:00,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:20:00,371 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:20:00,372 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4ab91c42a4ee5026a7e0836ff3c7333b9b4fcfd29b459af3488580e0e554eec [2024-10-11 11:20:00,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:20:00,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:20:00,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:20:00,638 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:20:00,638 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:20:00,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-66.i [2024-10-11 11:20:01,819 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:20:02,024 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:20:02,026 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-66.i [2024-10-11 11:20:02,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/82aee487f/6901731ca282488aabc911f0c54d4d14/FLAGb27e19678 [2024-10-11 11:20:02,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/82aee487f/6901731ca282488aabc911f0c54d4d14 [2024-10-11 11:20:02,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:20:02,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:20:02,058 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:20:02,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:20:02,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:20:02,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:20:02" (1/1) ... [2024-10-11 11:20:02,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78156b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:02, skipping insertion in model container [2024-10-11 11:20:02,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:20:02" (1/1) ... [2024-10-11 11:20:02,094 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:20:02,230 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-66.i[916,929] [2024-10-11 11:20:02,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:20:02,333 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:20:02,347 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-66.i[916,929] [2024-10-11 11:20:02,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:20:02,443 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:20:02,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:02 WrapperNode [2024-10-11 11:20:02,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:20:02,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:20:02,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:20:02,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:20:02,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:02" (1/1) ... [2024-10-11 11:20:02,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:02" (1/1) ... [2024-10-11 11:20:02,484 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-10-11 11:20:02,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:20:02,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:20:02,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:20:02,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:20:02,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:02" (1/1) ... [2024-10-11 11:20:02,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:02" (1/1) ... [2024-10-11 11:20:02,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:02" (1/1) ... [2024-10-11 11:20:02,517 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:20:02,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:02" (1/1) ... [2024-10-11 11:20:02,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:02" (1/1) ... [2024-10-11 11:20:02,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:02" (1/1) ... [2024-10-11 11:20:02,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:02" (1/1) ... [2024-10-11 11:20:02,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:02" (1/1) ... [2024-10-11 11:20:02,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:02" (1/1) ... [2024-10-11 11:20:02,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:20:02,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:20:02,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:20:02,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:20:02,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:02" (1/1) ... [2024-10-11 11:20:02,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:20:02,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:20:02,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:20:02,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:20:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:20:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:20:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:20:02,621 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:20:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:20:02,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:20:02,705 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:20:02,706 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:20:11,673 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-11 11:20:11,673 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:20:11,721 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:20:11,721 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:20:11,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:20:11 BoogieIcfgContainer [2024-10-11 11:20:11,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:20:11,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:20:11,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:20:11,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:20:11,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:20:02" (1/3) ... [2024-10-11 11:20:11,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17999e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:20:11, skipping insertion in model container [2024-10-11 11:20:11,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:20:02" (2/3) ... [2024-10-11 11:20:11,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17999e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:20:11, skipping insertion in model container [2024-10-11 11:20:11,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:20:11" (3/3) ... [2024-10-11 11:20:11,729 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-66.i [2024-10-11 11:20:11,741 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:20:11,741 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:20:11,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:20:11,795 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;@408e7e1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:20:11,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:20:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 52 states have internal predecessors, (78), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:20:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 11:20:11,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:20:11,811 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:20:11,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:20:11,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:20:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1928280901, now seen corresponding path program 1 times [2024-10-11 11:20:11,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:20:11,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148418385] [2024-10-11 11:20:11,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:20:11,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:20:11,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:20:11,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:20:11,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:20:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:12,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:20:12,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:20:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-10-11 11:20:12,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:20:12,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:20:12,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148418385] [2024-10-11 11:20:12,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148418385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:20:12,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:20:12,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:20:12,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326947797] [2024-10-11 11:20:12,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:20:12,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:20:12,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:20:12,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:20:12,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:20:12,611 INFO L87 Difference]: Start difference. First operand has 75 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 52 states have internal predecessors, (78), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 11:20:16,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:20:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:20:16,899 INFO L93 Difference]: Finished difference Result 147 states and 259 transitions. [2024-10-11 11:20:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:20:16,978 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 143 [2024-10-11 11:20:16,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:20:16,984 INFO L225 Difference]: With dead ends: 147 [2024-10-11 11:20:16,984 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 11:20:16,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:20:16,989 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:20:16,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 11:20:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 11:20:17,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 11:20:17,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.46) internal successors, (73), 50 states have internal predecessors, (73), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:20:17,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 115 transitions. [2024-10-11 11:20:17,030 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 115 transitions. Word has length 143 [2024-10-11 11:20:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:20:17,031 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 115 transitions. [2024-10-11 11:20:17,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 11:20:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 115 transitions. [2024-10-11 11:20:17,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 11:20:17,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:20:17,033 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:20:17,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:20:17,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:20:17,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:20:17,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:20:17,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1792399039, now seen corresponding path program 1 times [2024-10-11 11:20:17,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:20:17,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600098124] [2024-10-11 11:20:17,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:20:17,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:20:17,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:20:17,240 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:20:17,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:20:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:17,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 11:20:17,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:20:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 11:20:20,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:20:20,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:20:20,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600098124] [2024-10-11 11:20:20,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600098124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:20:20,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:20:20,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:20:20,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826413669] [2024-10-11 11:20:20,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:20:20,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:20:20,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:20:20,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:20:20,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:20:20,683 INFO L87 Difference]: Start difference. First operand 73 states and 115 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 11:20:25,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:20:29,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:20:33,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:20:37,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:20:41,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:20:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:20:41,631 INFO L93 Difference]: Finished difference Result 231 states and 366 transitions. [2024-10-11 11:20:41,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:20:41,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2024-10-11 11:20:41,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:20:41,732 INFO L225 Difference]: With dead ends: 231 [2024-10-11 11:20:41,732 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 11:20:41,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:20:41,733 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 113 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 49 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2024-10-11 11:20:41,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 320 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 16 Invalid, 5 Unknown, 0 Unchecked, 20.9s Time] [2024-10-11 11:20:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 11:20:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 131. [2024-10-11 11:20:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 11:20:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 205 transitions. [2024-10-11 11:20:41,759 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 205 transitions. Word has length 143 [2024-10-11 11:20:41,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:20:41,760 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 205 transitions. [2024-10-11 11:20:41,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 11:20:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 205 transitions. [2024-10-11 11:20:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 11:20:41,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:20:41,763 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:20:41,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 11:20:41,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:20:41,965 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:20:41,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:20:41,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2079866431, now seen corresponding path program 1 times [2024-10-11 11:20:41,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:20:41,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23584894] [2024-10-11 11:20:41,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:20:41,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:20:41,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:20:41,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:20:41,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 11:20:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:20:42,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 11:20:42,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:20:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 134 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-11 11:20:50,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:20:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-11 11:20:53,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:20:53,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23584894] [2024-10-11 11:20:53,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23584894] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:20:53,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:20:53,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2024-10-11 11:20:53,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251123866] [2024-10-11 11:20:53,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:20:53,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 11:20:53,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:20:53,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 11:20:53,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:20:53,663 INFO L87 Difference]: Start difference. First operand 131 states and 205 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-10-11 11:21:00,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:21:04,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:21:08,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:21:12,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:21:16,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:21:20,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:21:24,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []