./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_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 7e6a9890500b02becbe2374583823016242ae2e1be997dd1bfb050bacebdd67a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 03:18:24,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 03:18:24,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 03:18:24,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 03:18:24,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 03:18:24,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 03:18:24,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 03:18:24,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 03:18:24,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 03:18:24,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 03:18:24,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 03:18:24,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 03:18:24,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 03:18:24,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 03:18:24,665 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 03:18:24,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 03:18:24,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 03:18:24,665 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 03:18:24,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 03:18:24,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 03:18:24,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 03:18:24,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 03:18:24,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 03:18:24,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 03:18:24,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 03:18:24,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 03:18:24,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 03:18:24,669 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 03:18:24,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 03:18:24,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 03:18:24,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 03:18:24,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 03:18:24,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:18:24,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 03:18:24,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 03:18:24,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 03:18:24,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 03:18:24,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 03:18:24,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 03:18:24,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 03:18:24,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 03:18:24,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 03:18:24,673 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 -> 7e6a9890500b02becbe2374583823016242ae2e1be997dd1bfb050bacebdd67a [2024-11-20 03:18:24,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 03:18:24,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 03:18:24,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 03:18:24,991 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 03:18:24,992 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 03:18:24,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-92.i [2024-11-20 03:18:26,441 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 03:18:26,677 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 03:18:26,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-92.i [2024-11-20 03:18:26,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445975a4e/5976f1dbeda348de87e7d4a7d9f8aaad/FLAGea817c1ba [2024-11-20 03:18:27,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445975a4e/5976f1dbeda348de87e7d4a7d9f8aaad [2024-11-20 03:18:27,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 03:18:27,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 03:18:27,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 03:18:27,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 03:18:27,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 03:18:27,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:18:27" (1/1) ... [2024-11-20 03:18:27,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4413caf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:27, skipping insertion in model container [2024-11-20 03:18:27,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:18:27" (1/1) ... [2024-11-20 03:18:27,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 03:18:27,261 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_fillercodesize_ps-cn-10_file-92.i[915,928] [2024-11-20 03:18:27,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:18:27,367 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 03:18:27,383 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_fillercodesize_ps-cn-10_file-92.i[915,928] [2024-11-20 03:18:27,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:18:27,453 INFO L204 MainTranslator]: Completed translation [2024-11-20 03:18:27,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:27 WrapperNode [2024-11-20 03:18:27,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 03:18:27,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 03:18:27,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 03:18:27,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 03:18:27,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:27" (1/1) ... [2024-11-20 03:18:27,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:27" (1/1) ... [2024-11-20 03:18:27,507 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-20 03:18:27,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 03:18:27,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 03:18:27,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 03:18:27,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 03:18:27,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:27" (1/1) ... [2024-11-20 03:18:27,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:27" (1/1) ... [2024-11-20 03:18:27,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:27" (1/1) ... [2024-11-20 03:18:27,555 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-20 03:18:27,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:27" (1/1) ... [2024-11-20 03:18:27,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:27" (1/1) ... [2024-11-20 03:18:27,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:27" (1/1) ... [2024-11-20 03:18:27,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:27" (1/1) ... [2024-11-20 03:18:27,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:27" (1/1) ... [2024-11-20 03:18:27,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:27" (1/1) ... [2024-11-20 03:18:27,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 03:18:27,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 03:18:27,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 03:18:27,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 03:18:27,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:27" (1/1) ... [2024-11-20 03:18:27,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:18:27,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:18:27,633 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-20 03:18:27,636 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-20 03:18:27,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 03:18:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 03:18:27,679 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 03:18:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 03:18:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 03:18:27,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 03:18:27,764 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 03:18:27,766 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 03:18:28,170 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 03:18:28,171 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 03:18:28,189 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 03:18:28,190 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 03:18:28,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:18:28 BoogieIcfgContainer [2024-11-20 03:18:28,191 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 03:18:28,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 03:18:28,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 03:18:28,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 03:18:28,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:18:27" (1/3) ... [2024-11-20 03:18:28,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f9fa2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:18:28, skipping insertion in model container [2024-11-20 03:18:28,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:27" (2/3) ... [2024-11-20 03:18:28,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f9fa2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:18:28, skipping insertion in model container [2024-11-20 03:18:28,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:18:28" (3/3) ... [2024-11-20 03:18:28,201 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-92.i [2024-11-20 03:18:28,217 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 03:18:28,217 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 03:18:28,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 03:18:28,333 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;@45ec4e15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 03:18:28,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 03:18:28,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 03:18:28,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-20 03:18:28,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:18:28,359 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:18:28,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:18:28,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:18:28,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1751070667, now seen corresponding path program 1 times [2024-11-20 03:18:28,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:18:28,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516515673] [2024-11-20 03:18:28,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:18:28,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:18:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:18:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:18:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:18:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:18:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:18:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:18:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:18:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:18:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:18:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:18:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:18:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:18:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:18:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:18:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 03:18:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:18:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:18:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:18:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:18:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 03:18:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 03:18:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 03:18:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 03:18:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 03:18:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 03:18:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 03:18:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 03:18:28,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:18:28,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516515673] [2024-11-20 03:18:28,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516515673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:18:28,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:18:28,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 03:18:28,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497180216] [2024-11-20 03:18:28,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:18:28,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 03:18:28,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:18:28,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 03:18:28,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 03:18:28,960 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 03:18:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:18:28,995 INFO L93 Difference]: Finished difference Result 159 states and 274 transitions. [2024-11-20 03:18:28,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 03:18:28,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 166 [2024-11-20 03:18:28,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:18:29,003 INFO L225 Difference]: With dead ends: 159 [2024-11-20 03:18:29,003 INFO L226 Difference]: Without dead ends: 79 [2024-11-20 03:18:29,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-20 03:18:29,010 INFO L432 NwaCegarLoop]: 120 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, 120 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-20 03:18:29,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:18:29,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-20 03:18:29,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-20 03:18:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 03:18:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2024-11-20 03:18:29,062 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 166 [2024-11-20 03:18:29,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:18:29,062 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2024-11-20 03:18:29,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 03:18:29,063 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2024-11-20 03:18:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-20 03:18:29,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:18:29,067 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:18:29,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 03:18:29,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:18:29,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:18:29,069 INFO L85 PathProgramCache]: Analyzing trace with hash -559837639, now seen corresponding path program 1 times [2024-11-20 03:18:29,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:18:29,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201813662] [2024-11-20 03:18:29,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:18:29,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:18:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:18:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:18:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:18:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:18:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:18:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:18:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:18:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:18:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:18:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:18:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:18:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:18:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:18:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:18:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 03:18:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:18:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:18:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:18:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:18:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 03:18:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 03:18:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 03:18:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 03:18:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 03:18:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 03:18:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 03:18:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 03:18:29,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:18:29,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201813662] [2024-11-20 03:18:29,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201813662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:18:29,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:18:29,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 03:18:29,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963468952] [2024-11-20 03:18:29,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:18:29,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 03:18:29,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:18:29,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 03:18:29,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 03:18:29,636 INFO L87 Difference]: Start difference. First operand 79 states and 120 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 03:18:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:18:29,855 INFO L93 Difference]: Finished difference Result 156 states and 239 transitions. [2024-11-20 03:18:29,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 03:18:29,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-11-20 03:18:29,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:18:29,863 INFO L225 Difference]: With dead ends: 156 [2024-11-20 03:18:29,863 INFO L226 Difference]: Without dead ends: 80 [2024-11-20 03:18:29,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 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-20 03:18:29,868 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 119 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 03:18:29,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 171 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 03:18:29,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-20 03:18:29,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-20 03:18:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 03:18:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2024-11-20 03:18:29,887 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 166 [2024-11-20 03:18:29,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:18:29,889 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2024-11-20 03:18:29,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 03:18:29,889 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2024-11-20 03:18:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-20 03:18:29,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:18:29,892 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:18:29,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 03:18:29,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:18:29,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:18:29,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2146781755, now seen corresponding path program 1 times [2024-11-20 03:18:29,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:18:29,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397550379] [2024-11-20 03:18:29,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:18:29,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:18:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:18:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:18:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:18:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:18:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:18:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:18:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:18:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:18:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:18:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:18:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:18:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:18:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:18:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:18:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 03:18:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:18:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:18:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:18:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:18:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 03:18:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 03:18:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 03:18:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 03:18:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 03:18:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 03:18:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 03:18:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 03:18:30,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:18:30,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397550379] [2024-11-20 03:18:30,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397550379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:18:30,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:18:30,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 03:18:30,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015754613] [2024-11-20 03:18:30,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:18:30,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 03:18:30,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:18:30,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 03:18:30,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:18:30,447 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 03:18:30,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:18:30,791 INFO L93 Difference]: Finished difference Result 249 states and 376 transitions. [2024-11-20 03:18:30,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 03:18:30,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-11-20 03:18:30,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:18:30,794 INFO L225 Difference]: With dead ends: 249 [2024-11-20 03:18:30,795 INFO L226 Difference]: Without dead ends: 172 [2024-11-20 03:18:30,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 03:18:30,800 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 113 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 03:18:30,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 410 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 03:18:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-20 03:18:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 156. [2024-11-20 03:18:30,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 101 states have internal predecessors, (135), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 03:18:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 239 transitions. [2024-11-20 03:18:30,849 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 239 transitions. Word has length 166 [2024-11-20 03:18:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:18:30,849 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 239 transitions. [2024-11-20 03:18:30,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 03:18:30,850 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 239 transitions. [2024-11-20 03:18:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 03:18:30,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:18:30,856 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:18:30,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 03:18:30,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:18:30,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:18:30,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1566128219, now seen corresponding path program 1 times [2024-11-20 03:18:30,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:18:30,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763755676] [2024-11-20 03:18:30,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:18:30,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:18:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:18:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:18:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:18:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:18:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:18:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:18:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:18:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:18:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:18:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:18:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:18:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:18:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:18:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:18:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 03:18:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:18:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:18:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:18:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:18:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 03:18:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 03:18:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 03:18:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 03:18:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 03:18:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 03:18:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 03:18:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 03:18:31,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:18:31,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763755676] [2024-11-20 03:18:31,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763755676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:18:31,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:18:31,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 03:18:31,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681205520] [2024-11-20 03:18:31,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:18:31,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 03:18:31,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:18:31,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 03:18:31,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 03:18:31,954 INFO L87 Difference]: Start difference. First operand 156 states and 239 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 03:18:32,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:18:32,355 INFO L93 Difference]: Finished difference Result 398 states and 607 transitions. [2024-11-20 03:18:32,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 03:18:32,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2024-11-20 03:18:32,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:18:32,359 INFO L225 Difference]: With dead ends: 398 [2024-11-20 03:18:32,359 INFO L226 Difference]: Without dead ends: 245 [2024-11-20 03:18:32,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 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-20 03:18:32,361 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 59 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 03:18:32,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 455 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 03:18:32,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-20 03:18:32,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 227. [2024-11-20 03:18:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 145 states have (on average 1.3172413793103448) internal successors, (191), 145 states have internal predecessors, (191), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-20 03:18:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 347 transitions. [2024-11-20 03:18:32,435 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 347 transitions. Word has length 167 [2024-11-20 03:18:32,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:18:32,439 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 347 transitions. [2024-11-20 03:18:32,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 03:18:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 347 transitions. [2024-11-20 03:18:32,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-20 03:18:32,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:18:32,442 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:18:32,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 03:18:32,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:18:32,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:18:32,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1935848224, now seen corresponding path program 1 times [2024-11-20 03:18:32,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:18:32,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671241105] [2024-11-20 03:18:32,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:18:32,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:18:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:18:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:18:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:18:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:18:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:18:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:18:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:18:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:18:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:18:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:18:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:18:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:18:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:18:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:18:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 03:18:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:18:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:18:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:18:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:18:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 03:18:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 03:18:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 03:18:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 03:18:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 03:18:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 03:18:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 03:18:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 03:18:32,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:18:32,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671241105] [2024-11-20 03:18:32,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671241105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:18:32,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:18:32,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 03:18:32,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852048102] [2024-11-20 03:18:32,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:18:32,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 03:18:32,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:18:32,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 03:18:32,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 03:18:32,650 INFO L87 Difference]: Start difference. First operand 227 states and 347 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 03:18:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:18:32,770 INFO L93 Difference]: Finished difference Result 472 states and 713 transitions. [2024-11-20 03:18:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 03:18:32,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-11-20 03:18:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:18:32,777 INFO L225 Difference]: With dead ends: 472 [2024-11-20 03:18:32,778 INFO L226 Difference]: Without dead ends: 319 [2024-11-20 03:18:32,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-20 03:18:32,781 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 46 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 03:18:32,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 212 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 03:18:32,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-20 03:18:32,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2024-11-20 03:18:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 214 states have (on average 1.3271028037383177) internal successors, (284), 216 states have internal predecessors, (284), 94 states have call successors, (94), 6 states have call predecessors, (94), 6 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-20 03:18:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 472 transitions. [2024-11-20 03:18:32,856 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 472 transitions. Word has length 169 [2024-11-20 03:18:32,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:18:32,857 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 472 transitions. [2024-11-20 03:18:32,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 03:18:32,858 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 472 transitions. [2024-11-20 03:18:32,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-20 03:18:32,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:18:32,860 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:18:32,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 03:18:32,864 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:18:32,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:18:32,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1760732331, now seen corresponding path program 1 times [2024-11-20 03:18:32,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:18:32,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699246253] [2024-11-20 03:18:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:18:32,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:18:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 03:18:32,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [437037367] [2024-11-20 03:18:32,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:18:32,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 03:18:32,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:18:32,973 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-20 03:18:32,975 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-20 03:18:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 03:18:33,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 03:18:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 03:18:33,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 03:18:33,284 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 03:18:33,285 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 03:18:33,298 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-20 03:18:33,487 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,SelfDestructingSolverStorable5 [2024-11-20 03:18:33,491 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 03:18:33,623 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 03:18:33,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:18:33 BoogieIcfgContainer [2024-11-20 03:18:33,628 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 03:18:33,628 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 03:18:33,628 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 03:18:33,629 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 03:18:33,633 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:18:28" (3/4) ... [2024-11-20 03:18:33,635 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 03:18:33,638 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 03:18:33,638 INFO L158 Benchmark]: Toolchain (without parser) took 6618.54ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 118.7MB in the beginning and 74.4MB in the end (delta: 44.4MB). Peak memory consumption was 114.6MB. Max. memory is 16.1GB. [2024-11-20 03:18:33,639 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 03:18:33,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.43ms. Allocated memory is still 148.9MB. Free memory was 117.8MB in the beginning and 102.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 03:18:33,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.81ms. Allocated memory is still 148.9MB. Free memory was 102.1MB in the beginning and 97.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 03:18:33,640 INFO L158 Benchmark]: Boogie Preprocessor took 85.43ms. Allocated memory is still 148.9MB. Free memory was 97.9MB in the beginning and 91.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 03:18:33,640 INFO L158 Benchmark]: RCFGBuilder took 594.58ms. Allocated memory is still 148.9MB. Free memory was 91.6MB in the beginning and 65.3MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-20 03:18:33,641 INFO L158 Benchmark]: TraceAbstraction took 5435.19ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 64.4MB in the beginning and 75.4MB in the end (delta: -11.0MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2024-11-20 03:18:33,641 INFO L158 Benchmark]: Witness Printer took 9.54ms. Allocated memory is still 218.1MB. Free memory was 75.4MB in the beginning and 74.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 03:18:33,643 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.17ms. Allocated memory is still 117.4MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.43ms. Allocated memory is still 148.9MB. Free memory was 117.8MB in the beginning and 102.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.81ms. Allocated memory is still 148.9MB. Free memory was 102.1MB in the beginning and 97.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.43ms. Allocated memory is still 148.9MB. Free memory was 97.9MB in the beginning and 91.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 594.58ms. Allocated memory is still 148.9MB. Free memory was 91.6MB in the beginning and 65.3MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5435.19ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 64.4MB in the beginning and 75.4MB in the end (delta: -11.0MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. * Witness Printer took 9.54ms. Allocated memory is still 218.1MB. Free memory was 75.4MB in the beginning and 74.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 156. 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_24 = 8; [L41] signed long int var_1_25 = 64; [L42] unsigned long int var_1_26 = 1; [L43] signed short int var_1_27 = -32; [L44] signed short int var_1_28 = 10; [L45] signed long int var_1_29 = 4; [L46] unsigned char var_1_30 = 0; [L47] unsigned short int last_1_var_1_1 = 100; [L48] unsigned long int last_1_var_1_12 = 8; [L49] double last_1_var_1_13 = 8.25; [L50] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L160] isInitial = 1 [L161] FCALL initially() [L162] COND TRUE 1 [L163] CALL updateLastVariables() [L150] last_1_var_1_1 = var_1_1 [L151] last_1_var_1_12 = var_1_12 [L152] last_1_var_1_13 = var_1_13 [L153] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L163] RET updateLastVariables() [L164] CALL updateVariables() [L109] var_1_6 = __VERIFIER_nondet_uchar() [L110] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_7=0, var_1_8=10, var_1_9=0] [L110] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_7=0, var_1_8=10, var_1_9=0] [L111] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L111] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L112] var_1_7 = __VERIFIER_nondet_uchar() [L113] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_8=10, var_1_9=0] [L113] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_8=10, var_1_9=0] [L114] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L114] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L115] var_1_8 = __VERIFIER_nondet_ushort() [L116] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_9=0] [L116] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_9=0] [L117] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L117] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L118] var_1_9 = __VERIFIER_nondet_ushort() [L119] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769] [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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769] [L119] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769] [L120] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L120] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L121] var_1_10 = __VERIFIER_nondet_ushort() [L122] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L122] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L123] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L123] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L124] var_1_11 = __VERIFIER_nondet_ushort() [L125] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L125] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L126] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L126] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L127] var_1_14 = __VERIFIER_nondet_long() [L128] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L128] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L129] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L129] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L130] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L130] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L131] var_1_15 = __VERIFIER_nondet_double() [L132] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L132] 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_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L133] var_1_18 = __VERIFIER_nondet_char() [L134] 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=126, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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=126, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L134] 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=126, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L135] 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=126, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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=126, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L135] 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=126, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L136] var_1_19 = __VERIFIER_nondet_char() [L137] 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L137] 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L138] 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L138] 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L139] var_1_21 = __VERIFIER_nondet_long() [L140] 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L140] 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L141] 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L141] 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=8, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L142] var_1_24 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_24 >= 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L143] RET assume_abort_if_not(var_1_24 >= 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_24 <= 254) 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L144] RET assume_abort_if_not(var_1_24 <= 254) 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L145] var_1_30 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_30 >= 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_6=1, var_1_7=1, var_1_8=-32769, 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L146] RET assume_abort_if_not(var_1_30 >= 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L147] CALL assume_abort_if_not(var_1_30 <= 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L147] RET assume_abort_if_not(var_1_30 <= 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_24=1, var_1_25=64, var_1_26=1, var_1_27=-32, var_1_28=10, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L164] RET updateVariables() [L165] CALL step() [L54] var_1_23 = var_1_24 [L55] var_1_25 = var_1_24 [L56] var_1_26 = var_1_23 [L57] var_1_27 = var_1_24 [L58] var_1_28 = var_1_24 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L59] EXPR var_1_28 | var_1_25 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L59] COND FALSE !(((- var_1_23) > (var_1_28 | var_1_25)) && var_1_30) [L62] 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=1, 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=126, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L63] COND FALSE !((last_1_var_1_12 == last_1_var_1_1) && stepLocal_0) [L74] 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=126, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L76] 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=126, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L76] COND TRUE (((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16 [L77] COND TRUE \read(var_1_7) [L78] 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=126, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L81] var_1_17 = (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1))))) [L82] 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=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L83] COND TRUE \read(var_1_6) [L84] 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=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L92] unsigned char stepLocal_3 = var_1_6; [L93] 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=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L94] COND FALSE !(stepLocal_2 && (var_1_9 < (var_1_10 + var_1_20))) [L99] 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=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L101] 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=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L102] COND TRUE stepLocal_1 >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8))) [L103] 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=2, var_1_14=-1, var_1_15=2, var_1_16=32767, var_1_17=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L165] RET step() [L166] CALL, EXPR property() [L156] 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=2, var_1_14=-1, var_1_15=2, var_1_16=32767, var_1_17=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L156] 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=2, var_1_14=-1, var_1_15=2, var_1_16=32767, var_1_17=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L156] 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=2, var_1_14=-1, var_1_15=2, var_1_16=32767, var_1_17=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] [L156-L157] 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)))) ; [L166] RET, EXPR property() [L166] 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=2, var_1_14=-1, var_1_15=2, var_1_16=32767, var_1_17=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, 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=2, var_1_14=-1, var_1_15=2, var_1_16=32767, var_1_17=-121, var_1_18=126, var_1_19=126, var_1_1=32767, var_1_20=-536805377, var_1_21=536870911, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=4, var_1_30=0, var_1_6=1, var_1_7=1, var_1_8=-32769, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 337 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 337 mSDsluCounter, 1368 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 787 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 338 IncrementalHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 581 mSDtfsCounter, 338 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=315occurred in iteration=5, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 38 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1172 NumberOfCodeBlocks, 1172 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 3087 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6500/6500 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-20 03:18:33,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_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 7e6a9890500b02becbe2374583823016242ae2e1be997dd1bfb050bacebdd67a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 03:18:35,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 03:18:36,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 03:18:36,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 03:18:36,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 03:18:36,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 03:18:36,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 03:18:36,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 03:18:36,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 03:18:36,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 03:18:36,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 03:18:36,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 03:18:36,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 03:18:36,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 03:18:36,126 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 03:18:36,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 03:18:36,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 03:18:36,127 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 03:18:36,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 03:18:36,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 03:18:36,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 03:18:36,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 03:18:36,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 03:18:36,133 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 03:18:36,133 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 03:18:36,133 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 03:18:36,134 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 03:18:36,134 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 03:18:36,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 03:18:36,134 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 03:18:36,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 03:18:36,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 03:18:36,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 03:18:36,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 03:18:36,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:18:36,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 03:18:36,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 03:18:36,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 03:18:36,136 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 03:18:36,136 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 03:18:36,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 03:18:36,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 03:18:36,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 03:18:36,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 03:18:36,139 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 -> 7e6a9890500b02becbe2374583823016242ae2e1be997dd1bfb050bacebdd67a [2024-11-20 03:18:36,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 03:18:36,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 03:18:36,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 03:18:36,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 03:18:36,534 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 03:18:36,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-92.i [2024-11-20 03:18:38,164 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 03:18:38,366 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 03:18:38,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-92.i [2024-11-20 03:18:38,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8137acbb7/29cdcd06b0d644c0987ed02846be2656/FLAGf7396db33 [2024-11-20 03:18:38,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8137acbb7/29cdcd06b0d644c0987ed02846be2656 [2024-11-20 03:18:38,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 03:18:38,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 03:18:38,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 03:18:38,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 03:18:38,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 03:18:38,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:18:38" (1/1) ... [2024-11-20 03:18:38,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6452256f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:38, skipping insertion in model container [2024-11-20 03:18:38,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:18:38" (1/1) ... [2024-11-20 03:18:38,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 03:18:38,972 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_fillercodesize_ps-cn-10_file-92.i[915,928] [2024-11-20 03:18:39,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:18:39,078 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 03:18:39,092 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_fillercodesize_ps-cn-10_file-92.i[915,928] [2024-11-20 03:18:39,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:18:39,154 INFO L204 MainTranslator]: Completed translation [2024-11-20 03:18:39,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:39 WrapperNode [2024-11-20 03:18:39,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 03:18:39,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 03:18:39,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 03:18:39,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 03:18:39,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:39" (1/1) ... [2024-11-20 03:18:39,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:39" (1/1) ... [2024-11-20 03:18:39,210 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2024-11-20 03:18:39,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 03:18:39,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 03:18:39,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 03:18:39,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 03:18:39,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:39" (1/1) ... [2024-11-20 03:18:39,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:39" (1/1) ... [2024-11-20 03:18:39,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:39" (1/1) ... [2024-11-20 03:18:39,248 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-20 03:18:39,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:39" (1/1) ... [2024-11-20 03:18:39,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:39" (1/1) ... [2024-11-20 03:18:39,269 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:39" (1/1) ... [2024-11-20 03:18:39,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:39" (1/1) ... [2024-11-20 03:18:39,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:39" (1/1) ... [2024-11-20 03:18:39,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:39" (1/1) ... [2024-11-20 03:18:39,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 03:18:39,292 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 03:18:39,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 03:18:39,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 03:18:39,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:39" (1/1) ... [2024-11-20 03:18:39,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:18:39,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:18:39,330 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-20 03:18:39,333 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-20 03:18:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 03:18:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 03:18:39,393 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 03:18:39,393 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 03:18:39,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 03:18:39,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 03:18:39,491 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 03:18:39,495 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 03:18:39,876 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 03:18:39,877 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 03:18:39,898 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 03:18:39,899 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 03:18:39,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:18:39 BoogieIcfgContainer [2024-11-20 03:18:39,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 03:18:39,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 03:18:39,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 03:18:39,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 03:18:39,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:18:38" (1/3) ... [2024-11-20 03:18:39,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f46173a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:18:39, skipping insertion in model container [2024-11-20 03:18:39,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:39" (2/3) ... [2024-11-20 03:18:39,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f46173a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:18:39, skipping insertion in model container [2024-11-20 03:18:39,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:18:39" (3/3) ... [2024-11-20 03:18:39,911 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-92.i [2024-11-20 03:18:39,929 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 03:18:39,929 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 03:18:40,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 03:18:40,010 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;@55e59392, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 03:18:40,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 03:18:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 03:18:40,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-20 03:18:40,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:18:40,034 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:18:40,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:18:40,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:18:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash 45996136, now seen corresponding path program 1 times [2024-11-20 03:18:40,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:18:40,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752254628] [2024-11-20 03:18:40,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:18:40,062 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-20 03:18:40,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:18:40,069 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-20 03:18:40,096 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-20 03:18:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:40,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 03:18:40,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:18:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-20 03:18:40,464 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 03:18:40,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:18:40,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752254628] [2024-11-20 03:18:40,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752254628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:18:40,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:18:40,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 03:18:40,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170415182] [2024-11-20 03:18:40,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:18:40,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 03:18:40,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:18:40,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 03:18:40,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 03:18:40,498 INFO L87 Difference]: Start difference. First operand has 73 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 03:18:40,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:18:40,524 INFO L93 Difference]: Finished difference Result 139 states and 244 transitions. [2024-11-20 03:18:40,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 03:18:40,526 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 162 [2024-11-20 03:18:40,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:18:40,534 INFO L225 Difference]: With dead ends: 139 [2024-11-20 03:18:40,534 INFO L226 Difference]: Without dead ends: 69 [2024-11-20 03:18:40,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 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-20 03:18:40,540 INFO L432 NwaCegarLoop]: 105 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, 105 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-20 03:18:40,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:18:40,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-20 03:18:40,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-20 03:18:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 03:18:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 105 transitions. [2024-11-20 03:18:40,585 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 105 transitions. Word has length 162 [2024-11-20 03:18:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:18:40,586 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 105 transitions. [2024-11-20 03:18:40,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 03:18:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 105 transitions. [2024-11-20 03:18:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-20 03:18:40,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:18:40,590 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:18:40,601 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 (2)] Forceful destruction successful, exit code 0 [2024-11-20 03:18:40,791 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-20 03:18:40,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:18:40,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:18:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1912979348, now seen corresponding path program 1 times [2024-11-20 03:18:40,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:18:40,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534604667] [2024-11-20 03:18:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:18:40,794 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-20 03:18:40,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:18:40,796 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-20 03:18:40,797 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-20 03:18:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:40,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 03:18:40,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:18:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 03:18:41,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 03:18:41,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:18:41,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534604667] [2024-11-20 03:18:41,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534604667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:18:41,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:18:41,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 03:18:41,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060072593] [2024-11-20 03:18:41,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:18:41,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 03:18:41,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:18:41,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 03:18:41,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 03:18:41,118 INFO L87 Difference]: Start difference. First operand 69 states and 105 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 03:18:41,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:18:41,175 INFO L93 Difference]: Finished difference Result 180 states and 277 transitions. [2024-11-20 03:18:41,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 03:18:41,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-11-20 03:18:41,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:18:41,181 INFO L225 Difference]: With dead ends: 180 [2024-11-20 03:18:41,183 INFO L226 Difference]: Without dead ends: 114 [2024-11-20 03:18:41,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 160 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-20 03:18:41,186 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 100 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 03:18:41,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 244 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:18:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-20 03:18:41,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 69. [2024-11-20 03:18:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 03:18:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2024-11-20 03:18:41,211 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 162 [2024-11-20 03:18:41,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:18:41,215 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2024-11-20 03:18:41,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 03:18:41,216 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2024-11-20 03:18:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-20 03:18:41,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:18:41,218 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:18:41,229 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-20 03:18:41,423 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-20 03:18:41,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:18:41,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:18:41,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1370870698, now seen corresponding path program 1 times [2024-11-20 03:18:41,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:18:41,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283903615] [2024-11-20 03:18:41,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:18:41,426 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-20 03:18:41,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:18:41,429 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-20 03:18:41,430 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-20 03:18:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:41,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 03:18:41,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:18:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 03:18:42,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 03:18:42,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:18:42,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283903615] [2024-11-20 03:18:42,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283903615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:18:42,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:18:42,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 03:18:42,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864677675] [2024-11-20 03:18:42,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:18:42,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 03:18:42,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:18:42,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 03:18:42,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 03:18:42,104 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 03:18:42,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:18:42,452 INFO L93 Difference]: Finished difference Result 210 states and 316 transitions. [2024-11-20 03:18:42,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 03:18:42,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-11-20 03:18:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:18:42,458 INFO L225 Difference]: With dead ends: 210 [2024-11-20 03:18:42,459 INFO L226 Difference]: Without dead ends: 144 [2024-11-20 03:18:42,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 159 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-20 03:18:42,461 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 75 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 03:18:42,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 299 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 03:18:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-20 03:18:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 133. [2024-11-20 03:18:42,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 78 states have internal predecessors, (99), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 03:18:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 203 transitions. [2024-11-20 03:18:42,489 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 203 transitions. Word has length 162 [2024-11-20 03:18:42,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:18:42,489 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 203 transitions. [2024-11-20 03:18:42,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 03:18:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 203 transitions. [2024-11-20 03:18:42,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-20 03:18:42,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:18:42,492 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:18:42,505 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-20 03:18:42,692 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-20 03:18:42,693 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:18:42,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:18:42,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1675552450, now seen corresponding path program 1 times [2024-11-20 03:18:42,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:18:42,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226795519] [2024-11-20 03:18:42,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:18:42,695 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-20 03:18:42,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:18:42,698 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-20 03:18:42,699 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-20 03:18:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:42,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-20 03:18:42,992 INFO L278 TraceCheckSpWp]: Computing forward predicates...