./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1647212ce4f3f4f9fd50f26c58789c1b74cae78fef7c8c598be9f288d0b5bbff --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:22:22,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:22:22,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:22:22,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:22:22,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:22:22,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:22:22,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:22:22,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:22:22,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:22:22,819 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:22:22,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:22:22,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:22:22,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:22:22,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:22:22,821 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:22:22,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:22:22,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:22:22,821 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:22:22,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:22:22,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:22:22,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:22:22,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:22:22,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:22:22,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:22:22,828 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:22:22,829 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:22:22,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:22:22,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:22:22,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:22:22,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:22:22,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:22:22,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:22:22,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:22:22,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:22:22,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:22:22,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:22:22,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:22:22,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:22:22,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:22:22,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:22:22,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:22:22,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:22:22,833 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1647212ce4f3f4f9fd50f26c58789c1b74cae78fef7c8c598be9f288d0b5bbff [2024-11-12 04:22:23,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:22:23,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:22:23,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:22:23,142 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:22:23,144 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:22:23,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i [2024-11-12 04:22:24,622 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:22:24,854 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:22:24,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i [2024-11-12 04:22:24,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8634034d/fd03ad1556194461b2545cf6a74c9511/FLAG77bc325af [2024-11-12 04:22:25,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8634034d/fd03ad1556194461b2545cf6a74c9511 [2024-11-12 04:22:25,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:22:25,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:22:25,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:22:25,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:22:25,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:22:25,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:22:25" (1/1) ... [2024-11-12 04:22:25,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65870940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:25, skipping insertion in model container [2024-11-12 04:22:25,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:22:25" (1/1) ... [2024-11-12 04:22:25,244 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:22:25,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i[919,932] [2024-11-12 04:22:25,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:22:25,568 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:22:25,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i[919,932] [2024-11-12 04:22:25,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:22:25,649 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:22:25,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:25 WrapperNode [2024-11-12 04:22:25,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:22:25,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:22:25,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:22:25,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:22:25,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:25" (1/1) ... [2024-11-12 04:22:25,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:25" (1/1) ... [2024-11-12 04:22:25,707 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263 [2024-11-12 04:22:25,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:22:25,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:22:25,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:22:25,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:22:25,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:25" (1/1) ... [2024-11-12 04:22:25,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:25" (1/1) ... [2024-11-12 04:22:25,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:25" (1/1) ... [2024-11-12 04:22:25,737 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:22:25,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:25" (1/1) ... [2024-11-12 04:22:25,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:25" (1/1) ... [2024-11-12 04:22:25,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:25" (1/1) ... [2024-11-12 04:22:25,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:25" (1/1) ... [2024-11-12 04:22:25,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:25" (1/1) ... [2024-11-12 04:22:25,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:25" (1/1) ... [2024-11-12 04:22:25,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:22:25,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:22:25,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:22:25,761 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:22:25,762 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:25" (1/1) ... [2024-11-12 04:22:25,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:22:25,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:22:25,791 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:22:25,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:22:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:22:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:22:25,828 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:22:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:22:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:22:25,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:22:25,899 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:22:25,901 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:22:26,268 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 04:22:26,268 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:22:26,280 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:22:26,280 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:22:26,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:22:26 BoogieIcfgContainer [2024-11-12 04:22:26,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:22:26,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:22:26,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:22:26,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:22:26,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:22:25" (1/3) ... [2024-11-12 04:22:26,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a4d971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:22:26, skipping insertion in model container [2024-11-12 04:22:26,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:25" (2/3) ... [2024-11-12 04:22:26,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a4d971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:22:26, skipping insertion in model container [2024-11-12 04:22:26,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:22:26" (3/3) ... [2024-11-12 04:22:26,287 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i [2024-11-12 04:22:26,302 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:22:26,302 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:22:26,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:22:26,379 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;@6513376a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:22:26,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:22:26,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 74 states have internal predecessors, (105), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-12 04:22:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-12 04:22:26,397 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:26,398 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:26,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:26,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:26,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1749041708, now seen corresponding path program 1 times [2024-11-12 04:22:26,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:22:26,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712912583] [2024-11-12 04:22:26,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:26,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:22:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:22:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:22:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:22:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:22:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:22:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:22:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:22:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:22:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:22:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:22:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:22:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:22:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:22:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:22:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:22:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:22:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:22:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:22:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:22:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:22:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:22:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:22:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:22:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 04:22:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:22:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 04:22:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:22:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 04:22:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:22:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:22:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:22:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 04:22:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 04:22:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 04:22:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 04:22:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 04:22:26,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:22:26,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712912583] [2024-11-12 04:22:26,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712912583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:26,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:26,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:22:26,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120539231] [2024-11-12 04:22:26,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:26,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:22:26,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:22:27,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:22:27,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:22:27,011 INFO L87 Difference]: Start difference. First operand has 111 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 74 states have internal predecessors, (105), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 04:22:27,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:27,054 INFO L93 Difference]: Finished difference Result 215 states and 379 transitions. [2024-11-12 04:22:27,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:22:27,056 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 223 [2024-11-12 04:22:27,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:27,064 INFO L225 Difference]: With dead ends: 215 [2024-11-12 04:22:27,067 INFO L226 Difference]: Without dead ends: 107 [2024-11-12 04:22:27,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:22:27,075 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:27,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:22:27,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-12 04:22:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-12 04:22:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-12 04:22:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 168 transitions. [2024-11-12 04:22:27,140 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 168 transitions. Word has length 223 [2024-11-12 04:22:27,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:27,141 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 168 transitions. [2024-11-12 04:22:27,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 04:22:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 168 transitions. [2024-11-12 04:22:27,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-12 04:22:27,146 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:27,147 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:27,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:22:27,150 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:27,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:27,151 INFO L85 PathProgramCache]: Analyzing trace with hash -307866738, now seen corresponding path program 1 times [2024-11-12 04:22:27,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:22:27,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941435089] [2024-11-12 04:22:27,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:27,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:22:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:22:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:22:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:22:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:22:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:22:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:22:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:22:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:22:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:22:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:22:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:22:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:22:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:22:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:22:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:22:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:22:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:22:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:22:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:22:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:22:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:22:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:22:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:22:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 04:22:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:22:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 04:22:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:22:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 04:22:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:22:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:22:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:22:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 04:22:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 04:22:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 04:22:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 04:22:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:27,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 04:22:27,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:22:27,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941435089] [2024-11-12 04:22:27,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941435089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:27,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:27,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:22:27,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707035969] [2024-11-12 04:22:27,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:27,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:22:27,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:22:27,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:22:27,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:22:27,821 INFO L87 Difference]: Start difference. First operand 107 states and 168 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:27,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:27,916 INFO L93 Difference]: Finished difference Result 300 states and 479 transitions. [2024-11-12 04:22:27,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:22:27,917 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2024-11-12 04:22:27,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:27,919 INFO L225 Difference]: With dead ends: 300 [2024-11-12 04:22:27,920 INFO L226 Difference]: Without dead ends: 196 [2024-11-12 04:22:27,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:22:27,922 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 82 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:27,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 460 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:22:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-12 04:22:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 173. [2024-11-12 04:22:27,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 04:22:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 271 transitions. [2024-11-12 04:22:27,963 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 271 transitions. Word has length 223 [2024-11-12 04:22:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:27,964 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 271 transitions. [2024-11-12 04:22:27,964 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 271 transitions. [2024-11-12 04:22:27,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-12 04:22:27,970 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:27,974 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:27,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:22:27,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:27,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:27,975 INFO L85 PathProgramCache]: Analyzing trace with hash 114835088, now seen corresponding path program 1 times [2024-11-12 04:22:27,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:22:27,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902208438] [2024-11-12 04:22:27,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:27,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:22:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:22:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:22:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:22:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:22:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:22:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:22:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:22:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:22:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:22:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:22:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:22:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:22:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:22:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:22:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:22:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:22:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:22:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:22:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:22:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:22:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:22:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:22:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:22:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 04:22:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:22:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 04:22:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:22:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 04:22:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:22:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:22:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:22:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 04:22:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 04:22:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 04:22:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 04:22:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 04:22:28,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:22:28,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902208438] [2024-11-12 04:22:28,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902208438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:28,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:28,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:22:28,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328566393] [2024-11-12 04:22:28,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:28,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:22:28,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:22:28,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:22:28,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:28,417 INFO L87 Difference]: Start difference. First operand 173 states and 271 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:28,490 INFO L93 Difference]: Finished difference Result 298 states and 472 transitions. [2024-11-12 04:22:28,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:22:28,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2024-11-12 04:22:28,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:28,493 INFO L225 Difference]: With dead ends: 298 [2024-11-12 04:22:28,494 INFO L226 Difference]: Without dead ends: 194 [2024-11-12 04:22:28,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:28,496 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 76 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:28,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 297 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:22:28,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-12 04:22:28,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2024-11-12 04:22:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 04:22:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 275 transitions. [2024-11-12 04:22:28,514 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 275 transitions. Word has length 223 [2024-11-12 04:22:28,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:28,515 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 275 transitions. [2024-11-12 04:22:28,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 275 transitions. [2024-11-12 04:22:28,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-12 04:22:28,517 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:28,517 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:28,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:22:28,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:28,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:28,518 INFO L85 PathProgramCache]: Analyzing trace with hash -580355067, now seen corresponding path program 1 times [2024-11-12 04:22:28,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:22:28,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341761270] [2024-11-12 04:22:28,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:28,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:22:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:22:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:22:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:22:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:22:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:22:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:22:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:22:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:22:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:22:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:22:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:22:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:22:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:22:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:22:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:22:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:22:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:22:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:22:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:22:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:22:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:22:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:22:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:22:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 04:22:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:22:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 04:22:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:22:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 04:22:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:22:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:22:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:22:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 04:22:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 04:22:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 04:22:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 04:22:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 04:22:28,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:22:28,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341761270] [2024-11-12 04:22:28,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341761270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:28,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:28,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:22:28,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727568424] [2024-11-12 04:22:28,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:28,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:22:28,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:22:28,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:22:28,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:28,736 INFO L87 Difference]: Start difference. First operand 176 states and 275 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:28,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:28,768 INFO L93 Difference]: Finished difference Result 281 states and 442 transitions. [2024-11-12 04:22:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:22:28,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 224 [2024-11-12 04:22:28,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:28,774 INFO L225 Difference]: With dead ends: 281 [2024-11-12 04:22:28,774 INFO L226 Difference]: Without dead ends: 177 [2024-11-12 04:22:28,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:28,775 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:28,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 322 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:22:28,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-12 04:22:28,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-12 04:22:28,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 04:22:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 276 transitions. [2024-11-12 04:22:28,809 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 276 transitions. Word has length 224 [2024-11-12 04:22:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:28,810 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 276 transitions. [2024-11-12 04:22:28,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:28,814 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 276 transitions. [2024-11-12 04:22:28,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-12 04:22:28,816 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:28,816 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:28,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 04:22:28,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:28,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:28,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1507947237, now seen corresponding path program 1 times [2024-11-12 04:22:28,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:22:28,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034694953] [2024-11-12 04:22:28,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:28,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:22:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:22:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:22:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:22:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:22:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:22:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:22:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:22:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:22:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:22:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:22:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:22:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:22:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:22:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:22:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:22:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:22:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:22:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:22:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:22:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:22:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:22:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:22:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:22:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 04:22:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:22:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 04:22:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:22:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 04:22:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:22:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:22:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:22:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 04:22:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 04:22:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 04:22:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 04:22:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 04:22:29,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:22:29,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034694953] [2024-11-12 04:22:29,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034694953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:29,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:29,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:22:29,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680439932] [2024-11-12 04:22:29,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:29,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:22:29,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:22:29,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:22:29,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:29,093 INFO L87 Difference]: Start difference. First operand 177 states and 276 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:29,156 INFO L93 Difference]: Finished difference Result 296 states and 465 transitions. [2024-11-12 04:22:29,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:22:29,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2024-11-12 04:22:29,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:29,160 INFO L225 Difference]: With dead ends: 296 [2024-11-12 04:22:29,162 INFO L226 Difference]: Without dead ends: 191 [2024-11-12 04:22:29,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:29,163 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 63 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:29,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 305 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:22:29,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-12 04:22:29,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 181. [2024-11-12 04:22:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 108 states have (on average 1.2962962962962963) internal successors, (140), 108 states have internal predecessors, (140), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 04:22:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 280 transitions. [2024-11-12 04:22:29,186 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 280 transitions. Word has length 225 [2024-11-12 04:22:29,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:29,188 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 280 transitions. [2024-11-12 04:22:29,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:29,188 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 280 transitions. [2024-11-12 04:22:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-12 04:22:29,190 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:29,191 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:29,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 04:22:29,191 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:29,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:29,192 INFO L85 PathProgramCache]: Analyzing trace with hash -180996505, now seen corresponding path program 1 times [2024-11-12 04:22:29,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:22:29,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299845086] [2024-11-12 04:22:29,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:29,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:22:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:22:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:22:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:22:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:22:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:22:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:22:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:22:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:22:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:22:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:22:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:22:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:22:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:22:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:22:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:22:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:22:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:22:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:22:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:22:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:22:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:22:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:22:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:22:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 04:22:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:22:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 04:22:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:22:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 04:22:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:22:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:22:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:22:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 04:22:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 04:22:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 04:22:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 04:22:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 04:22:29,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:22:29,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299845086] [2024-11-12 04:22:29,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299845086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:29,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:29,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 04:22:29,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238425064] [2024-11-12 04:22:29,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:29,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 04:22:29,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:22:29,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 04:22:29,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:22:29,638 INFO L87 Difference]: Start difference. First operand 181 states and 280 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:29,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:29,914 INFO L93 Difference]: Finished difference Result 402 states and 624 transitions. [2024-11-12 04:22:29,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:22:29,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2024-11-12 04:22:29,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:29,917 INFO L225 Difference]: With dead ends: 402 [2024-11-12 04:22:29,917 INFO L226 Difference]: Without dead ends: 297 [2024-11-12 04:22:29,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:22:29,919 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 143 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:29,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 578 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:22:29,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-12 04:22:29,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 280. [2024-11-12 04:22:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 171 states have (on average 1.327485380116959) internal successors, (227), 171 states have internal predecessors, (227), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-12 04:22:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 437 transitions. [2024-11-12 04:22:29,947 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 437 transitions. Word has length 225 [2024-11-12 04:22:29,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:29,947 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 437 transitions. [2024-11-12 04:22:29,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:29,948 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 437 transitions. [2024-11-12 04:22:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-12 04:22:29,950 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:29,950 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:29,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 04:22:29,951 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:29,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:29,951 INFO L85 PathProgramCache]: Analyzing trace with hash 11834047, now seen corresponding path program 1 times [2024-11-12 04:22:29,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:22:29,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069024634] [2024-11-12 04:22:29,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:29,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:22:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:22:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:22:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:22:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:22:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:22:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:22:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:22:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:22:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:22:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:22:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:22:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:22:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:22:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:22:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:22:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:22:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:22:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:22:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:22:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:22:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:22:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:22:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:22:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 04:22:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:22:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 04:22:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:22:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 04:22:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:22:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:22:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:22:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 04:22:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 04:22:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 04:22:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 04:22:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 04:22:30,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:22:30,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069024634] [2024-11-12 04:22:30,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069024634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:30,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:30,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:22:30,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820542263] [2024-11-12 04:22:30,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:30,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:22:30,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:22:30,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:22:30,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:30,298 INFO L87 Difference]: Start difference. First operand 280 states and 437 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:30,367 INFO L93 Difference]: Finished difference Result 495 states and 775 transitions. [2024-11-12 04:22:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:22:30,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 226 [2024-11-12 04:22:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:30,371 INFO L225 Difference]: With dead ends: 495 [2024-11-12 04:22:30,371 INFO L226 Difference]: Without dead ends: 285 [2024-11-12 04:22:30,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:30,373 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 56 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:30,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 292 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:22:30,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-12 04:22:30,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 279. [2024-11-12 04:22:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 170 states have (on average 1.3235294117647058) internal successors, (225), 170 states have internal predecessors, (225), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-12 04:22:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 435 transitions. [2024-11-12 04:22:30,424 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 435 transitions. Word has length 226 [2024-11-12 04:22:30,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:30,424 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 435 transitions. [2024-11-12 04:22:30,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 435 transitions. [2024-11-12 04:22:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-12 04:22:30,426 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:30,427 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:30,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 04:22:30,427 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:30,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:30,427 INFO L85 PathProgramCache]: Analyzing trace with hash -311021468, now seen corresponding path program 1 times [2024-11-12 04:22:30,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:22:30,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004558047] [2024-11-12 04:22:30,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:30,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:22:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:22:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:22:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:22:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:22:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:22:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:22:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:22:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:22:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:22:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:22:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:22:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:22:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:22:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:22:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:22:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:22:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:22:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:22:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:22:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:22:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:22:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:22:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:22:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 04:22:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:22:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 04:22:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:22:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 04:22:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:22:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:22:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:22:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 04:22:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 04:22:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 04:22:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 04:22:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 04:22:30,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:22:30,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004558047] [2024-11-12 04:22:30,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004558047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:30,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:30,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:22:30,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075146251] [2024-11-12 04:22:30,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:30,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:22:30,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:22:30,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:22:30,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:22:30,606 INFO L87 Difference]: Start difference. First operand 279 states and 435 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:30,755 INFO L93 Difference]: Finished difference Result 502 states and 786 transitions. [2024-11-12 04:22:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:22:30,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 228 [2024-11-12 04:22:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:30,759 INFO L225 Difference]: With dead ends: 502 [2024-11-12 04:22:30,759 INFO L226 Difference]: Without dead ends: 293 [2024-11-12 04:22:30,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 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-11-12 04:22:30,760 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 65 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:30,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 384 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:22:30,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-12 04:22:30,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 279. [2024-11-12 04:22:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 170 states have (on average 1.3176470588235294) internal successors, (224), 170 states have internal predecessors, (224), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-12 04:22:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 434 transitions. [2024-11-12 04:22:30,785 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 434 transitions. Word has length 228 [2024-11-12 04:22:30,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:30,786 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 434 transitions. [2024-11-12 04:22:30,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 434 transitions. [2024-11-12 04:22:30,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-12 04:22:30,787 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:30,788 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:30,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 04:22:30,788 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:30,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:30,788 INFO L85 PathProgramCache]: Analyzing trace with hash -445034974, now seen corresponding path program 1 times [2024-11-12 04:22:30,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:22:30,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735653239] [2024-11-12 04:22:30,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:30,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:22:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:22:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:22:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:22:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:22:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:22:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:22:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:22:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:22:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:22:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:22:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:22:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:22:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:22:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:22:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:22:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:22:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:22:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:22:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:22:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:22:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:22:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:22:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:22:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 04:22:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:22:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 04:22:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:22:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 04:22:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:22:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:22:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:22:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 04:22:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 04:22:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 04:22:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 04:22:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 04:22:31,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:22:31,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735653239] [2024-11-12 04:22:31,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735653239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:31,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:31,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:22:31,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397905384] [2024-11-12 04:22:31,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:31,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:22:31,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:22:31,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:22:31,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:22:31,799 INFO L87 Difference]: Start difference. First operand 279 states and 434 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:32,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:32,218 INFO L93 Difference]: Finished difference Result 525 states and 815 transitions. [2024-11-12 04:22:32,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:22:32,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 228 [2024-11-12 04:22:32,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:32,221 INFO L225 Difference]: With dead ends: 525 [2024-11-12 04:22:32,221 INFO L226 Difference]: Without dead ends: 320 [2024-11-12 04:22:32,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 04:22:32,223 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 96 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:32,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 526 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:22:32,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-12 04:22:32,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 302. [2024-11-12 04:22:32,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 193 states have (on average 1.3316062176165804) internal successors, (257), 193 states have internal predecessors, (257), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-12 04:22:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 467 transitions. [2024-11-12 04:22:32,259 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 467 transitions. Word has length 228 [2024-11-12 04:22:32,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:32,260 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 467 transitions. [2024-11-12 04:22:32,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:32,261 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 467 transitions. [2024-11-12 04:22:32,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-12 04:22:32,262 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:32,262 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:32,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 04:22:32,263 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:32,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:32,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1269667965, now seen corresponding path program 1 times [2024-11-12 04:22:32,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:22:32,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37900747] [2024-11-12 04:22:32,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:32,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:22:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:22:32,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [674328371] [2024-11-12 04:22:32,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:32,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:22:32,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:22:32,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:22:32,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 04:22:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:22:32,520 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:22:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:22:32,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:22:32,752 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:22:32,753 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:22:32,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 04:22:32,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-12 04:22:32,962 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:33,155 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:22:33,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:22:33 BoogieIcfgContainer [2024-11-12 04:22:33,158 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:22:33,158 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:22:33,159 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:22:33,159 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:22:33,159 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:22:26" (3/4) ... [2024-11-12 04:22:33,161 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:22:33,162 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:22:33,163 INFO L158 Benchmark]: Toolchain (without parser) took 7960.59ms. Allocated memory was 172.0MB in the beginning and 455.1MB in the end (delta: 283.1MB). Free memory was 97.3MB in the beginning and 368.0MB in the end (delta: -270.7MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-11-12 04:22:33,163 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 172.0MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:22:33,163 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.62ms. Allocated memory is still 172.0MB. Free memory was 97.1MB in the beginning and 136.5MB in the end (delta: -39.4MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-11-12 04:22:33,163 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.23ms. Allocated memory is still 172.0MB. Free memory was 136.5MB in the beginning and 131.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 04:22:33,164 INFO L158 Benchmark]: Boogie Preprocessor took 51.91ms. Allocated memory is still 172.0MB. Free memory was 131.2MB in the beginning and 124.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 04:22:33,164 INFO L158 Benchmark]: RCFGBuilder took 520.10ms. Allocated memory is still 172.0MB. Free memory was 124.9MB in the beginning and 91.4MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-12 04:22:33,164 INFO L158 Benchmark]: TraceAbstraction took 6876.01ms. Allocated memory was 172.0MB in the beginning and 455.1MB in the end (delta: 283.1MB). Free memory was 90.4MB in the beginning and 368.0MB in the end (delta: -277.6MB). Peak memory consumption was 168.4MB. Max. memory is 16.1GB. [2024-11-12 04:22:33,165 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 455.1MB. Free memory is still 368.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:22:33,166 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.26ms. Allocated memory is still 172.0MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.62ms. Allocated memory is still 172.0MB. Free memory was 97.1MB in the beginning and 136.5MB in the end (delta: -39.4MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.23ms. Allocated memory is still 172.0MB. Free memory was 136.5MB in the beginning and 131.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.91ms. Allocated memory is still 172.0MB. Free memory was 131.2MB in the beginning and 124.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 520.10ms. Allocated memory is still 172.0MB. Free memory was 124.9MB in the beginning and 91.4MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6876.01ms. Allocated memory was 172.0MB in the beginning and 455.1MB in the end (delta: 283.1MB). Free memory was 90.4MB in the beginning and 368.0MB in the end (delta: -277.6MB). Peak memory consumption was 168.4MB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 455.1MB. Free memory is still 368.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 205, overapproximation of bitwiseOr at line 78, overapproximation of shiftRight at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 100; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] unsigned short int var_1_8 = 10; [L26] unsigned short int var_1_9 = 0; [L27] unsigned short int var_1_10 = 53946; [L28] unsigned short int var_1_11 = 1; [L29] unsigned long int var_1_12 = 8; [L30] double var_1_13 = 8.25; [L31] signed long int var_1_14 = -256; [L32] double var_1_15 = 0.19999999999999996; [L33] signed long int var_1_16 = -16; [L34] signed char var_1_17 = 1; [L35] signed char var_1_18 = 4; [L36] signed char var_1_19 = 64; [L37] signed long int var_1_20 = 1; [L38] signed long int var_1_21 = 1000000000; [L39] unsigned char var_1_23 = 4; [L40] unsigned char var_1_26 = 0; [L41] unsigned char var_1_27 = 5; [L42] unsigned short int var_1_28 = 16; [L43] unsigned short int var_1_29 = 200; [L44] signed short int var_1_30 = -256; [L45] signed short int var_1_32 = 8; [L46] unsigned short int var_1_33 = 128; [L47] double var_1_34 = 0.25; [L48] double var_1_35 = 5.75; [L49] signed long int var_1_36 = -32; [L50] unsigned char var_1_37 = 1; [L51] unsigned char var_1_38 = 0; [L52] unsigned char var_1_39 = 1; [L53] float var_1_40 = 2.6; [L54] unsigned char var_1_41 = 0; [L55] unsigned char var_1_42 = 0; [L56] unsigned short int last_1_var_1_1 = 100; [L57] unsigned long int last_1_var_1_12 = 8; [L58] double last_1_var_1_13 = 8.25; [L59] signed long int last_1_var_1_16 = -16; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L209] isInitial = 1 [L210] FCALL initially() [L211] COND TRUE 1 [L212] CALL updateLastVariables() [L199] last_1_var_1_1 = var_1_1 [L200] last_1_var_1_12 = var_1_12 [L201] last_1_var_1_13 = var_1_13 [L202] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L212] RET updateLastVariables() [L213] CALL updateVariables() [L144] var_1_6 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L145] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L146] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L146] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L147] var_1_7 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_8=10, var_1_9=0] [L148] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_8=10, var_1_9=0] [L149] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L149] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L150] var_1_8 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_9=0] [L151] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L152] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L153] var_1_9 = __VERIFIER_nondet_ushort() [L154] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767] [L154] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767] [L155] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L155] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L156] var_1_10 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L157] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L158] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L159] var_1_11 = __VERIFIER_nondet_ushort() [L160] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L160] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L161] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L161] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L162] var_1_14 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L163] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L164] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L164] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L165] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L165] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L166] var_1_15 = __VERIFIER_nondet_double() [L167] 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_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L167] 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_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L168] var_1_18 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L169] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L170] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L170] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L171] var_1_19 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_19 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L172] RET assume_abort_if_not(var_1_19 >= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L173] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L173] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L174] var_1_21 = __VERIFIER_nondet_long() [L175] CALL assume_abort_if_not(var_1_21 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L175] RET assume_abort_if_not(var_1_21 >= 536870911) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L176] CALL assume_abort_if_not(var_1_21 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L176] RET assume_abort_if_not(var_1_21 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L177] var_1_26 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L178] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L179] CALL assume_abort_if_not(var_1_26 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L179] RET assume_abort_if_not(var_1_26 <= 64) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L180] var_1_27 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L181] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L182] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L182] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L183] var_1_29 = __VERIFIER_nondet_ushort() [L184] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L184] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L185] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L185] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L186] var_1_35 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L187] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L188] var_1_37 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L189] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L190] CALL assume_abort_if_not(var_1_37 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L190] RET assume_abort_if_not(var_1_37 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L191] var_1_39 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_39 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L192] RET assume_abort_if_not(var_1_39 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L193] CALL assume_abort_if_not(var_1_39 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L193] RET assume_abort_if_not(var_1_39 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L194] var_1_42 = __VERIFIER_nondet_uchar() [L195] CALL assume_abort_if_not(var_1_42 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L195] RET assume_abort_if_not(var_1_42 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L196] CALL assume_abort_if_not(var_1_42 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L196] RET assume_abort_if_not(var_1_42 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L213] RET updateVariables() [L214] CALL step() [L63] COND TRUE (var_1_1 + var_1_12) > 16 [L64] var_1_23 = ((var_1_26 + 2) + var_1_27) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L72] var_1_28 = var_1_29 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L73] COND TRUE var_1_20 < 2 [L74] var_1_30 = (((((((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) > (var_1_20)) ? (((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) : (var_1_20))) + var_1_17) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L78] EXPR var_1_1 | var_1_20 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L78] COND FALSE !((~ (var_1_1 | var_1_20)) >= (~ (~ 32))) [L81] EXPR var_1_17 >> var_1_20 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L81] COND TRUE (var_1_17 >> var_1_20) <= var_1_17 [L82] COND FALSE !(var_1_16 > var_1_17) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L86] COND FALSE !(var_1_16 >= var_1_1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L91] COND TRUE ((var_1_20 - var_1_27) > var_1_16) && var_1_37 [L92] var_1_36 = ((((var_1_26) < (64)) ? (var_1_26) : (64))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=0, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L94] var_1_38 = var_1_39 [L95] var_1_40 = var_1_35 [L96] var_1_41 = var_1_42 [L97] unsigned char stepLocal_0 = last_1_var_1_13 >= last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_0=0, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L98] COND FALSE !((last_1_var_1_12 == last_1_var_1_1) && stepLocal_0) [L109] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L111] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L111] COND TRUE (((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16 [L112] COND TRUE \read(var_1_7) [L113] var_1_12 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L116] var_1_17 = (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1))))) [L117] unsigned long int stepLocal_4 = var_1_12; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L118] COND TRUE \read(var_1_6) [L119] var_1_20 = ((var_1_8 - (var_1_21 - var_1_11)) + var_1_10) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L127] unsigned char stepLocal_3 = var_1_6; [L128] unsigned char stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_2=1, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L129] COND FALSE !(stepLocal_2 && (var_1_9 < (var_1_10 + var_1_20))) [L134] var_1_16 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=32767, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L136] signed long int stepLocal_1 = ((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14); VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_1=32767, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=32767, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L137] COND TRUE stepLocal_1 >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8))) [L138] var_1_13 = var_1_15 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=32767, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L214] RET step() [L215] CALL, EXPR property() [L205] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=32767, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L205] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=32767, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L205] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=32767, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L205-L206] return (((((((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1)) && (((((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14)) >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8)))) ? (var_1_13 == ((double) var_1_15)) : (var_1_13 == ((double) var_1_15)))) && ((var_1_6 && (var_1_9 < (var_1_10 + var_1_20))) ? ((var_1_7 && var_1_6) ? (var_1_16 == ((signed long int) var_1_10)) : 1) : (var_1_16 == ((signed long int) var_1_8)))) && (var_1_17 == ((signed char) (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1)))))))) && (var_1_6 ? (var_1_20 == ((signed long int) ((var_1_8 - (var_1_21 - var_1_11)) + var_1_10))) : (((~ var_1_19) == var_1_12) ? (var_1_20 == ((signed long int) var_1_1)) : (var_1_20 == ((signed long int) var_1_10)))) ; [L215] RET, EXPR property() [L215] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=32767, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=32767, var_1_17=0, var_1_18=4, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=2, var_1_26=256, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=2, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32767, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 10, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 581 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 581 mSDsluCounter, 3332 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1889 mSDsCounter, 217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 662 IncrementalHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 217 mSolverCounterUnsat, 1443 mSDtfsCounter, 662 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 708 GetRequests, 687 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=9, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 106 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2485 NumberOfCodeBlocks, 2485 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2016 ConstructedInterpolants, 0 QuantifiedInterpolants, 6874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 21420/21420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 04:22:33,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1647212ce4f3f4f9fd50f26c58789c1b74cae78fef7c8c598be9f288d0b5bbff --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:22:35,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:22:35,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:22:35,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:22:35,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:22:35,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:22:35,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:22:35,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:22:35,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:22:35,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:22:35,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:22:35,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:22:35,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:22:35,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:22:35,532 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:22:35,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:22:35,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:22:35,534 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:22:35,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:22:35,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:22:35,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:22:35,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:22:35,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:22:35,539 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:22:35,539 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:22:35,539 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:22:35,539 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:22:35,539 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:22:35,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:22:35,540 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:22:35,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:22:35,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:22:35,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:22:35,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:22:35,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:22:35,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:22:35,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:22:35,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:22:35,541 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:22:35,541 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:22:35,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:22:35,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:22:35,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:22:35,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:22:35,543 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1647212ce4f3f4f9fd50f26c58789c1b74cae78fef7c8c598be9f288d0b5bbff [2024-11-12 04:22:35,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:22:35,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:22:35,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:22:35,876 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:22:35,876 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:22:35,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i [2024-11-12 04:22:37,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:22:37,566 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:22:37,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i [2024-11-12 04:22:37,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40b0cd5da/9d33008e67dc4e6ca510daec6f7f3b8d/FLAGff142f984 [2024-11-12 04:22:37,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40b0cd5da/9d33008e67dc4e6ca510daec6f7f3b8d [2024-11-12 04:22:37,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:22:37,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:22:37,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:22:37,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:22:37,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:22:37,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:22:37" (1/1) ... [2024-11-12 04:22:37,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc21f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:37, skipping insertion in model container [2024-11-12 04:22:37,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:22:37" (1/1) ... [2024-11-12 04:22:37,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:22:38,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i[919,932] [2024-11-12 04:22:38,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:22:38,229 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:22:38,239 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i[919,932] [2024-11-12 04:22:38,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:22:38,309 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:22:38,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:38 WrapperNode [2024-11-12 04:22:38,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:22:38,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:22:38,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:22:38,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:22:38,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:38" (1/1) ... [2024-11-12 04:22:38,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:38" (1/1) ... [2024-11-12 04:22:38,365 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-11-12 04:22:38,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:22:38,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:22:38,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:22:38,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:22:38,382 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:38" (1/1) ... [2024-11-12 04:22:38,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:38" (1/1) ... [2024-11-12 04:22:38,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:38" (1/1) ... [2024-11-12 04:22:38,406 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:22:38,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:38" (1/1) ... [2024-11-12 04:22:38,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:38" (1/1) ... [2024-11-12 04:22:38,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:38" (1/1) ... [2024-11-12 04:22:38,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:38" (1/1) ... [2024-11-12 04:22:38,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:38" (1/1) ... [2024-11-12 04:22:38,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:38" (1/1) ... [2024-11-12 04:22:38,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:22:38,436 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:22:38,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:22:38,437 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:22:38,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:38" (1/1) ... [2024-11-12 04:22:38,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:22:38,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:22:38,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:22:38,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:22:38,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:22:38,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:22:38,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:22:38,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:22:38,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:22:38,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:22:38,593 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:22:38,595 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:22:39,068 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-12 04:22:39,069 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:22:39,093 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:22:39,093 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:22:39,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:22:39 BoogieIcfgContainer [2024-11-12 04:22:39,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:22:39,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:22:39,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:22:39,106 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:22:39,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:22:37" (1/3) ... [2024-11-12 04:22:39,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224aa180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:22:39, skipping insertion in model container [2024-11-12 04:22:39,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:38" (2/3) ... [2024-11-12 04:22:39,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224aa180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:22:39, skipping insertion in model container [2024-11-12 04:22:39,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:22:39" (3/3) ... [2024-11-12 04:22:39,108 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-92.i [2024-11-12 04:22:39,128 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:22:39,128 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:22:39,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:22:39,235 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;@220c4e18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:22:39,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:22:39,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-12 04:22:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-12 04:22:39,269 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:39,275 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:39,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:39,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:39,282 INFO L85 PathProgramCache]: Analyzing trace with hash 853852761, now seen corresponding path program 1 times [2024-11-12 04:22:39,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:22:39,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432159273] [2024-11-12 04:22:39,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:39,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:22:39,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:22:39,317 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:22:39,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 04:22:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:39,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:22:39,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:22:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 1556 trivial. 0 not checked. [2024-11-12 04:22:39,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:22:39,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:22:39,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432159273] [2024-11-12 04:22:39,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432159273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:39,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:39,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:22:39,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734547783] [2024-11-12 04:22:39,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:39,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:22:39,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:22:39,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:22:39,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:22:39,871 INFO L87 Difference]: Start difference. First operand has 96 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 04:22:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:39,908 INFO L93 Difference]: Finished difference Result 185 states and 333 transitions. [2024-11-12 04:22:39,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:22:39,910 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 218 [2024-11-12 04:22:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:39,917 INFO L225 Difference]: With dead ends: 185 [2024-11-12 04:22:39,918 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 04:22:39,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:22:39,925 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:39,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:22:39,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 04:22:39,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-12 04:22:39,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-12 04:22:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 145 transitions. [2024-11-12 04:22:39,978 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 145 transitions. Word has length 218 [2024-11-12 04:22:39,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:39,979 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 145 transitions. [2024-11-12 04:22:39,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 04:22:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 145 transitions. [2024-11-12 04:22:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-12 04:22:39,984 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:39,984 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:39,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 04:22:40,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:22:40,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:40,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1076756385, now seen corresponding path program 1 times [2024-11-12 04:22:40,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:22:40,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485590948] [2024-11-12 04:22:40,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:40,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:22:40,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:22:40,195 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:22:40,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 04:22:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:40,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 04:22:40,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:22:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 04:22:40,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:22:40,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:22:40,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485590948] [2024-11-12 04:22:40,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485590948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:40,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:40,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:22:40,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831745232] [2024-11-12 04:22:40,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:40,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:22:40,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:22:40,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:22:40,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:40,777 INFO L87 Difference]: Start difference. First operand 92 states and 145 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:40,846 INFO L93 Difference]: Finished difference Result 259 states and 415 transitions. [2024-11-12 04:22:40,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:22:40,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 218 [2024-11-12 04:22:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:40,850 INFO L225 Difference]: With dead ends: 259 [2024-11-12 04:22:40,850 INFO L226 Difference]: Without dead ends: 170 [2024-11-12 04:22:40,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:40,852 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 27 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:40,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 267 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:22:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-12 04:22:40,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 156. [2024-11-12 04:22:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 83 states have internal predecessors, (105), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 04:22:40,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 245 transitions. [2024-11-12 04:22:40,871 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 245 transitions. Word has length 218 [2024-11-12 04:22:40,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:40,872 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 245 transitions. [2024-11-12 04:22:40,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 245 transitions. [2024-11-12 04:22:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-12 04:22:40,875 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:40,875 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:40,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 04:22:41,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:22:41,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:41,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:41,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1629863009, now seen corresponding path program 1 times [2024-11-12 04:22:41,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:22:41,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827792357] [2024-11-12 04:22:41,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:41,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:22:41,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:22:41,087 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:22:41,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 04:22:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:41,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 04:22:41,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:22:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 04:22:42,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:22:42,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:22:42,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827792357] [2024-11-12 04:22:42,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827792357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:42,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:42,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:22:42,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126171405] [2024-11-12 04:22:42,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:42,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:22:42,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:22:42,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:22:42,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:42,092 INFO L87 Difference]: Start difference. First operand 156 states and 245 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:42,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:42,150 INFO L93 Difference]: Finished difference Result 257 states and 409 transitions. [2024-11-12 04:22:42,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:22:42,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 218 [2024-11-12 04:22:42,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:42,153 INFO L225 Difference]: With dead ends: 257 [2024-11-12 04:22:42,153 INFO L226 Difference]: Without dead ends: 168 [2024-11-12 04:22:42,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:42,155 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 23 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:42,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 263 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:22:42,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-12 04:22:42,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 157. [2024-11-12 04:22:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 84 states have internal predecessors, (106), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 04:22:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 246 transitions. [2024-11-12 04:22:42,169 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 246 transitions. Word has length 218 [2024-11-12 04:22:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:42,170 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 246 transitions. [2024-11-12 04:22:42,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:42,170 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 246 transitions. [2024-11-12 04:22:42,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-12 04:22:42,172 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:42,172 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:42,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 04:22:42,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:22:42,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:42,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:42,374 INFO L85 PathProgramCache]: Analyzing trace with hash -20429306, now seen corresponding path program 1 times [2024-11-12 04:22:42,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:22:42,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774197694] [2024-11-12 04:22:42,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:42,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:22:42,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:22:42,378 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:22:42,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 04:22:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:42,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 04:22:42,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:22:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 04:22:43,264 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:22:43,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:22:43,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774197694] [2024-11-12 04:22:43,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774197694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:43,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:43,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:22:43,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203211184] [2024-11-12 04:22:43,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:43,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:22:43,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:22:43,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:22:43,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:43,267 INFO L87 Difference]: Start difference. First operand 157 states and 246 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:43,344 INFO L93 Difference]: Finished difference Result 256 states and 406 transitions. [2024-11-12 04:22:43,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:22:43,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 219 [2024-11-12 04:22:43,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:43,346 INFO L225 Difference]: With dead ends: 256 [2024-11-12 04:22:43,346 INFO L226 Difference]: Without dead ends: 167 [2024-11-12 04:22:43,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:43,348 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 18 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:43,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 264 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:22:43,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-12 04:22:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2024-11-12 04:22:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 86 states have (on average 1.255813953488372) internal successors, (108), 86 states have internal predecessors, (108), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 04:22:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 248 transitions. [2024-11-12 04:22:43,373 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 248 transitions. Word has length 219 [2024-11-12 04:22:43,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:43,373 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 248 transitions. [2024-11-12 04:22:43,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:43,374 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 248 transitions. [2024-11-12 04:22:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-12 04:22:43,375 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:43,375 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:43,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-12 04:22:43,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:22:43,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:43,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:43,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1041497660, now seen corresponding path program 1 times [2024-11-12 04:22:43,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:22:43,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92534183] [2024-11-12 04:22:43,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:43,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:22:43,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:22:43,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:22:43,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 04:22:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:43,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 04:22:43,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:22:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 04:22:44,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:22:44,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:22:44,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92534183] [2024-11-12 04:22:44,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92534183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:44,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:44,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:22:44,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567045880] [2024-11-12 04:22:44,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:44,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:22:44,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:22:44,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:22:44,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:22:44,223 INFO L87 Difference]: Start difference. First operand 159 states and 248 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:44,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:44,511 INFO L93 Difference]: Finished difference Result 345 states and 540 transitions. [2024-11-12 04:22:44,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:22:44,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 219 [2024-11-12 04:22:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:44,517 INFO L225 Difference]: With dead ends: 345 [2024-11-12 04:22:44,517 INFO L226 Difference]: Without dead ends: 256 [2024-11-12 04:22:44,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:22:44,521 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 103 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:44,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 415 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:22:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-12 04:22:44,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 244. [2024-11-12 04:22:44,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 135 states have (on average 1.288888888888889) internal successors, (174), 135 states have internal predecessors, (174), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-12 04:22:44,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 384 transitions. [2024-11-12 04:22:44,570 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 384 transitions. Word has length 219 [2024-11-12 04:22:44,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:44,573 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 384 transitions. [2024-11-12 04:22:44,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 04:22:44,574 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 384 transitions. [2024-11-12 04:22:44,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-12 04:22:44,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:44,575 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:44,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 04:22:44,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:22:44,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:44,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:44,779 INFO L85 PathProgramCache]: Analyzing trace with hash 850439842, now seen corresponding path program 1 times [2024-11-12 04:22:44,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:22:44,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836633064] [2024-11-12 04:22:44,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:44,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:22:44,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:22:44,784 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:22:44,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 04:22:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:45,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-12 04:22:45,138 INFO L279 TraceCheckSpWp]: Computing forward predicates...