./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_fillercode_fillercodestructure_filler-pe-ci_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 023b86f35045f9045adc9b783e35a535a0b6bf77ce996c404b36b9732a6bc24a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:51:49,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:51:49,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:51:49,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:51:49,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:51:49,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:51:49,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:51:49,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:51:49,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:51:49,674 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:51:49,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:51:49,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:51:49,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:51:49,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:51:49,677 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:51:49,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:51:49,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:51:49,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:51:49,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:51:49,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:51:49,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:51:49,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:51:49,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:51:49,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:51:49,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:51:49,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:51:49,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:51:49,682 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:51:49,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:51:49,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:51:49,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:51:49,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:51:49,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:51:49,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:51:49,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:51:49,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:51:49,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:51:49,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:51:49,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:51:49,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:51:49,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:51:49,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:51:49,686 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 023b86f35045f9045adc9b783e35a535a0b6bf77ce996c404b36b9732a6bc24a [2024-10-11 08:51:49,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:51:49,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:51:49,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:51:49,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:51:49,956 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:51:49,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i [2024-10-11 08:51:51,213 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:51:51,381 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:51:51,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i [2024-10-11 08:51:51,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/96ae454f3/f1455a432935472d895887cac6f53ecb/FLAGb41533a20 [2024-10-11 08:51:51,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/96ae454f3/f1455a432935472d895887cac6f53ecb [2024-10-11 08:51:51,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:51:51,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:51:51,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:51:51,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:51:51,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:51:51,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:51:51" (1/1) ... [2024-10-11 08:51:51,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71ae1910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:51:51, skipping insertion in model container [2024-10-11 08:51:51,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:51:51" (1/1) ... [2024-10-11 08:51:51,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:51:51,947 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_fillercode_fillercodestructure_filler-pe-ci_file-0.i[918,931] [2024-10-11 08:51:52,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:51:52,021 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:51:52,039 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_fillercode_fillercodestructure_filler-pe-ci_file-0.i[918,931] [2024-10-11 08:51:52,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:51:52,102 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:51:52,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:51:52 WrapperNode [2024-10-11 08:51:52,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:51:52,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:51:52,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:51:52,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:51:52,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:51:52" (1/1) ... [2024-10-11 08:51:52,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:51:52" (1/1) ... [2024-10-11 08:51:52,142 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-10-11 08:51:52,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:51:52,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:51:52,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:51:52,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:51:52,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:51:52" (1/1) ... [2024-10-11 08:51:52,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:51:52" (1/1) ... [2024-10-11 08:51:52,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:51:52" (1/1) ... [2024-10-11 08:51:52,172 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 08:51:52,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:51:52" (1/1) ... [2024-10-11 08:51:52,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:51:52" (1/1) ... [2024-10-11 08:51:52,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:51:52" (1/1) ... [2024-10-11 08:51:52,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:51:52" (1/1) ... [2024-10-11 08:51:52,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:51:52" (1/1) ... [2024-10-11 08:51:52,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:51:52" (1/1) ... [2024-10-11 08:51:52,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:51:52,198 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:51:52,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:51:52,198 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:51:52,199 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:51:52" (1/1) ... [2024-10-11 08:51:52,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:51:52,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:51:52,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:51:52,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:51:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:51:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:51:52,286 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:51:52,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:51:52,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:51:52,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:51:52,393 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:51:52,394 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:51:52,691 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 08:51:52,691 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:51:52,722 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:51:52,722 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:51:52,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:51:52 BoogieIcfgContainer [2024-10-11 08:51:52,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:51:52,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:51:52,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:51:52,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:51:52,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:51:51" (1/3) ... [2024-10-11 08:51:52,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292c673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:51:52, skipping insertion in model container [2024-10-11 08:51:52,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:51:52" (2/3) ... [2024-10-11 08:51:52,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292c673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:51:52, skipping insertion in model container [2024-10-11 08:51:52,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:51:52" (3/3) ... [2024-10-11 08:51:52,730 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i [2024-10-11 08:51:52,742 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:51:52,742 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:51:52,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:51:52,798 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;@18dfdc14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:51:52,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:51:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 59 states have internal predecessors, (86), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 08:51:52,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-11 08:51:52,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:51:52,812 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:51:52,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:51:52,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:51:52,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1270975429, now seen corresponding path program 1 times [2024-10-11 08:51:52,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:51:52,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612475989] [2024-10-11 08:51:52,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:51:52,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:51:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:51:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:51:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:51:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:51:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:51:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:51:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:51:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:51:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:51:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:51:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:51:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:51:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:51:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:51:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 08:51:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:51:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 08:51:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:51:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 08:51:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:51:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:51:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:51:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:51:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:51:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:51:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:51:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:51:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:51:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 08:51:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:51:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 08:51:53,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:51:53,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612475989] [2024-10-11 08:51:53,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612475989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:51:53,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:51:53,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:51:53,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507572001] [2024-10-11 08:51:53,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:51:53,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:51:53,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:51:53,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:51:53,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:51:53,286 INFO L87 Difference]: Start difference. First operand has 91 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 59 states have internal predecessors, (86), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 08:51:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:51:53,336 INFO L93 Difference]: Finished difference Result 179 states and 320 transitions. [2024-10-11 08:51:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:51:53,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 194 [2024-10-11 08:51:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:51:53,347 INFO L225 Difference]: With dead ends: 179 [2024-10-11 08:51:53,347 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 08:51:53,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:51:53,355 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:51:53,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:51:53,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 08:51:53,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 08:51:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 08:51:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 140 transitions. [2024-10-11 08:51:53,417 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 140 transitions. Word has length 194 [2024-10-11 08:51:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:51:53,418 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 140 transitions. [2024-10-11 08:51:53,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 08:51:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 140 transitions. [2024-10-11 08:51:53,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-11 08:51:53,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:51:53,423 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:51:53,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:51:53,423 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:51:53,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:51:53,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1165043783, now seen corresponding path program 1 times [2024-10-11 08:51:53,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:51:53,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379294357] [2024-10-11 08:51:53,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:51:53,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:51:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:51:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:51:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:51:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:51:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:51:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:51:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:51:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:51:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:51:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:51:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:51:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:51:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:51:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:53,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:51:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 08:51:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:51:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 08:51:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:51:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 08:51:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:51:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:51:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:51:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:51:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:51:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:51:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:51:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:51:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:51:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 08:51:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:51:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 08:51:54,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:51:54,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379294357] [2024-10-11 08:51:54,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379294357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:51:54,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:51:54,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 08:51:54,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752107674] [2024-10-11 08:51:54,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:51:54,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 08:51:54,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:51:54,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 08:51:54,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 08:51:54,086 INFO L87 Difference]: Start difference. First operand 89 states and 140 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 08:51:54,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:51:54,449 INFO L93 Difference]: Finished difference Result 355 states and 560 transitions. [2024-10-11 08:51:54,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 08:51:54,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2024-10-11 08:51:54,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:51:54,456 INFO L225 Difference]: With dead ends: 355 [2024-10-11 08:51:54,457 INFO L226 Difference]: Without dead ends: 267 [2024-10-11 08:51:54,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 08:51:54,459 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 256 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:51:54,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 630 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:51:54,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-11 08:51:54,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 167. [2024-10-11 08:51:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 08:51:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 266 transitions. [2024-10-11 08:51:54,508 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 266 transitions. Word has length 194 [2024-10-11 08:51:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:51:54,509 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 266 transitions. [2024-10-11 08:51:54,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 08:51:54,510 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 266 transitions. [2024-10-11 08:51:54,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-11 08:51:54,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:51:54,514 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:51:54,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:51:54,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:51:54,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:51:54,515 INFO L85 PathProgramCache]: Analyzing trace with hash -609963579, now seen corresponding path program 1 times [2024-10-11 08:51:54,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:51:54,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096911231] [2024-10-11 08:51:54,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:51:54,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:51:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:51:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:51:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:51:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:51:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:51:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:51:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:51:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:51:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:51:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:51:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:54,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:51:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:51:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:51:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:51:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 08:51:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:51:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 08:51:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:51:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 08:51:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:51:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:51:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:51:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:51:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:51:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:51:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:51:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:51:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:51:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 08:51:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:51:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 08:51:55,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:51:55,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096911231] [2024-10-11 08:51:55,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096911231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:51:55,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:51:55,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:51:55,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447413376] [2024-10-11 08:51:55,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:51:55,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:51:55,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:51:55,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:51:55,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:51:55,096 INFO L87 Difference]: Start difference. First operand 167 states and 266 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 08:51:55,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:51:55,284 INFO L93 Difference]: Finished difference Result 417 states and 667 transitions. [2024-10-11 08:51:55,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:51:55,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2024-10-11 08:51:55,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:51:55,291 INFO L225 Difference]: With dead ends: 417 [2024-10-11 08:51:55,291 INFO L226 Difference]: Without dead ends: 304 [2024-10-11 08:51:55,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:51:55,292 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 144 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:51:55,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 431 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:51:55,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-11 08:51:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 272. [2024-10-11 08:51:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 178 states have (on average 1.4325842696629214) internal successors, (255), 178 states have internal predecessors, (255), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-11 08:51:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 435 transitions. [2024-10-11 08:51:55,348 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 435 transitions. Word has length 194 [2024-10-11 08:51:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:51:55,348 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 435 transitions. [2024-10-11 08:51:55,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 08:51:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 435 transitions. [2024-10-11 08:51:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-11 08:51:55,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:51:55,354 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:51:55,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:51:55,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:51:55,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:51:55,355 INFO L85 PathProgramCache]: Analyzing trace with hash -469414969, now seen corresponding path program 1 times [2024-10-11 08:51:55,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:51:55,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362608046] [2024-10-11 08:51:55,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:51:55,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:51:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:51:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:51:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:51:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:51:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:51:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:51:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:51:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:51:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:51:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:51:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:51:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:51:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:51:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:51:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 08:51:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:51:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 08:51:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:51:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 08:51:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:51:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:51:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:51:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:51:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:51:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:51:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:51:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:51:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:51:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 08:51:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:51:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 08:51:55,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:51:55,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362608046] [2024-10-11 08:51:55,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362608046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:51:55,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:51:55,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 08:51:55,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518454798] [2024-10-11 08:51:55,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:51:55,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 08:51:55,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:51:55,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 08:51:55,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 08:51:55,987 INFO L87 Difference]: Start difference. First operand 272 states and 435 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 08:51:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:51:56,243 INFO L93 Difference]: Finished difference Result 648 states and 1036 transitions. [2024-10-11 08:51:56,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:51:56,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2024-10-11 08:51:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:51:56,252 INFO L225 Difference]: With dead ends: 648 [2024-10-11 08:51:56,252 INFO L226 Difference]: Without dead ends: 466 [2024-10-11 08:51:56,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 08:51:56,255 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 243 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:51:56,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 516 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:51:56,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-10-11 08:51:56,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 406. [2024-10-11 08:51:56,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 281 states have (on average 1.4626334519572954) internal successors, (411), 281 states have internal predecessors, (411), 120 states have call successors, (120), 4 states have call predecessors, (120), 4 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-11 08:51:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 651 transitions. [2024-10-11 08:51:56,300 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 651 transitions. Word has length 194 [2024-10-11 08:51:56,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:51:56,301 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 651 transitions. [2024-10-11 08:51:56,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 08:51:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 651 transitions. [2024-10-11 08:51:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-11 08:51:56,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:51:56,304 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:51:56,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 08:51:56,304 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:51:56,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:51:56,305 INFO L85 PathProgramCache]: Analyzing trace with hash -469355387, now seen corresponding path program 1 times [2024-10-11 08:51:56,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:51:56,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639464064] [2024-10-11 08:51:56,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:51:56,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:51:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:51:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:51:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:51:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:51:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:51:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:51:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:51:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:51:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:51:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:51:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:51:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:51:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:51:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:51:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 08:51:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:51:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 08:51:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:51:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 08:51:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:51:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:51:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:51:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:51:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:51:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:51:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:51:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:51:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:51:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 08:51:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:51:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 6 proven. 81 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-11 08:51:56,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:51:56,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639464064] [2024-10-11 08:51:56,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639464064] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:51:56,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392180182] [2024-10-11 08:51:56,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:51:56,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:51:56,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:51:56,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:51:56,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 08:51:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:56,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 08:51:56,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:51:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 249 proven. 81 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-10-11 08:51:56,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:51:57,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 6 proven. 81 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-11 08:51:57,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392180182] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:51:57,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:51:57,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 08:51:57,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66094882] [2024-10-11 08:51:57,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:51:57,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 08:51:57,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:51:57,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 08:51:57,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:51:57,242 INFO L87 Difference]: Start difference. First operand 406 states and 651 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2024-10-11 08:51:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:51:57,483 INFO L93 Difference]: Finished difference Result 750 states and 1182 transitions. [2024-10-11 08:51:57,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 08:51:57,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) Word has length 194 [2024-10-11 08:51:57,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:51:57,487 INFO L225 Difference]: With dead ends: 750 [2024-10-11 08:51:57,487 INFO L226 Difference]: Without dead ends: 432 [2024-10-11 08:51:57,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 443 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 08:51:57,488 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 46 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:51:57,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 235 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:51:57,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-11 08:51:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 422. [2024-10-11 08:51:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 293 states have (on average 1.372013651877133) internal successors, (402), 293 states have internal predecessors, (402), 120 states have call successors, (120), 8 states have call predecessors, (120), 8 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-11 08:51:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 642 transitions. [2024-10-11 08:51:57,535 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 642 transitions. Word has length 194 [2024-10-11 08:51:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:51:57,535 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 642 transitions. [2024-10-11 08:51:57,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2024-10-11 08:51:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 642 transitions. [2024-10-11 08:51:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-11 08:51:57,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:51:57,537 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:51:57,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 08:51:57,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:51:57,738 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:51:57,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:51:57,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1158265755, now seen corresponding path program 1 times [2024-10-11 08:51:57,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:51:57,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147328250] [2024-10-11 08:51:57,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:51:57,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:51:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:51:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:51:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:51:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:51:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:51:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:51:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:51:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:51:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:51:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:51:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:51:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:51:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:51:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:51:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 08:51:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:51:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 08:51:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:51:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 08:51:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:51:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:51:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:51:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:51:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:51:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:51:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:51:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:51:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:51:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 08:51:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:51:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 08:51:57,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:51:57,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147328250] [2024-10-11 08:51:57,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147328250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:51:57,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:51:57,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:51:57,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273233676] [2024-10-11 08:51:57,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:51:57,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:51:57,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:51:57,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:51:57,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:51:57,906 INFO L87 Difference]: Start difference. First operand 422 states and 642 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 08:51:58,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:51:58,102 INFO L93 Difference]: Finished difference Result 1125 states and 1705 transitions. [2024-10-11 08:51:58,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:51:58,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 195 [2024-10-11 08:51:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:51:58,106 INFO L225 Difference]: With dead ends: 1125 [2024-10-11 08:51:58,106 INFO L226 Difference]: Without dead ends: 795 [2024-10-11 08:51:58,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:51:58,108 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 106 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:51:58,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 304 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:51:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2024-10-11 08:51:58,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2024-10-11 08:51:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 565 states have (on average 1.3575221238938053) internal successors, (767), 565 states have internal predecessors, (767), 210 states have call successors, (210), 17 states have call predecessors, (210), 17 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-10-11 08:51:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1187 transitions. [2024-10-11 08:51:58,169 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1187 transitions. Word has length 195 [2024-10-11 08:51:58,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:51:58,169 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1187 transitions. [2024-10-11 08:51:58,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 08:51:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1187 transitions. [2024-10-11 08:51:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-11 08:51:58,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:51:58,171 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:51:58,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 08:51:58,172 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:51:58,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:51:58,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1331263207, now seen corresponding path program 1 times [2024-10-11 08:51:58,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:51:58,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51770376] [2024-10-11 08:51:58,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:51:58,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:51:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:51:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:51:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:51:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:51:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:51:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:51:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:51:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:51:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:51:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:51:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:51:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:51:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:51:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:51:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 08:51:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:51:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 08:51:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:51:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 08:51:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:51:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:51:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:51:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:51:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:51:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:51:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:51:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:51:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:51:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 08:51:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:51:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 08:51:58,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:51:58,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51770376] [2024-10-11 08:51:58,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51770376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:51:58,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:51:58,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:51:58,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914857003] [2024-10-11 08:51:58,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:51:58,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:51:58,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:51:58,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:51:58,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:51:58,417 INFO L87 Difference]: Start difference. First operand 793 states and 1187 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 08:51:58,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:51:58,632 INFO L93 Difference]: Finished difference Result 1185 states and 1773 transitions. [2024-10-11 08:51:58,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:51:58,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 195 [2024-10-11 08:51:58,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:51:58,637 INFO L225 Difference]: With dead ends: 1185 [2024-10-11 08:51:58,637 INFO L226 Difference]: Without dead ends: 824 [2024-10-11 08:51:58,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:51:58,639 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 73 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:51:58,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 444 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:51:58,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-10-11 08:51:58,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 738. [2024-10-11 08:51:58,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 510 states have (on average 1.3313725490196078) internal successors, (679), 510 states have internal predecessors, (679), 210 states have call successors, (210), 17 states have call predecessors, (210), 17 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-10-11 08:51:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1099 transitions. [2024-10-11 08:51:58,704 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1099 transitions. Word has length 195 [2024-10-11 08:51:58,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:51:58,705 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1099 transitions. [2024-10-11 08:51:58,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 08:51:58,705 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1099 transitions. [2024-10-11 08:51:58,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-11 08:51:58,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:51:58,706 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:51:58,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 08:51:58,707 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:51:58,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:51:58,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1964049264, now seen corresponding path program 1 times [2024-10-11 08:51:58,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:51:58,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151923053] [2024-10-11 08:51:58,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:51:58,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:51:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:51:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:51:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:51:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:51:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:51:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:51:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:51:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:51:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:51:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:51:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:51:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:51:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:51:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:51:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 08:51:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:51:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 08:51:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:51:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 08:51:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:51:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:51:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:51:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:51:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:51:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:51:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:51:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:51:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:51:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 08:51:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:51:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 33 proven. 54 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-11 08:51:58,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:51:58,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151923053] [2024-10-11 08:51:58,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151923053] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:51:58,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533265583] [2024-10-11 08:51:58,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:51:58,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:51:58,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:51:58,934 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:51:58,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 08:51:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:51:59,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 08:51:59,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:51:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 843 proven. 54 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2024-10-11 08:51:59,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:51:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 33 proven. 54 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-11 08:51:59,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533265583] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:51:59,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:51:59,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 08:51:59,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42967959] [2024-10-11 08:51:59,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:51:59,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 08:51:59,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:51:59,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 08:51:59,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:51:59,450 INFO L87 Difference]: Start difference. First operand 738 states and 1099 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-10-11 08:51:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:51:59,729 INFO L93 Difference]: Finished difference Result 1452 states and 2124 transitions. [2024-10-11 08:51:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 08:51:59,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 196 [2024-10-11 08:51:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:51:59,734 INFO L225 Difference]: With dead ends: 1452 [2024-10-11 08:51:59,735 INFO L226 Difference]: Without dead ends: 799 [2024-10-11 08:51:59,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 447 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 08:51:59,737 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 92 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:51:59,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 206 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:51:59,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-11 08:51:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 707. [2024-10-11 08:51:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 472 states have (on average 1.2690677966101696) internal successors, (599), 472 states have internal predecessors, (599), 210 states have call successors, (210), 24 states have call predecessors, (210), 24 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-10-11 08:51:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1019 transitions. [2024-10-11 08:51:59,841 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1019 transitions. Word has length 196 [2024-10-11 08:51:59,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:51:59,842 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1019 transitions. [2024-10-11 08:51:59,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-10-11 08:51:59,843 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1019 transitions. [2024-10-11 08:51:59,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 08:51:59,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:51:59,844 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:51:59,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 08:52:00,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:52:00,046 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:00,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:00,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1385651729, now seen corresponding path program 1 times [2024-10-11 08:52:00,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:00,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105162060] [2024-10-11 08:52:00,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:00,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:52:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:52:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:52:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:52:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:52:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:52:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:52:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:52:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:52:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:52:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:52:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:52:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:52:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:52:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 08:52:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:52:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 08:52:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:52:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 08:52:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:52:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:52:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:52:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:52:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:52:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:52:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:52:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:52:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:52:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 08:52:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:52:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 08:52:00,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:52:00,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105162060] [2024-10-11 08:52:00,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105162060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:00,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:00,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:52:00,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839995650] [2024-10-11 08:52:00,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:00,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:52:00,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:52:00,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:52:00,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:52:00,205 INFO L87 Difference]: Start difference. First operand 707 states and 1019 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 08:52:00,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:52:00,328 INFO L93 Difference]: Finished difference Result 1363 states and 1964 transitions. [2024-10-11 08:52:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:52:00,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2024-10-11 08:52:00,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:52:00,333 INFO L225 Difference]: With dead ends: 1363 [2024-10-11 08:52:00,333 INFO L226 Difference]: Without dead ends: 707 [2024-10-11 08:52:00,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:52:00,337 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 75 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:52:00,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 343 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:52:00,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-10-11 08:52:00,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 705. [2024-10-11 08:52:00,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 470 states have (on average 1.2617021276595746) internal successors, (593), 470 states have internal predecessors, (593), 210 states have call successors, (210), 24 states have call predecessors, (210), 24 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-10-11 08:52:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1013 transitions. [2024-10-11 08:52:00,435 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1013 transitions. Word has length 198 [2024-10-11 08:52:00,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:52:00,435 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1013 transitions. [2024-10-11 08:52:00,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 08:52:00,435 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1013 transitions. [2024-10-11 08:52:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-11 08:52:00,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:00,437 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:00,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 08:52:00,437 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:00,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:00,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1838784846, now seen corresponding path program 1 times [2024-10-11 08:52:00,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:52:00,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136691414] [2024-10-11 08:52:00,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:00,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:52:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:52:00,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [329966754] [2024-10-11 08:52:00,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:00,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:52:00,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:52:00,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:52:00,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 08:52:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:52:00,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:52:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:52:00,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:52:00,800 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:52:00,801 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:52:00,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 08:52:01,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:52:01,006 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:01,117 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:52:01,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:52:01 BoogieIcfgContainer [2024-10-11 08:52:01,119 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:52:01,120 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:52:01,120 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:52:01,120 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:52:01,120 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:51:52" (3/4) ... [2024-10-11 08:52:01,121 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:52:01,122 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:52:01,122 INFO L158 Benchmark]: Toolchain (without parser) took 9342.88ms. Allocated memory was 167.8MB in the beginning and 408.9MB in the end (delta: 241.2MB). Free memory was 89.4MB in the beginning and 238.6MB in the end (delta: -149.2MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. [2024-10-11 08:52:01,123 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory was 136.5MB in the beginning and 136.3MB in the end (delta: 260.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:52:01,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.43ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 136.6MB in the end (delta: -47.4MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-10-11 08:52:01,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.72ms. Allocated memory is still 167.8MB. Free memory was 136.6MB in the beginning and 132.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:52:01,123 INFO L158 Benchmark]: Boogie Preprocessor took 54.22ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 128.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:52:01,124 INFO L158 Benchmark]: RCFGBuilder took 524.65ms. Allocated memory is still 167.8MB. Free memory was 128.1MB in the beginning and 111.0MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 08:52:01,124 INFO L158 Benchmark]: TraceAbstraction took 8394.73ms. Allocated memory was 167.8MB in the beginning and 408.9MB in the end (delta: 241.2MB). Free memory was 109.9MB in the beginning and 238.6MB in the end (delta: -128.7MB). Peak memory consumption was 114.3MB. Max. memory is 16.1GB. [2024-10-11 08:52:01,124 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 408.9MB. Free memory is still 238.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:52:01,125 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory was 136.5MB in the beginning and 136.3MB in the end (delta: 260.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.43ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 136.6MB in the end (delta: -47.4MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.72ms. Allocated memory is still 167.8MB. Free memory was 136.6MB in the beginning and 132.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.22ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 128.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 524.65ms. Allocated memory is still 167.8MB. Free memory was 128.1MB in the beginning and 111.0MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8394.73ms. Allocated memory was 167.8MB in the beginning and 408.9MB in the end (delta: 241.2MB). Free memory was 109.9MB in the beginning and 238.6MB in the end (delta: -128.7MB). Peak memory consumption was 114.3MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 408.9MB. Free memory is still 238.6MB. 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 193, overapproximation of someBinaryArithmeticDOUBLEoperation at line 105, overapproximation of someUnaryDOUBLEoperation at line 105, overapproximation of bitwiseAnd at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 193. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 0; [L23] signed long int var_1_5 = 2; [L24] signed short int var_1_6 = -10; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned long int var_1_9 = 3470417420; [L28] unsigned char var_1_10 = 0; [L29] double var_1_12 = 25.6; [L30] double var_1_13 = 1.75; [L31] float var_1_14 = 5.4; [L32] float var_1_15 = 127.5; [L33] float var_1_16 = 3.5; [L34] signed long int var_1_17 = 64; [L35] double var_1_19 = 0.0; [L36] unsigned short int var_1_20 = 10; [L37] double var_1_21 = 4.75; [L38] double var_1_22 = 4.6; [L39] unsigned char var_1_23 = 0; [L40] signed long int var_1_28 = 8; [L41] signed long int var_1_30 = 5; [L42] signed long int var_1_31 = 100; [L43] float var_1_34 = 31.8; [L44] unsigned char var_1_35 = 0; [L45] unsigned char var_1_36 = 0; [L46] unsigned long int var_1_37 = 1; [L47] signed long int var_1_38 = 500; [L48] unsigned long int var_1_39 = 2882328056; [L49] unsigned short int var_1_40 = 5; [L50] unsigned short int var_1_41 = 2; [L51] unsigned short int var_1_42 = 50; [L52] unsigned short int var_1_43 = 4; [L53] unsigned char var_1_44 = 0; [L54] signed long int last_1_var_1_1 = 0; [L55] signed long int last_1_var_1_5 = 2; [L56] signed short int last_1_var_1_6 = -10; [L57] unsigned long int last_1_var_1_7 = 1; [L58] float last_1_var_1_14 = 5.4; [L59] signed long int last_1_var_1_17 = 64; [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L185] last_1_var_1_1 = var_1_1 [L186] last_1_var_1_5 = var_1_5 [L187] last_1_var_1_6 = var_1_6 [L188] last_1_var_1_7 = var_1_7 [L189] last_1_var_1_14 = var_1_14 [L190] last_1_var_1_17 = var_1_17 [L200] RET updateLastVariables() [L201] CALL updateVariables() [L136] var_1_9 = __VERIFIER_nondet_ulong() [L137] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L137] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L138] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L138] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L139] var_1_10 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L140] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L141] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L141] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L142] var_1_12 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L143] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L144] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L144] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L145] var_1_13 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L146] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L147] var_1_15 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L148] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L149] var_1_16 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L150] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L151] var_1_20 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L152] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L153] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L153] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L154] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L154] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L155] var_1_21 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L156] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L157] var_1_22 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L158] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L159] var_1_30 = __VERIFIER_nondet_long() [L160] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L160] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L161] CALL assume_abort_if_not(var_1_30 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L161] RET assume_abort_if_not(var_1_30 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L162] var_1_31 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L163] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L164] CALL assume_abort_if_not(var_1_31 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L164] RET assume_abort_if_not(var_1_31 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L165] var_1_36 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L166] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L167] CALL assume_abort_if_not(var_1_36 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L167] RET assume_abort_if_not(var_1_36 <= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L168] var_1_38 = __VERIFIER_nondet_long() [L169] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L169] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L170] CALL assume_abort_if_not(var_1_38 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L170] RET assume_abort_if_not(var_1_38 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L171] var_1_39 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_39 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L172] RET assume_abort_if_not(var_1_39 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L173] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L173] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L174] var_1_41 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_41 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L175] RET assume_abort_if_not(var_1_41 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L176] CALL assume_abort_if_not(var_1_41 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L176] RET assume_abort_if_not(var_1_41 <= 32767) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L177] var_1_42 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_42 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L178] RET assume_abort_if_not(var_1_42 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L179] CALL assume_abort_if_not(var_1_42 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L179] RET assume_abort_if_not(var_1_42 <= 16384) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L180] var_1_43 = __VERIFIER_nondet_ushort() [L181] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L181] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L182] CALL assume_abort_if_not(var_1_43 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L182] RET assume_abort_if_not(var_1_43 <= 16383) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L201] RET updateVariables() [L202] CALL step() [L63] COND FALSE !(last_1_var_1_7 > (- last_1_var_1_5)) [L66] var_1_1 = (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L68] COND TRUE ((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16))) [L69] var_1_17 = ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L73] signed long int stepLocal_1 = - last_1_var_1_1; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_1=0, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L74] COND FALSE !(last_1_var_1_17 < stepLocal_1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L77] signed long int stepLocal_3 = var_1_1; [L78] signed long int stepLocal_2 = var_1_17; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_2=0, stepLocal_3=0, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L79] COND FALSE !(var_1_17 > stepLocal_2) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L84] unsigned long int stepLocal_5 = var_1_9; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L85] COND FALSE !((var_1_12 * last_1_var_1_14) > var_1_13) [L92] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L94] signed long int stepLocal_0 = var_1_17; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L95] COND TRUE var_1_6 < stepLocal_0 [L96] var_1_5 = ((var_1_17 - var_1_6) + var_1_6) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L98] unsigned long int stepLocal_4 = var_1_9 - var_1_6; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_4=-2147483639, stepLocal_5=-2147483649, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L99] COND TRUE (- 8u) >= stepLocal_4 [L100] var_1_8 = (! var_1_10) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L104] COND TRUE (32 / var_1_20) > -500 [L105] var_1_19 = ((((var_1_21 - var_1_22) < 0 ) ? -(var_1_21 - var_1_22) : (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L107] COND TRUE \read(var_1_10) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L108] COND TRUE var_1_10 && (1 >= var_1_6) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L109] COND TRUE \read(var_1_10) [L110] var_1_23 = var_1_10 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L114] EXPR var_1_20 & var_1_6 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L114] COND TRUE (var_1_20 & var_1_6) >= var_1_1 [L115] var_1_28 = (((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) < 0 ) ? -((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) : ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L121] COND TRUE var_1_31 > var_1_7 [L122] var_1_34 = var_1_22 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_22=4, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L124] EXPR var_1_20 & -100 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_22=4, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L124] COND FALSE !((var_1_20 & -100) <= var_1_17) [L127] COND TRUE (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - (var_1_20 + var_1_38)) <= var_1_17 [L128] var_1_37 = ((((var_1_30) > (((((var_1_38) < ((var_1_39 - var_1_31))) ? (var_1_38) : ((var_1_39 - var_1_31)))))) ? (var_1_30) : (((((var_1_38) < ((var_1_39 - var_1_31))) ? (var_1_38) : ((var_1_39 - var_1_31))))))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_22=4, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L130] var_1_40 = (var_1_41 + (var_1_42 + var_1_43)) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_22=4, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=9, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L131] COND FALSE !(var_1_7 <= var_1_1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-2147483649, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_22=4, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=9, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L202] RET step() [L203] CALL, EXPR property() [L193-L194] return (((((((last_1_var_1_7 > (- last_1_var_1_5)) ? (var_1_1 == ((signed long int) ((((last_1_var_1_5) > ((last_1_var_1_7 + last_1_var_1_6))) ? (last_1_var_1_5) : ((last_1_var_1_7 + last_1_var_1_6)))))) : (var_1_1 == ((signed long int) (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16)))))) && ((var_1_6 < var_1_17) ? (var_1_5 == ((signed long int) ((var_1_17 - var_1_6) + var_1_6))) : 1)) && ((last_1_var_1_17 < (- last_1_var_1_1)) ? (var_1_6 == ((signed short int) (32 - last_1_var_1_6))) : 1)) && ((var_1_17 > var_1_17) ? ((var_1_6 <= var_1_1) ? (var_1_7 == ((unsigned long int) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : 1) : 1)) && (((- 8u) >= (var_1_9 - var_1_6)) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (var_1_8 == ((unsigned char) (((var_1_14 / var_1_12) >= var_1_14) || var_1_10))))) && (((var_1_12 * last_1_var_1_14) > var_1_13) ? ((var_1_9 < var_1_7) ? (var_1_14 == ((float) var_1_15)) : (var_1_14 == ((float) var_1_15))) : (var_1_14 == ((float) var_1_16)))) && ((((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16)))) ? (var_1_17 == ((signed long int) ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))))) : (var_1_17 == ((signed long int) last_1_var_1_6))) ; [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_22=4, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=9, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_22=4, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=9, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-2147483649] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 10, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1046 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1035 mSDsluCounter, 3246 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2016 mSDsCounter, 347 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1066 IncrementalHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 347 mSolverCounterUnsat, 1230 mSDtfsCounter, 1066 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1403 GetRequests, 1357 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=793occurred in iteration=6, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 384 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2544 NumberOfCodeBlocks, 2544 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2521 ConstructedInterpolants, 0 QuantifiedInterpolants, 9084 SizeOfPredicates, 4 NumberOfNonLiveVariables, 932 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 22215/22620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 08:52:01,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 023b86f35045f9045adc9b783e35a535a0b6bf77ce996c404b36b9732a6bc24a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:52:02,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:52:03,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:52:03,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:52:03,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:52:03,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:52:03,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:52:03,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:52:03,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:52:03,054 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:52:03,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:52:03,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:52:03,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:52:03,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:52:03,055 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:52:03,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:52:03,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:52:03,055 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:52:03,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:52:03,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:52:03,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:52:03,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:52:03,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:52:03,057 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:52:03,058 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:52:03,058 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:52:03,058 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:52:03,058 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:52:03,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:52:03,059 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:52:03,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:52:03,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:52:03,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:52:03,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:52:03,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:52:03,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:52:03,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:52:03,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:52:03,062 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:52:03,062 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:52:03,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:52:03,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:52:03,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:52:03,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:52:03,062 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:52:03,063 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 023b86f35045f9045adc9b783e35a535a0b6bf77ce996c404b36b9732a6bc24a [2024-10-11 08:52:03,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:52:03,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:52:03,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:52:03,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:52:03,335 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:52:03,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i [2024-10-11 08:52:04,549 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:52:04,722 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:52:04,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i [2024-10-11 08:52:04,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e52d48c9a/0089aa3a1b464468ad0fb9dd34e19554/FLAGd90ca505c [2024-10-11 08:52:05,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e52d48c9a/0089aa3a1b464468ad0fb9dd34e19554 [2024-10-11 08:52:05,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:52:05,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:52:05,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:52:05,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:52:05,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:52:05,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:52:05" (1/1) ... [2024-10-11 08:52:05,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4751e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:05, skipping insertion in model container [2024-10-11 08:52:05,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:52:05" (1/1) ... [2024-10-11 08:52:05,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:52:05,302 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_fillercode_fillercodestructure_filler-pe-ci_file-0.i[918,931] [2024-10-11 08:52:05,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:52:05,381 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:52:05,392 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_fillercode_fillercodestructure_filler-pe-ci_file-0.i[918,931] [2024-10-11 08:52:05,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:52:05,450 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:52:05,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:05 WrapperNode [2024-10-11 08:52:05,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:52:05,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:52:05,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:52:05,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:52:05,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:05" (1/1) ... [2024-10-11 08:52:05,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:05" (1/1) ... [2024-10-11 08:52:05,520 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-10-11 08:52:05,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:52:05,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:52:05,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:52:05,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:52:05,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:05" (1/1) ... [2024-10-11 08:52:05,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:05" (1/1) ... [2024-10-11 08:52:05,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:05" (1/1) ... [2024-10-11 08:52:05,554 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 08:52:05,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:05" (1/1) ... [2024-10-11 08:52:05,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:05" (1/1) ... [2024-10-11 08:52:05,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:05" (1/1) ... [2024-10-11 08:52:05,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:05" (1/1) ... [2024-10-11 08:52:05,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:05" (1/1) ... [2024-10-11 08:52:05,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:05" (1/1) ... [2024-10-11 08:52:05,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:52:05,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:52:05,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:52:05,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:52:05,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:05" (1/1) ... [2024-10-11 08:52:05,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:52:05,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:52:05,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:52:05,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:52:05,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:52:05,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:52:05,673 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:52:05,674 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:52:05,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:52:05,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:52:05,777 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:52:05,779 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:52:26,294 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 08:52:26,294 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:52:26,347 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:52:26,347 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:52:26,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:52:26 BoogieIcfgContainer [2024-10-11 08:52:26,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:52:26,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:52:26,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:52:26,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:52:26,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:52:05" (1/3) ... [2024-10-11 08:52:26,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bae550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:52:26, skipping insertion in model container [2024-10-11 08:52:26,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:52:05" (2/3) ... [2024-10-11 08:52:26,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bae550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:52:26, skipping insertion in model container [2024-10-11 08:52:26,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:52:26" (3/3) ... [2024-10-11 08:52:26,357 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i [2024-10-11 08:52:26,368 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:52:26,368 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:52:26,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:52:26,432 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;@368137e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:52:26,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:52:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 53 states have internal predecessors, (76), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 08:52:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-11 08:52:26,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:52:26,451 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:52:26,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:52:26,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:52:26,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1530891306, now seen corresponding path program 1 times [2024-10-11 08:52:26,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:52:26,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562031520] [2024-10-11 08:52:26,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:52:26,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:52:26,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:52:26,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:52:26,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 08:52:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:52:28,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 08:52:28,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:52:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 08:52:48,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:52:48,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:52:48,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562031520] [2024-10-11 08:52:48,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562031520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:52:48,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:52:48,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:52:48,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696752819] [2024-10-11 08:52:48,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:52:48,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:52:48,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:52:48,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:52:48,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:52:48,617 INFO L87 Difference]: Start difference. First operand has 85 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 53 states have internal predecessors, (76), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 08:52:54,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:52:58,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:53:02,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:53:07,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:53:11,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:53:15,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:53:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:53:15,577 INFO L93 Difference]: Finished difference Result 273 states and 505 transitions. [2024-10-11 08:53:15,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:53:15,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 192 [2024-10-11 08:53:15,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:53:15,839 INFO L225 Difference]: With dead ends: 273 [2024-10-11 08:53:15,839 INFO L226 Difference]: Without dead ends: 189 [2024-10-11 08:53:15,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:53:15,846 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 121 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 61 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.6s IncrementalHoareTripleChecker+Time [2024-10-11 08:53:15,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 391 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 26.6s Time] [2024-10-11 08:53:15,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-11 08:53:15,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 163. [2024-10-11 08:53:15,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 100 states have (on average 1.37) internal successors, (137), 100 states have internal predecessors, (137), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 08:53:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 257 transitions. [2024-10-11 08:53:15,915 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 257 transitions. Word has length 192 [2024-10-11 08:53:15,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:53:15,917 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 257 transitions. [2024-10-11 08:53:15,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 08:53:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 257 transitions. [2024-10-11 08:53:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-11 08:53:15,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:53:15,923 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:53:15,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 08:53:16,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:53:16,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:53:16,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:53:16,125 INFO L85 PathProgramCache]: Analyzing trace with hash -274547028, now seen corresponding path program 1 times [2024-10-11 08:53:16,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:53:16,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213996429] [2024-10-11 08:53:16,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:53:16,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:53:16,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:53:16,127 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:53:16,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 08:53:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:53:17,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 08:53:17,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:53:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 249 proven. 81 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-10-11 08:53:28,415 INFO L311 TraceCheckSpWp]: Computing backward predicates...