./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-1loop_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-36.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 161bb7a2aeb8f0e9fdffca01ff4293552e60c655d94a257edfbbb7105096b1f1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:04:32,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:04:32,415 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:04:32,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:04:32,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:04:32,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:04:32,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:04:32,444 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:04:32,445 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:04:32,445 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:04:32,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:04:32,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:04:32,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:04:32,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:04:32,447 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:04:32,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:04:32,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:04:32,449 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:04:32,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:04:32,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:04:32,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:04:32,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:04:32,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:04:32,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:04:32,451 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:04:32,451 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:04:32,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:04:32,451 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:04:32,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:04:32,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:04:32,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:04:32,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:04:32,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:04:32,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:04:32,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:04:32,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:04:32,453 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:04:32,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:04:32,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:04:32,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:04:32,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:04:32,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:04:32,455 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 161bb7a2aeb8f0e9fdffca01ff4293552e60c655d94a257edfbbb7105096b1f1 [2024-10-24 09:04:32,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:04:32,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:04:32,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:04:32,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:04:32,699 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:04:32,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-36.i [2024-10-24 09:04:34,010 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:04:34,212 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:04:34,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-36.i [2024-10-24 09:04:34,223 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8385dc673/13ed2633370445e19c18d459a9cde2ba/FLAG997a34d43 [2024-10-24 09:04:34,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8385dc673/13ed2633370445e19c18d459a9cde2ba [2024-10-24 09:04:34,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:04:34,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:04:34,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:04:34,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:04:34,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:04:34,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:04:34" (1/1) ... [2024-10-24 09:04:34,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a87fee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:34, skipping insertion in model container [2024-10-24 09:04:34,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:04:34" (1/1) ... [2024-10-24 09:04:34,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:04:34,742 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-1loop_file-36.i[916,929] [2024-10-24 09:04:34,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:04:34,812 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:04:34,820 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-1loop_file-36.i[916,929] [2024-10-24 09:04:34,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:04:34,878 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:04:34,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:34 WrapperNode [2024-10-24 09:04:34,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:04:34,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:04:34,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:04:34,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:04:34,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:34" (1/1) ... [2024-10-24 09:04:34,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:34" (1/1) ... [2024-10-24 09:04:34,952 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 339 [2024-10-24 09:04:34,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:04:34,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:04:34,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:04:34,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:04:34,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:34" (1/1) ... [2024-10-24 09:04:34,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:34" (1/1) ... [2024-10-24 09:04:34,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:34" (1/1) ... [2024-10-24 09:04:35,005 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-24 09:04:35,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:34" (1/1) ... [2024-10-24 09:04:35,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:34" (1/1) ... [2024-10-24 09:04:35,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:34" (1/1) ... [2024-10-24 09:04:35,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:34" (1/1) ... [2024-10-24 09:04:35,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:34" (1/1) ... [2024-10-24 09:04:35,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:34" (1/1) ... [2024-10-24 09:04:35,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:04:35,049 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:04:35,049 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:04:35,049 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:04:35,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:34" (1/1) ... [2024-10-24 09:04:35,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:04:35,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:04:35,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:04:35,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:04:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:04:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:04:35,115 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:04:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:04:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:04:35,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:04:35,205 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:04:35,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:04:35,662 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-10-24 09:04:35,662 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:04:35,694 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:04:35,695 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:04:35,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:04:35 BoogieIcfgContainer [2024-10-24 09:04:35,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:04:35,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:04:35,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:04:35,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:04:35,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:04:34" (1/3) ... [2024-10-24 09:04:35,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa5c211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:04:35, skipping insertion in model container [2024-10-24 09:04:35,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:34" (2/3) ... [2024-10-24 09:04:35,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa5c211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:04:35, skipping insertion in model container [2024-10-24 09:04:35,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:04:35" (3/3) ... [2024-10-24 09:04:35,702 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-36.i [2024-10-24 09:04:35,714 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:04:35,714 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:04:35,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:04:35,763 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;@50ab8ec9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:04:35,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:04:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 104 states have (on average 1.5192307692307692) internal successors, (158), 105 states have internal predecessors, (158), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 09:04:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-24 09:04:35,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:04:35,779 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:04:35,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:04:35,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:04:35,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1837589474, now seen corresponding path program 1 times [2024-10-24 09:04:35,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:04:35,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253819843] [2024-10-24 09:04:35,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:04:35,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:04:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:04:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:04:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:04:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:04:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:04:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:04:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:04:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 09:04:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:04:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:04:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:04:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:04:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:04:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:04:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:04:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:04:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:04:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:04:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:04:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:04:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:04:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:04:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:04:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:04:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:04:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 09:04:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 09:04:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 09:04:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 09:04:36,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:04:36,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253819843] [2024-10-24 09:04:36,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253819843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:04:36,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:04:36,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:04:36,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173925122] [2024-10-24 09:04:36,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:04:36,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:04:36,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:04:36,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:04:36,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:04:36,191 INFO L87 Difference]: Start difference. First operand has 135 states, 104 states have (on average 1.5192307692307692) internal successors, (158), 105 states have internal predecessors, (158), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 09:04:36,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:04:36,314 INFO L93 Difference]: Finished difference Result 269 states and 455 transitions. [2024-10-24 09:04:36,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:04:36,316 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 191 [2024-10-24 09:04:36,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:04:36,326 INFO L225 Difference]: With dead ends: 269 [2024-10-24 09:04:36,329 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 09:04:36,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-24 09:04:36,335 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:04:36,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:04:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 09:04:36,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-24 09:04:36,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 103 states have (on average 1.4854368932038835) internal successors, (153), 103 states have internal predecessors, (153), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 09:04:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 209 transitions. [2024-10-24 09:04:36,381 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 209 transitions. Word has length 191 [2024-10-24 09:04:36,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:04:36,382 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 209 transitions. [2024-10-24 09:04:36,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 09:04:36,382 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 209 transitions. [2024-10-24 09:04:36,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-24 09:04:36,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:04:36,385 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:04:36,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:04:36,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:04:36,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:04:36,386 INFO L85 PathProgramCache]: Analyzing trace with hash -858015594, now seen corresponding path program 1 times [2024-10-24 09:04:36,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:04:36,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505915908] [2024-10-24 09:04:36,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:04:36,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:04:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:04:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:04:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:04:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:04:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:04:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:04:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:04:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 09:04:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:04:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:04:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:04:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:04:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:04:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:04:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:04:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:04:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:04:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:04:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:04:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:04:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:04:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:04:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:04:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:04:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:04:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 09:04:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 09:04:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 09:04:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 09:04:36,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:04:36,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505915908] [2024-10-24 09:04:36,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505915908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:04:36,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:04:36,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:04:36,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605388298] [2024-10-24 09:04:36,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:04:36,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:04:36,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:04:36,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:04:36,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:04:36,724 INFO L87 Difference]: Start difference. First operand 133 states and 209 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:04:36,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:04:36,822 INFO L93 Difference]: Finished difference Result 265 states and 417 transitions. [2024-10-24 09:04:36,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:04:36,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 191 [2024-10-24 09:04:36,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:04:36,824 INFO L225 Difference]: With dead ends: 265 [2024-10-24 09:04:36,826 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 09:04:36,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-24 09:04:36,827 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:04:36,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 359 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:04:36,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 09:04:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-24 09:04:36,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 103 states have internal predecessors, (152), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 09:04:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 208 transitions. [2024-10-24 09:04:36,844 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 208 transitions. Word has length 191 [2024-10-24 09:04:36,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:04:36,845 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 208 transitions. [2024-10-24 09:04:36,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:04:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 208 transitions. [2024-10-24 09:04:36,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-24 09:04:36,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:04:36,851 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:04:36,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:04:36,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:04:36,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:04:36,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1486929199, now seen corresponding path program 1 times [2024-10-24 09:04:36,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:04:36,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997209204] [2024-10-24 09:04:36,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:04:36,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:04:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:04:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:04:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:04:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:04:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:04:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:04:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:04:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 09:04:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:04:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:04:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:04:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:04:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:04:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:04:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:04:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:04:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:04:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:04:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:04:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:04:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:04:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:04:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:04:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:04:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:04:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 09:04:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 09:04:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 09:04:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 09:04:37,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:04:37,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997209204] [2024-10-24 09:04:37,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997209204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:04:37,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:04:37,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:04:37,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089277651] [2024-10-24 09:04:37,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:04:37,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:04:37,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:04:37,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:04:37,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:04:37,085 INFO L87 Difference]: Start difference. First operand 133 states and 208 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:04:37,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:04:37,196 INFO L93 Difference]: Finished difference Result 387 states and 608 transitions. [2024-10-24 09:04:37,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:04:37,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 193 [2024-10-24 09:04:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:04:37,199 INFO L225 Difference]: With dead ends: 387 [2024-10-24 09:04:37,201 INFO L226 Difference]: Without dead ends: 255 [2024-10-24 09:04:37,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-24 09:04:37,203 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 177 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:04:37,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 467 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:04:37,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-24 09:04:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2024-10-24 09:04:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 193 states have (on average 1.4455958549222798) internal successors, (279), 193 states have internal predecessors, (279), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 09:04:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 391 transitions. [2024-10-24 09:04:37,236 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 391 transitions. Word has length 193 [2024-10-24 09:04:37,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:04:37,237 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 391 transitions. [2024-10-24 09:04:37,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:04:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 391 transitions. [2024-10-24 09:04:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 09:04:37,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:04:37,240 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:04:37,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:04:37,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:04:37,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:04:37,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1522729658, now seen corresponding path program 1 times [2024-10-24 09:04:37,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:04:37,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360651714] [2024-10-24 09:04:37,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:04:37,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:04:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:04:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:04:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:04:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:04:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:04:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:04:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:04:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 09:04:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:04:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:04:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:04:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:04:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:04:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:04:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:04:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:04:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:04:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:04:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:04:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:04:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:04:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:04:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:04:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:04:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:04:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 09:04:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 09:04:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 09:04:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 09:04:37,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:04:37,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360651714] [2024-10-24 09:04:37,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360651714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:04:37,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:04:37,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:04:37,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158063498] [2024-10-24 09:04:37,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:04:37,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:04:37,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:04:37,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:04:37,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:04:37,368 INFO L87 Difference]: Start difference. First operand 252 states and 391 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:04:37,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:04:37,421 INFO L93 Difference]: Finished difference Result 752 states and 1167 transitions. [2024-10-24 09:04:37,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:04:37,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 194 [2024-10-24 09:04:37,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:04:37,424 INFO L225 Difference]: With dead ends: 752 [2024-10-24 09:04:37,424 INFO L226 Difference]: Without dead ends: 501 [2024-10-24 09:04:37,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-24 09:04:37,425 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 197 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:04:37,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 395 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:04:37,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-10-24 09:04:37,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 497. [2024-10-24 09:04:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 380 states have (on average 1.431578947368421) internal successors, (544), 380 states have internal predecessors, (544), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-24 09:04:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 768 transitions. [2024-10-24 09:04:37,470 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 768 transitions. Word has length 194 [2024-10-24 09:04:37,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:04:37,471 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 768 transitions. [2024-10-24 09:04:37,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:04:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 768 transitions. [2024-10-24 09:04:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 09:04:37,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:04:37,474 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:04:37,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:04:37,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:04:37,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:04:37,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1780895096, now seen corresponding path program 1 times [2024-10-24 09:04:37,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:04:37,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635946189] [2024-10-24 09:04:37,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:04:37,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:04:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:04:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:04:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:04:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:04:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:04:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:04:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:04:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 09:04:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:04:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:04:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:04:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:04:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:04:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:04:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:04:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:04:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:04:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:04:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:04:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:04:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:04:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:04:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:04:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:04:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:04:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 09:04:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 09:04:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 09:04:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 09:04:37,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:04:37,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635946189] [2024-10-24 09:04:37,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635946189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:04:37,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:04:37,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:04:37,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095099534] [2024-10-24 09:04:37,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:04:37,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:04:37,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:04:37,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:04:37,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:04:37,716 INFO L87 Difference]: Start difference. First operand 497 states and 768 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:04:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:04:37,846 INFO L93 Difference]: Finished difference Result 1253 states and 1942 transitions. [2024-10-24 09:04:37,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:04:37,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 194 [2024-10-24 09:04:37,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:04:37,850 INFO L225 Difference]: With dead ends: 1253 [2024-10-24 09:04:37,850 INFO L226 Difference]: Without dead ends: 757 [2024-10-24 09:04:37,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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-24 09:04:37,852 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 190 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:04:37,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 429 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:04:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2024-10-24 09:04:37,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 753. [2024-10-24 09:04:37,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 578 states have (on average 1.4359861591695502) internal successors, (830), 578 states have internal predecessors, (830), 168 states have call successors, (168), 6 states have call predecessors, (168), 6 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-10-24 09:04:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1166 transitions. [2024-10-24 09:04:37,884 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1166 transitions. Word has length 194 [2024-10-24 09:04:37,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:04:37,884 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1166 transitions. [2024-10-24 09:04:37,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:04:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1166 transitions. [2024-10-24 09:04:37,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 09:04:37,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:04:37,886 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:04:37,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 09:04:37,887 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:04:37,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:04:37,887 INFO L85 PathProgramCache]: Analyzing trace with hash -885216024, now seen corresponding path program 1 times [2024-10-24 09:04:37,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:04:37,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836383192] [2024-10-24 09:04:37,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:04:37,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:04:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:04:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:04:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:04:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:04:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:04:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:04:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:04:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 09:04:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:04:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:04:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:04:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:04:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:04:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:04:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:04:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:04:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:04:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:04:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:04:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:04:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:04:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:04:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:04:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:04:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:04:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 09:04:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 09:04:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 09:04:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 09:04:38,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:04:38,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836383192] [2024-10-24 09:04:38,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836383192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:04:38,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:04:38,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:04:38,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193038845] [2024-10-24 09:04:38,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:04:38,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:04:38,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:04:38,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:04:38,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:04:38,159 INFO L87 Difference]: Start difference. First operand 753 states and 1166 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:04:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:04:38,337 INFO L93 Difference]: Finished difference Result 1529 states and 2366 transitions. [2024-10-24 09:04:38,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:04:38,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 194 [2024-10-24 09:04:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:04:38,341 INFO L225 Difference]: With dead ends: 1529 [2024-10-24 09:04:38,342 INFO L226 Difference]: Without dead ends: 771 [2024-10-24 09:04:38,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:04:38,344 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 180 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:04:38,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 825 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:04:38,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-10-24 09:04:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 761. [2024-10-24 09:04:38,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 586 states have (on average 1.4334470989761092) internal successors, (840), 586 states have internal predecessors, (840), 168 states have call successors, (168), 6 states have call predecessors, (168), 6 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-10-24 09:04:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1176 transitions. [2024-10-24 09:04:38,375 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1176 transitions. Word has length 194 [2024-10-24 09:04:38,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:04:38,376 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1176 transitions. [2024-10-24 09:04:38,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:04:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1176 transitions. [2024-10-24 09:04:38,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 09:04:38,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:04:38,378 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:04:38,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 09:04:38,378 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:04:38,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:04:38,378 INFO L85 PathProgramCache]: Analyzing trace with hash -666361306, now seen corresponding path program 1 times [2024-10-24 09:04:38,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:04:38,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733821171] [2024-10-24 09:04:38,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:04:38,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:04:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:04:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:04:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:04:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:04:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:04:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:04:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:04:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 09:04:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:04:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:04:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:04:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:04:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:04:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:04:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:04:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:04:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:04:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:04:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:04:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:04:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:04:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:04:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:04:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:04:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:04:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 09:04:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 09:04:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 09:04:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 09:04:38,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:04:38,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733821171] [2024-10-24 09:04:38,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733821171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:04:38,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:04:38,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:04:38,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250551127] [2024-10-24 09:04:38,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:04:38,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:04:38,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:04:38,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:04:38,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:04:38,634 INFO L87 Difference]: Start difference. First operand 761 states and 1176 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:04:38,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:04:38,887 INFO L93 Difference]: Finished difference Result 2021 states and 3124 transitions. [2024-10-24 09:04:38,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:04:38,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 194 [2024-10-24 09:04:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:04:38,895 INFO L225 Difference]: With dead ends: 2021 [2024-10-24 09:04:38,895 INFO L226 Difference]: Without dead ends: 1261 [2024-10-24 09:04:38,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 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-24 09:04:38,899 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 185 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:04:38,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 425 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:04:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2024-10-24 09:04:38,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 761. [2024-10-24 09:04:38,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 586 states have (on average 1.4266211604095562) internal successors, (836), 586 states have internal predecessors, (836), 168 states have call successors, (168), 6 states have call predecessors, (168), 6 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-10-24 09:04:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1172 transitions. [2024-10-24 09:04:38,948 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1172 transitions. Word has length 194 [2024-10-24 09:04:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:04:38,948 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1172 transitions. [2024-10-24 09:04:38,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:04:38,949 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1172 transitions. [2024-10-24 09:04:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-24 09:04:38,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:04:38,951 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:04:38,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 09:04:38,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:04:38,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:04:38,952 INFO L85 PathProgramCache]: Analyzing trace with hash -546601119, now seen corresponding path program 1 times [2024-10-24 09:04:38,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:04:38,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414706581] [2024-10-24 09:04:38,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:04:38,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:04:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:04:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:04:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:04:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:04:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:04:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:04:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:04:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 09:04:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:04:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:04:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:04:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:04:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:04:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:04:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:04:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:04:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:04:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:04:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:04:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:04:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:04:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:04:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:04:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:04:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:04:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 09:04:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 09:04:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 09:04:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 27 proven. 54 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-24 09:04:39,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:04:39,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414706581] [2024-10-24 09:04:39,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414706581] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:04:39,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268078593] [2024-10-24 09:04:39,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:04:39,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:04:39,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:04:39,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:04:39,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 09:04:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:39,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 09:04:39,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:04:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 763 proven. 33 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2024-10-24 09:04:39,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:04:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 48 proven. 33 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-24 09:04:39,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268078593] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:04:39,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 09:04:39,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2024-10-24 09:04:39,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452842265] [2024-10-24 09:04:39,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 09:04:39,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 09:04:39,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:04:39,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 09:04:39,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 09:04:39,818 INFO L87 Difference]: Start difference. First operand 761 states and 1172 transitions. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) [2024-10-24 09:04:40,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:04:40,372 INFO L93 Difference]: Finished difference Result 1799 states and 2694 transitions. [2024-10-24 09:04:40,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 09:04:40,373 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) Word has length 195 [2024-10-24 09:04:40,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:04:40,378 INFO L225 Difference]: With dead ends: 1799 [2024-10-24 09:04:40,378 INFO L226 Difference]: Without dead ends: 1023 [2024-10-24 09:04:40,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2024-10-24 09:04:40,380 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 809 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:04:40,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 473 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 09:04:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2024-10-24 09:04:40,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 977. [2024-10-24 09:04:40,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 756 states have (on average 1.3624338624338623) internal successors, (1030), 760 states have internal predecessors, (1030), 196 states have call successors, (196), 24 states have call predecessors, (196), 24 states have return successors, (196), 192 states have call predecessors, (196), 196 states have call successors, (196) [2024-10-24 09:04:40,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1422 transitions. [2024-10-24 09:04:40,452 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1422 transitions. Word has length 195 [2024-10-24 09:04:40,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:04:40,452 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1422 transitions. [2024-10-24 09:04:40,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) [2024-10-24 09:04:40,452 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1422 transitions. [2024-10-24 09:04:40,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-24 09:04:40,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:04:40,454 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:04:40,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 09:04:40,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:04:40,657 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:04:40,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:04:40,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1650819459, now seen corresponding path program 1 times [2024-10-24 09:04:40,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:04:40,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487903584] [2024-10-24 09:04:40,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:04:40,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:04:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:04:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:04:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:04:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:04:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:04:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:04:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:04:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 09:04:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:04:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:04:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:04:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:04:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:04:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:04:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:04:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:04:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:04:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:04:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:04:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:04:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:04:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:04:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:04:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:04:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:04:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 09:04:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 09:04:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 09:04:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 09:04:40,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:04:40,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487903584] [2024-10-24 09:04:40,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487903584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:04:40,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:04:40,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:04:40,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093438845] [2024-10-24 09:04:40,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:04:40,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:04:40,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:04:40,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:04:40,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:04:40,745 INFO L87 Difference]: Start difference. First operand 977 states and 1422 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:04:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:04:40,813 INFO L93 Difference]: Finished difference Result 2443 states and 3552 transitions. [2024-10-24 09:04:40,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:04:40,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2024-10-24 09:04:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:04:40,820 INFO L225 Difference]: With dead ends: 2443 [2024-10-24 09:04:40,821 INFO L226 Difference]: Without dead ends: 1467 [2024-10-24 09:04:40,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-24 09:04:40,823 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 106 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:04:40,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 435 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:04:40,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2024-10-24 09:04:40,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1233. [2024-10-24 09:04:40,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1012 states have (on average 1.3715415019762847) internal successors, (1388), 1016 states have internal predecessors, (1388), 196 states have call successors, (196), 24 states have call predecessors, (196), 24 states have return successors, (196), 192 states have call predecessors, (196), 196 states have call successors, (196) [2024-10-24 09:04:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1780 transitions. [2024-10-24 09:04:40,914 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1780 transitions. Word has length 195 [2024-10-24 09:04:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:04:40,914 INFO L471 AbstractCegarLoop]: Abstraction has 1233 states and 1780 transitions. [2024-10-24 09:04:40,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:04:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1780 transitions. [2024-10-24 09:04:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 09:04:40,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:04:40,917 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:04:40,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 09:04:40,918 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:04:40,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:04:40,918 INFO L85 PathProgramCache]: Analyzing trace with hash -619501393, now seen corresponding path program 1 times [2024-10-24 09:04:40,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:04:40,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052782424] [2024-10-24 09:04:40,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:04:40,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:04:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:04:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:04:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:04:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:04:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:04:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:04:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 09:04:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 09:04:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:04:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:04:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:04:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:04:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:04:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:04:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:04:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:04:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:04:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:04:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:04:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:04:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:04:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:04:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:04:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:04:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:04:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 09:04:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 09:04:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 09:04:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 09:04:41,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:04:41,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052782424] [2024-10-24 09:04:41,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052782424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:04:41,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:04:41,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:04:41,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876044208] [2024-10-24 09:04:41,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:04:41,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:04:41,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:04:41,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:04:41,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:04:41,172 INFO L87 Difference]: Start difference. First operand 1233 states and 1780 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:04:41,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:04:41,366 INFO L93 Difference]: Finished difference Result 3131 states and 4474 transitions. [2024-10-24 09:04:41,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:04:41,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196 [2024-10-24 09:04:41,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:04:41,373 INFO L225 Difference]: With dead ends: 3131 [2024-10-24 09:04:41,374 INFO L226 Difference]: Without dead ends: 1899 [2024-10-24 09:04:41,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 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-24 09:04:41,376 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 285 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:04:41,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 670 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:04:41,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2024-10-24 09:04:41,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1623. [2024-10-24 09:04:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1331 states have (on average 1.3553719008264462) internal successors, (1804), 1337 states have internal predecessors, (1804), 259 states have call successors, (259), 32 states have call predecessors, (259), 32 states have return successors, (259), 253 states have call predecessors, (259), 259 states have call successors, (259) [2024-10-24 09:04:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2322 transitions. [2024-10-24 09:04:41,483 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2322 transitions. Word has length 196 [2024-10-24 09:04:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:04:41,484 INFO L471 AbstractCegarLoop]: Abstraction has 1623 states and 2322 transitions. [2024-10-24 09:04:41,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:04:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2322 transitions. [2024-10-24 09:04:41,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-24 09:04:41,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:04:41,486 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:04:41,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 09:04:41,486 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:04:41,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:04:41,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1721801320, now seen corresponding path program 1 times [2024-10-24 09:04:41,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:04:41,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665185012] [2024-10-24 09:04:41,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:04:41,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:04:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:04:41,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [28969488] [2024-10-24 09:04:41,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:04:41,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:04:41,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:04:41,575 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:04:41,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 09:04:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:04:41,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:04:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:04:41,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:04:41,864 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:04:41,864 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:04:41,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 09:04:42,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-24 09:04:42,071 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:04:42,185 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:04:42,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:04:42 BoogieIcfgContainer [2024-10-24 09:04:42,188 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:04:42,188 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:04:42,188 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:04:42,188 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:04:42,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:04:35" (3/4) ... [2024-10-24 09:04:42,190 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:04:42,191 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:04:42,192 INFO L158 Benchmark]: Toolchain (without parser) took 7601.82ms. Allocated memory was 209.7MB in the beginning and 331.4MB in the end (delta: 121.6MB). Free memory was 180.1MB in the beginning and 143.5MB in the end (delta: 36.7MB). Peak memory consumption was 157.8MB. Max. memory is 16.1GB. [2024-10-24 09:04:42,192 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:04:42,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.24ms. Allocated memory is still 209.7MB. Free memory was 180.1MB in the beginning and 160.8MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 09:04:42,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.06ms. Allocated memory is still 209.7MB. Free memory was 160.8MB in the beginning and 154.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 09:04:42,192 INFO L158 Benchmark]: Boogie Preprocessor took 95.60ms. Allocated memory is still 209.7MB. Free memory was 154.5MB in the beginning and 148.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 09:04:42,193 INFO L158 Benchmark]: RCFGBuilder took 646.03ms. Allocated memory is still 209.7MB. Free memory was 147.2MB in the beginning and 105.2MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-24 09:04:42,193 INFO L158 Benchmark]: TraceAbstraction took 6490.75ms. Allocated memory was 209.7MB in the beginning and 331.4MB in the end (delta: 121.6MB). Free memory was 104.2MB in the beginning and 144.5MB in the end (delta: -40.4MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. [2024-10-24 09:04:42,193 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 331.4MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:04:42,194 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.13ms. Allocated memory is still 121.6MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.24ms. Allocated memory is still 209.7MB. Free memory was 180.1MB in the beginning and 160.8MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.06ms. Allocated memory is still 209.7MB. Free memory was 160.8MB in the beginning and 154.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.60ms. Allocated memory is still 209.7MB. Free memory was 154.5MB in the beginning and 148.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 646.03ms. Allocated memory is still 209.7MB. Free memory was 147.2MB in the beginning and 105.2MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6490.75ms. Allocated memory was 209.7MB in the beginning and 331.4MB in the end (delta: 121.6MB). Free memory was 104.2MB in the beginning and 144.5MB in the end (delta: -40.4MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 331.4MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 202, overapproximation of shiftRight at line 107, overapproximation of bitwiseOr at line 116, overapproximation of someUnaryDOUBLEoperation at line 22, overapproximation of someBinaryDOUBLEComparisonOperation at line 202. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = -0.5; [L23] unsigned char var_1_2 = 0; [L24] float var_1_4 = 32.5; [L25] float var_1_5 = 10.25; [L26] float var_1_6 = 15.2; [L27] unsigned short int var_1_7 = 1; [L28] unsigned short int var_1_10 = 1; [L29] signed short int var_1_12 = 8; [L30] signed short int var_1_13 = -16; [L31] unsigned long int var_1_16 = 0; [L32] unsigned long int var_1_17 = 1790089366; [L33] unsigned long int var_1_18 = 1816612959; [L34] unsigned long int var_1_19 = 2; [L35] unsigned char var_1_20 = 32; [L36] unsigned char var_1_21 = 32; [L37] unsigned short int var_1_22 = 256; [L38] unsigned short int var_1_23 = 21380; [L39] signed char var_1_25 = 8; [L40] signed char var_1_26 = 0; [L41] signed char var_1_27 = 32; [L42] signed char var_1_28 = 32; [L43] double var_1_29 = 99999999.2; [L44] double var_1_31 = 64.25; [L45] double var_1_32 = 100.6; [L46] unsigned char var_1_33 = 0; [L47] unsigned char var_1_34 = 0; [L48] unsigned short int var_1_35 = 4; [L49] unsigned long int last_1_var_1_16 = 0; [L50] unsigned long int last_1_var_1_19 = 2; [L51] unsigned char last_1_var_1_20 = 32; [L52] signed char last_1_var_1_25 = 8; [L53] unsigned char last_1_var_1_33 = 0; [L206] isInitial = 1 [L207] FCALL initially() [L208] int k_loop; [L209] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L209] COND TRUE k_loop < 1 [L210] CALL updateLastVariables() [L195] last_1_var_1_16 = var_1_16 [L196] last_1_var_1_19 = var_1_19 [L197] last_1_var_1_20 = var_1_20 [L198] last_1_var_1_25 = var_1_25 [L199] last_1_var_1_33 = var_1_33 [L210] RET updateLastVariables() [L211] CALL updateVariables() [L149] var_1_2 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L150] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L151] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L151] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L152] var_1_4 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L153] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L154] var_1_5 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=76/5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=76/5, var_1_7=1] [L155] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=76/5, var_1_7=1] [L156] var_1_6 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L157] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L158] var_1_10 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L159] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L160] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L160] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L161] var_1_12 = __VERIFIER_nondet_short() [L162] CALL assume_abort_if_not(var_1_12 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L162] RET assume_abort_if_not(var_1_12 >= -32768) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L163] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L163] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L164] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L164] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L165] var_1_17 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_17 >= 1610612735) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L166] RET assume_abort_if_not(var_1_17 >= 1610612735) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L167] CALL assume_abort_if_not(var_1_17 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L167] RET assume_abort_if_not(var_1_17 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L168] var_1_18 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_18 >= 1610612735) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L169] RET assume_abort_if_not(var_1_18 >= 1610612735) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L170] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L170] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L171] var_1_21 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L172] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L173] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L173] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L174] var_1_23 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_23 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L175] RET assume_abort_if_not(var_1_23 >= 16383) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L176] CALL assume_abort_if_not(var_1_23 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L176] RET assume_abort_if_not(var_1_23 <= 32767) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L177] var_1_26 = __VERIFIER_nondet_char() [L178] CALL assume_abort_if_not(var_1_26 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L178] RET assume_abort_if_not(var_1_26 >= -63) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L179] CALL assume_abort_if_not(var_1_26 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L179] RET assume_abort_if_not(var_1_26 <= 63) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L180] var_1_27 = __VERIFIER_nondet_char() [L181] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L181] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L182] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L182] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L183] var_1_28 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_28 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L184] RET assume_abort_if_not(var_1_28 >= -127) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L185] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L185] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L186] var_1_31 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L187] RET assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L188] var_1_32 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L189] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L190] var_1_34 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_35=4, var_1_7=1] [L191] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_35=4, var_1_7=1] [L192] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L192] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L211] RET updateVariables() [L212] CALL step() [L57] COND FALSE !(\read(last_1_var_1_33)) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L66] COND TRUE var_1_6 == (- (99.4f * var_1_4)) [L67] var_1_25 = (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L75] EXPR var_1_10 & last_1_var_1_25 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L75] unsigned long int stepLocal_3 = last_1_var_1_16 * (var_1_10 & last_1_var_1_25); [L76] COND FALSE !(\read(last_1_var_1_33)) [L85] var_1_20 = 100 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L87] signed char stepLocal_2 = var_1_25; [L88] unsigned short int stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L89] COND TRUE stepLocal_2 <= last_1_var_1_16 [L90] var_1_16 = ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L96] unsigned long int stepLocal_5 = var_1_16; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, stepLocal_5=3808567485, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L97] COND FALSE !(var_1_18 >= stepLocal_5) [L104] var_1_29 = var_1_6 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=2, var_1_7=1] [L106] var_1_35 = var_1_7 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] EXPR var_1_20 >> var_1_12 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] EXPR ((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12)) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] EXPR var_1_20 >> var_1_12 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] EXPR ((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12)) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] COND TRUE (var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12)))) [L108] var_1_13 = 8 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L112] COND FALSE !(var_1_13 >= var_1_18) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L115] signed short int stepLocal_6 = var_1_13; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, stepLocal_6=8, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L116] EXPR var_1_20 ^ var_1_23 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, stepLocal_6=8, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L116] COND TRUE (var_1_20 ^ var_1_23) > stepLocal_6 [L117] COND TRUE ! (var_1_18 == (var_1_20 + var_1_7)) [L118] var_1_33 = var_1_34 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L127] unsigned long int stepLocal_0 = var_1_19; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L128] COND FALSE !(\read(var_1_33)) [L135] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L137] unsigned char stepLocal_4 = var_1_20; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, stepLocal_4=100, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L138] COND FALSE !(stepLocal_4 < var_1_20) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L141] COND FALSE !(\read(var_1_33)) [L144] var_1_22 = 2 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L212] RET step() [L213] CALL, EXPR property() [L202] EXPR ((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25)))))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L202] EXPR (((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L202] EXPR (((((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100)))) && ((var_1_20 < var_1_20) ? (var_1_22 == ((unsigned short int) ((((((var_1_16 + 16) + (var_1_23 - var_1_21))) < (var_1_20)) ? (((var_1_16 + 16) + (var_1_23 - var_1_21))) : (var_1_20))))) : (var_1_33 ? (var_1_22 == ((unsigned short int) var_1_20)) : (var_1_22 == ((unsigned short int) 2))))) && ((var_1_6 == (- (99.4f * var_1_4))) ? (var_1_25 == ((signed char) (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))))) : (((last_1_var_1_20 ^ last_1_var_1_19) < last_1_var_1_20) ? (var_1_25 == ((signed char) var_1_27)) : (var_1_25 == ((signed char) var_1_26)))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L202] EXPR (((((((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100)))) && ((var_1_20 < var_1_20) ? (var_1_22 == ((unsigned short int) ((((((var_1_16 + 16) + (var_1_23 - var_1_21))) < (var_1_20)) ? (((var_1_16 + 16) + (var_1_23 - var_1_21))) : (var_1_20))))) : (var_1_33 ? (var_1_22 == ((unsigned short int) var_1_20)) : (var_1_22 == ((unsigned short int) 2))))) && ((var_1_6 == (- (99.4f * var_1_4))) ? (var_1_25 == ((signed char) (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))))) : (((last_1_var_1_20 ^ last_1_var_1_19) < last_1_var_1_20) ? (var_1_25 == ((signed char) var_1_27)) : (var_1_25 == ((signed char) var_1_26))))) && ((var_1_18 >= var_1_16) ? (((- var_1_6) <= var_1_4) ? (var_1_29 == ((double) ((((var_1_5) > ((var_1_6 - var_1_4))) ? (var_1_5) : ((var_1_6 - var_1_4)))))) : (var_1_29 == ((double) (1.0000000000002E12 + ((((((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) > (var_1_32)) ? (((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) : (var_1_32))))))) : (var_1_29 == ((double) var_1_6)))) && (((var_1_20 ^ var_1_23) > var_1_13) ? ((! (var_1_18 == (var_1_20 + var_1_7))) ? (var_1_33 == ((unsigned char) var_1_34)) : 1) : (var_1_2 ? (var_1_33 == ((unsigned char) 0)) : (var_1_33 == ((unsigned char) var_1_34)))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L202-L203] return ((((((((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100)))) && ((var_1_20 < var_1_20) ? (var_1_22 == ((unsigned short int) ((((((var_1_16 + 16) + (var_1_23 - var_1_21))) < (var_1_20)) ? (((var_1_16 + 16) + (var_1_23 - var_1_21))) : (var_1_20))))) : (var_1_33 ? (var_1_22 == ((unsigned short int) var_1_20)) : (var_1_22 == ((unsigned short int) 2))))) && ((var_1_6 == (- (99.4f * var_1_4))) ? (var_1_25 == ((signed char) (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))))) : (((last_1_var_1_20 ^ last_1_var_1_19) < last_1_var_1_20) ? (var_1_25 == ((signed char) var_1_27)) : (var_1_25 == ((signed char) var_1_26))))) && ((var_1_18 >= var_1_16) ? (((- var_1_6) <= var_1_4) ? (var_1_29 == ((double) ((((var_1_5) > ((var_1_6 - var_1_4))) ? (var_1_5) : ((var_1_6 - var_1_4)))))) : (var_1_29 == ((double) (1.0000000000002E12 + ((((((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) > (var_1_32)) ? (((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) : (var_1_32))))))) : (var_1_29 == ((double) var_1_6)))) && (((var_1_20 ^ var_1_23) > var_1_13) ? ((! (var_1_18 == (var_1_20 + var_1_7))) ? (var_1_33 == ((unsigned char) var_1_34)) : 1) : (var_1_2 ? (var_1_33 == ((unsigned char) 0)) : (var_1_33 == ((unsigned char) var_1_34))))) && (var_1_35 == ((unsigned short int) var_1_7)) ; [L213] RET, EXPR property() [L213] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 135 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 11, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2132 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2129 mSDsluCounter, 4684 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2335 mSDsCounter, 265 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1098 IncrementalHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 265 mSolverCounterUnsat, 2349 mSDtfsCounter, 1098 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1034 GetRequests, 1000 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1623occurred in iteration=10, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 1077 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2530 NumberOfCodeBlocks, 2530 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2315 ConstructedInterpolants, 0 QuantifiedInterpolants, 3466 SizeOfPredicates, 0 NumberOfNonLiveVariables, 450 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 18024/18144 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-24 09:04:42,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-36.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 161bb7a2aeb8f0e9fdffca01ff4293552e60c655d94a257edfbbb7105096b1f1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:04:44,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:04:44,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:04:44,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:04:44,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:04:44,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:04:44,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:04:44,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:04:44,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:04:44,513 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:04:44,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:04:44,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:04:44,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:04:44,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:04:44,514 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:04:44,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:04:44,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:04:44,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:04:44,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:04:44,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:04:44,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:04:44,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:04:44,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:04:44,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:04:44,516 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:04:44,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:04:44,517 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:04:44,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:04:44,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:04:44,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:04:44,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:04:44,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:04:44,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:04:44,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:04:44,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:04:44,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:04:44,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:04:44,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:04:44,519 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:04:44,519 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:04:44,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:04:44,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:04:44,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:04:44,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:04:44,522 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:04:44,522 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 161bb7a2aeb8f0e9fdffca01ff4293552e60c655d94a257edfbbb7105096b1f1 [2024-10-24 09:04:44,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:04:44,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:04:44,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:04:44,816 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:04:44,818 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:04:44,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-36.i [2024-10-24 09:04:46,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:04:46,362 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:04:46,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-36.i [2024-10-24 09:04:46,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe8bd89f/214be68560d14fea9ffe560948b424d7/FLAG152698259 [2024-10-24 09:04:46,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe8bd89f/214be68560d14fea9ffe560948b424d7 [2024-10-24 09:04:46,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:04:46,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:04:46,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:04:46,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:04:46,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:04:46,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:04:46" (1/1) ... [2024-10-24 09:04:46,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e2795a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:46, skipping insertion in model container [2024-10-24 09:04:46,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:04:46" (1/1) ... [2024-10-24 09:04:46,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:04:46,956 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-1loop_file-36.i[916,929] [2024-10-24 09:04:47,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:04:47,057 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:04:47,070 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-1loop_file-36.i[916,929] [2024-10-24 09:04:47,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:04:47,136 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:04:47,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:47 WrapperNode [2024-10-24 09:04:47,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:04:47,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:04:47,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:04:47,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:04:47,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:47" (1/1) ... [2024-10-24 09:04:47,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:47" (1/1) ... [2024-10-24 09:04:47,196 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-10-24 09:04:47,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:04:47,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:04:47,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:04:47,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:04:47,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:47" (1/1) ... [2024-10-24 09:04:47,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:47" (1/1) ... [2024-10-24 09:04:47,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:47" (1/1) ... [2024-10-24 09:04:47,240 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-24 09:04:47,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:47" (1/1) ... [2024-10-24 09:04:47,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:47" (1/1) ... [2024-10-24 09:04:47,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:47" (1/1) ... [2024-10-24 09:04:47,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:47" (1/1) ... [2024-10-24 09:04:47,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:47" (1/1) ... [2024-10-24 09:04:47,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:47" (1/1) ... [2024-10-24 09:04:47,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:04:47,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:04:47,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:04:47,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:04:47,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:47" (1/1) ... [2024-10-24 09:04:47,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:04:47,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:04:47,320 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:04:47,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:04:47,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:04:47,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:04:47,374 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:04:47,374 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:04:47,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:04:47,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:04:47,473 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:04:47,475 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:04:52,580 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-24 09:04:52,580 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:04:52,628 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:04:52,629 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:04:52,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:04:52 BoogieIcfgContainer [2024-10-24 09:04:52,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:04:52,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:04:52,631 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:04:52,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:04:52,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:04:46" (1/3) ... [2024-10-24 09:04:52,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f0ca513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:04:52, skipping insertion in model container [2024-10-24 09:04:52,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:04:47" (2/3) ... [2024-10-24 09:04:52,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f0ca513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:04:52, skipping insertion in model container [2024-10-24 09:04:52,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:04:52" (3/3) ... [2024-10-24 09:04:52,640 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-36.i [2024-10-24 09:04:52,655 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:04:52,655 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:04:52,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:04:52,724 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;@74a2f85c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:04:52,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:04:52,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 09:04:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 09:04:52,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:04:52,756 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:04:52,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:04:52,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:04:52,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1745475884, now seen corresponding path program 1 times [2024-10-24 09:04:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:04:52,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304797552] [2024-10-24 09:04:52,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:04:52,770 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-24 09:04:52,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:04:52,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:04:52,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 09:04:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:53,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:04:53,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:04:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-10-24 09:04:53,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:04:53,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:04:53,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304797552] [2024-10-24 09:04:53,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304797552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:04:53,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:04:53,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:04:53,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856987869] [2024-10-24 09:04:53,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:04:53,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:04:53,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:04:53,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:04:53,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:04:53,203 INFO L87 Difference]: Start difference. First operand has 85 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 09:04:56,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:04:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:04:56,420 INFO L93 Difference]: Finished difference Result 169 states and 299 transitions. [2024-10-24 09:04:56,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:04:56,424 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 179 [2024-10-24 09:04:56,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:04:56,432 INFO L225 Difference]: With dead ends: 169 [2024-10-24 09:04:56,432 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 09:04:56,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 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-24 09:04:56,438 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:04:56,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-24 09:04:56,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 09:04:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-24 09:04:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 09:04:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 131 transitions. [2024-10-24 09:04:56,476 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 131 transitions. Word has length 179 [2024-10-24 09:04:56,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:04:56,477 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 131 transitions. [2024-10-24 09:04:56,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 09:04:56,477 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 131 transitions. [2024-10-24 09:04:56,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 09:04:56,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:04:56,480 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:04:56,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 09:04:56,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:04:56,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:04:56,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:04:56,682 INFO L85 PathProgramCache]: Analyzing trace with hash -57022044, now seen corresponding path program 1 times [2024-10-24 09:04:56,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:04:56,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609238168] [2024-10-24 09:04:56,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:04:56,683 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-24 09:04:56,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:04:56,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:04:56,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 09:04:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:04:57,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 09:04:57,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:04:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 788 proven. 84 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-10-24 09:04:58,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:04:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-24 09:04:59,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:04:59,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609238168] [2024-10-24 09:04:59,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609238168] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:04:59,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:04:59,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2024-10-24 09:04:59,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429432207] [2024-10-24 09:04:59,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:04:59,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 09:04:59,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:04:59,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 09:04:59,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-10-24 09:04:59,576 INFO L87 Difference]: Start difference. First operand 83 states and 131 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-10-24 09:05:05,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:05:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:05:06,910 INFO L93 Difference]: Finished difference Result 258 states and 389 transitions. [2024-10-24 09:05:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 09:05:06,914 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) Word has length 179 [2024-10-24 09:05:06,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:05:06,916 INFO L225 Difference]: With dead ends: 258 [2024-10-24 09:05:06,916 INFO L226 Difference]: Without dead ends: 176 [2024-10-24 09:05:06,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2024-10-24 09:05:06,919 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 248 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 83 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-10-24 09:05:06,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 396 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 430 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2024-10-24 09:05:06,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-24 09:05:06,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 128. [2024-10-24 09:05:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 84 states have internal predecessors, (111), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 09:05:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2024-10-24 09:05:06,948 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 179 [2024-10-24 09:05:06,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:05:06,949 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2024-10-24 09:05:06,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-10-24 09:05:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2024-10-24 09:05:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 09:05:06,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:05:06,952 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:05:06,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 09:05:07,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:05:07,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:05:07,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:05:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash 644042534, now seen corresponding path program 1 times [2024-10-24 09:05:07,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:05:07,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806690358] [2024-10-24 09:05:07,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:05:07,164 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-24 09:05:07,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:05:07,166 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:05:07,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 09:05:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:05:07,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 09:05:07,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:05:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 09:05:07,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:05:07,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:05:07,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806690358] [2024-10-24 09:05:07,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806690358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:05:07,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:05:07,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:05:07,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846754537] [2024-10-24 09:05:07,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:05:07,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:05:07,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:05:07,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:05:07,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:05:07,825 INFO L87 Difference]: Start difference. First operand 128 states and 191 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:05:12,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:05:14,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:05:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:05:15,422 INFO L93 Difference]: Finished difference Result 382 states and 571 transitions. [2024-10-24 09:05:15,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:05:15,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2024-10-24 09:05:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:05:15,427 INFO L225 Difference]: With dead ends: 382 [2024-10-24 09:05:15,427 INFO L226 Difference]: Without dead ends: 255 [2024-10-24 09:05:15,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:05:15,429 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 112 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-10-24 09:05:15,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 372 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2024-10-24 09:05:15,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-24 09:05:15,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2024-10-24 09:05:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 163 states have (on average 1.3251533742331287) internal successors, (216), 165 states have internal predecessors, (216), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 09:05:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2024-10-24 09:05:15,467 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 179 [2024-10-24 09:05:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:05:15,468 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2024-10-24 09:05:15,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:05:15,468 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2024-10-24 09:05:15,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-24 09:05:15,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:05:15,470 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:05:15,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 09:05:15,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:05:15,671 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:05:15,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:05:15,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1510475910, now seen corresponding path program 1 times [2024-10-24 09:05:15,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:05:15,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492412219] [2024-10-24 09:05:15,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:05:15,673 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-24 09:05:15,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:05:15,676 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:05:15,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 09:05:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:05:15,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 09:05:15,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:05:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-24 09:05:16,299 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:05:16,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:05:16,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492412219] [2024-10-24 09:05:16,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492412219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:05:16,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:05:16,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 09:05:16,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249913458] [2024-10-24 09:05:16,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:05:16,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:05:16,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:05:16,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:05:16,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:05:16,302 INFO L87 Difference]: Start difference. First operand 252 states and 376 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:05:21,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:05:23,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:05:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:05:23,756 INFO L93 Difference]: Finished difference Result 519 states and 761 transitions. [2024-10-24 09:05:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 09:05:23,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-10-24 09:05:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:05:23,765 INFO L225 Difference]: With dead ends: 519 [2024-10-24 09:05:23,765 INFO L226 Difference]: Without dead ends: 268 [2024-10-24 09:05:23,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-24 09:05:23,767 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 129 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 115 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:05:23,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 208 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2024-10-24 09:05:23,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-24 09:05:23,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 256. [2024-10-24 09:05:23,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 165 states have (on average 1.2484848484848485) internal successors, (206), 167 states have internal predecessors, (206), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 09:05:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 366 transitions. [2024-10-24 09:05:23,816 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 366 transitions. Word has length 180 [2024-10-24 09:05:23,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:05:23,817 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 366 transitions. [2024-10-24 09:05:23,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 09:05:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 366 transitions. [2024-10-24 09:05:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-24 09:05:23,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:05:23,820 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:05:23,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 09:05:24,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:05:24,021 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:05:24,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:05:24,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1510416328, now seen corresponding path program 1 times [2024-10-24 09:05:24,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:05:24,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791228174] [2024-10-24 09:05:24,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:05:24,022 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-24 09:05:24,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:05:24,027 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:05:24,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 09:05:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:05:24,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 09:05:24,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:05:31,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 352 proven. 141 refuted. 0 times theorem prover too weak. 1019 trivial. 0 not checked. [2024-10-24 09:05:31,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:05:40,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:05:40,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791228174] [2024-10-24 09:05:40,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791228174] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:05:40,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1742122570] [2024-10-24 09:05:40,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:05:40,380 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 09:05:40,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 09:05:40,383 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 09:05:40,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-24 09:05:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:05:41,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 09:05:41,536 INFO L278 TraceCheckSpWp]: Computing forward predicates...