./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.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 24ca5306f015ab172719330a0597265b0f70dab4b133299f4b32574bb8d8923a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:51:22,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:51:22,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 14:51:22,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:51:22,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:51:22,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:51:22,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:51:22,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:51:22,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:51:22,786 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:51:22,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:51:22,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:51:22,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:51:22,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:51:22,790 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:51:22,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:51:22,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:51:22,791 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:51:22,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 14:51:22,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:51:22,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:51:22,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:51:22,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:51:22,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:51:22,793 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:51:22,794 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:51:22,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:51:22,794 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:51:22,795 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:51:22,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:51:22,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:51:22,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:51:22,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:51:22,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:51:22,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:51:22,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:51:22,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 14:51:22,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 14:51:22,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:51:22,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:51:22,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:51:22,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:51:22,799 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 -> 24ca5306f015ab172719330a0597265b0f70dab4b133299f4b32574bb8d8923a [2024-11-16 14:51:23,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:51:23,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:51:23,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:51:23,064 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:51:23,064 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:51:23,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2024-11-16 14:51:24,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:51:24,742 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:51:24,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2024-11-16 14:51:24,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43ed5d8ba/0b0dd5619e3549f4923f226734de9889/FLAGa5cc05455 [2024-11-16 14:51:25,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43ed5d8ba/0b0dd5619e3549f4923f226734de9889 [2024-11-16 14:51:25,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:51:25,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:51:25,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:51:25,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:51:25,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:51:25,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:51:25" (1/1) ... [2024-11-16 14:51:25,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3353c96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:25, skipping insertion in model container [2024-11-16 14:51:25,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:51:25" (1/1) ... [2024-11-16 14:51:25,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:51:25,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i[919,932] [2024-11-16 14:51:25,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:51:25,412 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:51:25,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i[919,932] [2024-11-16 14:51:25,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:51:25,475 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:51:25,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:25 WrapperNode [2024-11-16 14:51:25,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:51:25,477 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:51:25,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:51:25,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:51:25,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:25" (1/1) ... [2024-11-16 14:51:25,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:25" (1/1) ... [2024-11-16 14:51:25,543 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-11-16 14:51:25,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:51:25,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:51:25,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:51:25,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:51:25,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:25" (1/1) ... [2024-11-16 14:51:25,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:25" (1/1) ... [2024-11-16 14:51:25,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:25" (1/1) ... [2024-11-16 14:51:25,583 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-16 14:51:25,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:25" (1/1) ... [2024-11-16 14:51:25,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:25" (1/1) ... [2024-11-16 14:51:25,594 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:25" (1/1) ... [2024-11-16 14:51:25,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:25" (1/1) ... [2024-11-16 14:51:25,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:25" (1/1) ... [2024-11-16 14:51:25,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:25" (1/1) ... [2024-11-16 14:51:25,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:51:25,602 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:51:25,605 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:51:25,605 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:51:25,606 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:25" (1/1) ... [2024-11-16 14:51:25,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:51:25,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:51:25,643 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-16 14:51:25,646 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-16 14:51:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:51:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:51:25,692 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:51:25,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 14:51:25,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:51:25,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:51:25,787 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:51:25,789 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:51:26,159 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-16 14:51:26,159 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:51:26,179 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:51:26,180 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:51:26,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:51:26 BoogieIcfgContainer [2024-11-16 14:51:26,180 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:51:26,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:51:26,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:51:26,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:51:26,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:51:25" (1/3) ... [2024-11-16 14:51:26,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f94febe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:51:26, skipping insertion in model container [2024-11-16 14:51:26,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:25" (2/3) ... [2024-11-16 14:51:26,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f94febe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:51:26, skipping insertion in model container [2024-11-16 14:51:26,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:51:26" (3/3) ... [2024-11-16 14:51:26,191 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2024-11-16 14:51:26,207 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:51:26,207 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:51:26,259 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:51:26,266 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;@4047b519, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:51:26,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:51:26,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:51:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-16 14:51:26,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:26,288 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:26,289 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:26,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash 798301520, now seen corresponding path program 1 times [2024-11-16 14:51:26,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:51:26,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86245564] [2024-11-16 14:51:26,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:26,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:51:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:51:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:51:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:51:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:51:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:51:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:51:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:51:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:51:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:51:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:51:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:51:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:51:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:51:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:51:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:51:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:51:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:51:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:51:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:51:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:51:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:51:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 14:51:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:51:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 14:51:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:51:26,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:51:26,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86245564] [2024-11-16 14:51:26,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86245564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:51:26,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:51:26,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:51:26,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856687328] [2024-11-16 14:51:26,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:51:26,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:51:26,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:51:26,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:51:26,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:51:26,825 INFO L87 Difference]: Start difference. First operand has 92 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:51:26,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:26,866 INFO L93 Difference]: Finished difference Result 176 states and 305 transitions. [2024-11-16 14:51:26,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:51:26,869 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 159 [2024-11-16 14:51:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:26,878 INFO L225 Difference]: With dead ends: 176 [2024-11-16 14:51:26,879 INFO L226 Difference]: Without dead ends: 87 [2024-11-16 14:51:26,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-16 14:51:26,888 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:51:26,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:51:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-16 14:51:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-16 14:51:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 61 states have internal predecessors, (87), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:51:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 135 transitions. [2024-11-16 14:51:27,023 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 135 transitions. Word has length 159 [2024-11-16 14:51:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:27,024 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 135 transitions. [2024-11-16 14:51:27,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:51:27,025 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 135 transitions. [2024-11-16 14:51:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-16 14:51:27,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:27,031 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:27,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 14:51:27,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:27,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:27,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1706269040, now seen corresponding path program 1 times [2024-11-16 14:51:27,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:51:27,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87323887] [2024-11-16 14:51:27,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:27,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:51:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:51:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:51:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:51:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:51:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:51:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:51:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:51:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:51:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:51:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:51:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:51:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:51:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:51:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:51:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:51:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:51:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:51:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:51:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:51:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:51:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:51:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 14:51:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:51:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 14:51:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:51:28,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:51:28,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87323887] [2024-11-16 14:51:28,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87323887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:51:28,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:51:28,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 14:51:28,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881405090] [2024-11-16 14:51:28,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:51:28,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 14:51:28,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:51:28,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 14:51:28,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:51:28,107 INFO L87 Difference]: Start difference. First operand 87 states and 135 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:51:28,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:28,212 INFO L93 Difference]: Finished difference Result 185 states and 284 transitions. [2024-11-16 14:51:28,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 14:51:28,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2024-11-16 14:51:28,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:28,217 INFO L225 Difference]: With dead ends: 185 [2024-11-16 14:51:28,219 INFO L226 Difference]: Without dead ends: 101 [2024-11-16 14:51:28,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:51:28,223 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 36 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:51:28,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 354 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:51:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-16 14:51:28,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2024-11-16 14:51:28,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 65 states have internal predecessors, (93), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:51:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 141 transitions. [2024-11-16 14:51:28,246 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 141 transitions. Word has length 159 [2024-11-16 14:51:28,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:28,248 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 141 transitions. [2024-11-16 14:51:28,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:51:28,248 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 141 transitions. [2024-11-16 14:51:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-16 14:51:28,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:28,255 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:28,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 14:51:28,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:28,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:28,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1677639889, now seen corresponding path program 1 times [2024-11-16 14:51:28,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:51:28,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471372557] [2024-11-16 14:51:28,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:28,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:51:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:51:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:51:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:51:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:51:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:51:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:51:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:51:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:51:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:51:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:51:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:51:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:51:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:51:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:51:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:51:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:51:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:51:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:51:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:51:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:51:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:51:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 14:51:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:51:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 14:51:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:28,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:51:28,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:51:28,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471372557] [2024-11-16 14:51:28,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471372557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:51:28,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:51:28,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 14:51:28,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550902958] [2024-11-16 14:51:28,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:51:28,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 14:51:28,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:51:28,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 14:51:28,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:51:28,723 INFO L87 Difference]: Start difference. First operand 91 states and 141 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:51:29,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:29,001 INFO L93 Difference]: Finished difference Result 269 states and 419 transitions. [2024-11-16 14:51:29,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 14:51:29,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2024-11-16 14:51:29,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:29,006 INFO L225 Difference]: With dead ends: 269 [2024-11-16 14:51:29,006 INFO L226 Difference]: Without dead ends: 181 [2024-11-16 14:51:29,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 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-16 14:51:29,010 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 125 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:51:29,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 450 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 14:51:29,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-16 14:51:29,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 157. [2024-11-16 14:51:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 106 states have internal predecessors, (150), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 14:51:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 246 transitions. [2024-11-16 14:51:29,053 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 246 transitions. Word has length 159 [2024-11-16 14:51:29,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:29,054 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 246 transitions. [2024-11-16 14:51:29,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:51:29,054 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 246 transitions. [2024-11-16 14:51:29,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-16 14:51:29,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:29,057 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:29,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 14:51:29,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:29,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:29,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1190450663, now seen corresponding path program 1 times [2024-11-16 14:51:29,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:51:29,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607819709] [2024-11-16 14:51:29,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:29,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:51:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:51:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:51:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:51:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:51:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:51:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:51:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:51:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:51:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:51:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:51:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:51:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:51:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:51:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:51:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:51:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:51:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:51:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:51:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:51:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:51:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:51:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 14:51:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:51:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 14:51:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 14:51:29,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:51:29,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607819709] [2024-11-16 14:51:29,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607819709] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:51:29,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624460998] [2024-11-16 14:51:29,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:29,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:51:29,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:51:29,689 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-16 14:51:29,691 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-16 14:51:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:29,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 14:51:29,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:51:30,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2024-11-16 14:51:30,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:51:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 14:51:30,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624460998] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:51:30,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:51:30,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2024-11-16 14:51:30,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198515193] [2024-11-16 14:51:30,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:51:30,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 14:51:30,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:51:30,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 14:51:30,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-16 14:51:30,957 INFO L87 Difference]: Start difference. First operand 157 states and 246 transitions. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-11-16 14:51:31,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:31,171 INFO L93 Difference]: Finished difference Result 269 states and 413 transitions. [2024-11-16 14:51:31,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 14:51:31,173 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) Word has length 160 [2024-11-16 14:51:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:31,199 INFO L225 Difference]: With dead ends: 269 [2024-11-16 14:51:31,199 INFO L226 Difference]: Without dead ends: 169 [2024-11-16 14:51:31,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 360 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2024-11-16 14:51:31,201 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 177 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:51:31,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 237 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:51:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-16 14:51:31,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2024-11-16 14:51:31,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 108 states have internal predecessors, (144), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 14:51:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 240 transitions. [2024-11-16 14:51:31,234 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 240 transitions. Word has length 160 [2024-11-16 14:51:31,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:31,235 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 240 transitions. [2024-11-16 14:51:31,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-11-16 14:51:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 240 transitions. [2024-11-16 14:51:31,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-16 14:51:31,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:31,237 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:31,257 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-16 14:51:31,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:51:31,439 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:31,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:31,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1960280210, now seen corresponding path program 1 times [2024-11-16 14:51:31,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:51:31,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173144719] [2024-11-16 14:51:31,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:31,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:51:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:51:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:51:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:51:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:51:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:51:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:51:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:51:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:51:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:51:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:51:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:51:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:51:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:51:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:51:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:51:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:51:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:51:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:51:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:51:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:51:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:51:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 14:51:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:51:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 14:51:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:51:31,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:51:31,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173144719] [2024-11-16 14:51:31,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173144719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:51:31,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:51:31,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 14:51:31,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159371764] [2024-11-16 14:51:31,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:51:31,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 14:51:31,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:51:31,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 14:51:31,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 14:51:31,977 INFO L87 Difference]: Start difference. First operand 161 states and 240 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:51:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:32,570 INFO L93 Difference]: Finished difference Result 583 states and 807 transitions. [2024-11-16 14:51:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 14:51:32,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-11-16 14:51:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:32,574 INFO L225 Difference]: With dead ends: 583 [2024-11-16 14:51:32,574 INFO L226 Difference]: Without dead ends: 495 [2024-11-16 14:51:32,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-16 14:51:32,575 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 645 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 14:51:32,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 352 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 14:51:32,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-16 14:51:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 408. [2024-11-16 14:51:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 304 states have (on average 1.3355263157894737) internal successors, (406), 308 states have internal predecessors, (406), 88 states have call successors, (88), 15 states have call predecessors, (88), 15 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-16 14:51:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 582 transitions. [2024-11-16 14:51:32,637 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 582 transitions. Word has length 161 [2024-11-16 14:51:32,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:32,638 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 582 transitions. [2024-11-16 14:51:32,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:51:32,639 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 582 transitions. [2024-11-16 14:51:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-16 14:51:32,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:32,642 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:32,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 14:51:32,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:32,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:32,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1988909361, now seen corresponding path program 1 times [2024-11-16 14:51:32,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:51:32,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023290246] [2024-11-16 14:51:32,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:32,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:51:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:51:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:51:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:51:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:51:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:51:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:51:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:51:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:51:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:51:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:51:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:51:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:51:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:51:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:51:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:51:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:51:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:51:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:51:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:51:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:51:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:51:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 14:51:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:51:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 14:51:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 27 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 14:51:33,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:51:33,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023290246] [2024-11-16 14:51:33,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023290246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:51:33,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169652011] [2024-11-16 14:51:33,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:33,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:51:33,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:51:33,100 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:51:33,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 14:51:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 14:51:33,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:51:33,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 465 proven. 18 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-11-16 14:51:33,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:51:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 51 proven. 18 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 14:51:33,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169652011] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:51:33,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:51:33,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 20 [2024-11-16 14:51:33,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33915280] [2024-11-16 14:51:33,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:51:33,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-16 14:51:33,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:51:33,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-16 14:51:33,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-11-16 14:51:33,926 INFO L87 Difference]: Start difference. First operand 408 states and 582 transitions. Second operand has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) [2024-11-16 14:51:35,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:35,776 INFO L93 Difference]: Finished difference Result 1532 states and 2094 transitions. [2024-11-16 14:51:35,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-16 14:51:35,777 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) Word has length 161 [2024-11-16 14:51:35,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:35,784 INFO L225 Difference]: With dead ends: 1532 [2024-11-16 14:51:35,785 INFO L226 Difference]: Without dead ends: 1217 [2024-11-16 14:51:35,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=677, Invalid=2629, Unknown=0, NotChecked=0, Total=3306 [2024-11-16 14:51:35,788 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 1114 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:51:35,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 829 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 14:51:35,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-11-16 14:51:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 875. [2024-11-16 14:51:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 660 states have (on average 1.3227272727272728) internal successors, (873), 673 states have internal predecessors, (873), 175 states have call successors, (175), 39 states have call predecessors, (175), 39 states have return successors, (175), 162 states have call predecessors, (175), 175 states have call successors, (175) [2024-11-16 14:51:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1223 transitions. [2024-11-16 14:51:35,879 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1223 transitions. Word has length 161 [2024-11-16 14:51:35,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:35,880 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1223 transitions. [2024-11-16 14:51:35,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) [2024-11-16 14:51:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1223 transitions. [2024-11-16 14:51:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 14:51:35,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:35,883 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:35,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 14:51:36,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 14:51:36,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:36,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:36,087 INFO L85 PathProgramCache]: Analyzing trace with hash -452507460, now seen corresponding path program 1 times [2024-11-16 14:51:36,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:51:36,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242753561] [2024-11-16 14:51:36,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:36,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:51:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:51:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:51:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:51:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:51:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:51:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:51:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:51:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:51:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:51:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:51:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:51:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:51:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:51:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:51:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:51:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:51:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:51:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:51:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:51:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:51:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:51:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 14:51:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:51:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 14:51:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 27 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 14:51:36,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:51:36,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242753561] [2024-11-16 14:51:36,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242753561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:51:36,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627854953] [2024-11-16 14:51:36,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:36,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:51:36,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:51:36,835 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:51:36,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 14:51:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:36,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 14:51:36,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:51:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 726 proven. 69 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-16 14:51:37,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:51:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-16 14:51:38,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627854953] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:51:38,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:51:38,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 29 [2024-11-16 14:51:38,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709290689] [2024-11-16 14:51:38,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:51:38,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-16 14:51:38,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:51:38,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-16 14:51:38,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-16 14:51:38,253 INFO L87 Difference]: Start difference. First operand 875 states and 1223 transitions. Second operand has 29 states, 29 states have (on average 4.448275862068965) internal successors, (129), 29 states have internal predecessors, (129), 9 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 9 states have call predecessors, (72), 9 states have call successors, (72) [2024-11-16 14:51:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:41,247 INFO L93 Difference]: Finished difference Result 2438 states and 3305 transitions. [2024-11-16 14:51:41,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-16 14:51:41,248 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.448275862068965) internal successors, (129), 29 states have internal predecessors, (129), 9 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 9 states have call predecessors, (72), 9 states have call successors, (72) Word has length 162 [2024-11-16 14:51:41,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:41,257 INFO L225 Difference]: With dead ends: 2438 [2024-11-16 14:51:41,257 INFO L226 Difference]: Without dead ends: 1670 [2024-11-16 14:51:41,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1008, Invalid=4248, Unknown=0, NotChecked=0, Total=5256 [2024-11-16 14:51:41,261 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 1356 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-16 14:51:41,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1363 Valid, 1098 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-16 14:51:41,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2024-11-16 14:51:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1331. [2024-11-16 14:51:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 979 states have (on average 1.2931562819203268) internal successors, (1266), 996 states have internal predecessors, (1266), 280 states have call successors, (280), 71 states have call predecessors, (280), 71 states have return successors, (280), 263 states have call predecessors, (280), 280 states have call successors, (280) [2024-11-16 14:51:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1826 transitions. [2024-11-16 14:51:41,424 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1826 transitions. Word has length 162 [2024-11-16 14:51:41,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:41,425 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1826 transitions. [2024-11-16 14:51:41,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.448275862068965) internal successors, (129), 29 states have internal predecessors, (129), 9 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 9 states have call predecessors, (72), 9 states have call successors, (72) [2024-11-16 14:51:41,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1826 transitions. [2024-11-16 14:51:41,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-16 14:51:41,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:41,427 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:41,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 14:51:41,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:51:41,632 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:41,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:41,633 INFO L85 PathProgramCache]: Analyzing trace with hash 972510252, now seen corresponding path program 1 times [2024-11-16 14:51:41,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:51:41,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590458241] [2024-11-16 14:51:41,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:41,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:51:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:51:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:51:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:51:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:51:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:51:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:51:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:51:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:51:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:51:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:51:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:51:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:51:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:51:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:51:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:51:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:51:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:51:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:51:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 14:51:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:51:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:51:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 14:51:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:51:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 14:51:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 27 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 14:51:41,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:51:41,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590458241] [2024-11-16 14:51:41,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590458241] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:51:41,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785546923] [2024-11-16 14:51:41,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:41,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:51:41,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:51:41,977 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:51:41,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 14:51:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:42,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 14:51:42,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:51:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 737 proven. 63 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-16 14:51:42,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:51:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 69 proven. 66 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-16 14:51:42,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785546923] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:51:42,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:51:42,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2024-11-16 14:51:42,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355211183] [2024-11-16 14:51:42,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:51:42,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-16 14:51:42,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:51:42,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-16 14:51:42,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-16 14:51:42,617 INFO L87 Difference]: Start difference. First operand 1331 states and 1826 transitions. Second operand has 20 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 7 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 7 states have call predecessors, (65), 7 states have call successors, (65) [2024-11-16 14:51:44,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:44,783 INFO L93 Difference]: Finished difference Result 3545 states and 4696 transitions. [2024-11-16 14:51:44,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-11-16 14:51:44,784 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 7 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 7 states have call predecessors, (65), 7 states have call successors, (65) Word has length 163 [2024-11-16 14:51:44,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:44,799 INFO L225 Difference]: With dead ends: 3545 [2024-11-16 14:51:44,800 INFO L226 Difference]: Without dead ends: 2337 [2024-11-16 14:51:44,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2616 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1518, Invalid=5964, Unknown=0, NotChecked=0, Total=7482 [2024-11-16 14:51:44,805 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 1566 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 580 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 580 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 14:51:44,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 506 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [580 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 14:51:44,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2024-11-16 14:51:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1885. [2024-11-16 14:51:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1382 states have (on average 1.272793053545586) internal successors, (1759), 1407 states have internal predecessors, (1759), 383 states have call successors, (383), 119 states have call predecessors, (383), 119 states have return successors, (383), 358 states have call predecessors, (383), 383 states have call successors, (383) [2024-11-16 14:51:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2525 transitions. [2024-11-16 14:51:45,032 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2525 transitions. Word has length 163 [2024-11-16 14:51:45,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:45,033 INFO L471 AbstractCegarLoop]: Abstraction has 1885 states and 2525 transitions. [2024-11-16 14:51:45,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 7 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 7 states have call predecessors, (65), 7 states have call successors, (65) [2024-11-16 14:51:45,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2525 transitions. [2024-11-16 14:51:45,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-16 14:51:45,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:45,035 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:45,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-16 14:51:45,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:51:45,240 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:45,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2041892086, now seen corresponding path program 1 times [2024-11-16 14:51:45,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:51:45,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223790589] [2024-11-16 14:51:45,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:45,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:51:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:51:45,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 14:51:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:51:45,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 14:51:45,525 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 14:51:45,525 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 14:51:45,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 14:51:45,529 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:51:45,655 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 14:51:45,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 02:51:45 BoogieIcfgContainer [2024-11-16 14:51:45,660 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 14:51:45,660 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 14:51:45,660 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 14:51:45,660 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 14:51:45,661 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:51:26" (3/4) ... [2024-11-16 14:51:45,664 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 14:51:45,665 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 14:51:45,665 INFO L158 Benchmark]: Toolchain (without parser) took 20556.18ms. Allocated memory was 165.7MB in the beginning and 453.0MB in the end (delta: 287.3MB). Free memory was 92.3MB in the beginning and 365.3MB in the end (delta: -272.9MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-16 14:51:45,666 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 165.7MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:51:45,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.57ms. Allocated memory is still 165.7MB. Free memory was 92.1MB in the beginning and 124.8MB in the end (delta: -32.6MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-11-16 14:51:45,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.98ms. Allocated memory is still 165.7MB. Free memory was 124.8MB in the beginning and 122.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 14:51:45,666 INFO L158 Benchmark]: Boogie Preprocessor took 56.57ms. Allocated memory is still 165.7MB. Free memory was 122.7MB in the beginning and 119.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 14:51:45,667 INFO L158 Benchmark]: IcfgBuilder took 578.94ms. Allocated memory is still 165.7MB. Free memory was 119.6MB in the beginning and 95.4MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-16 14:51:45,667 INFO L158 Benchmark]: TraceAbstraction took 19477.36ms. Allocated memory was 165.7MB in the beginning and 453.0MB in the end (delta: 287.3MB). Free memory was 94.4MB in the beginning and 366.3MB in the end (delta: -271.9MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-16 14:51:45,667 INFO L158 Benchmark]: Witness Printer took 4.94ms. Allocated memory is still 453.0MB. Free memory was 366.3MB in the beginning and 365.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:51:45,669 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.19ms. Allocated memory is still 165.7MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.57ms. Allocated memory is still 165.7MB. Free memory was 92.1MB in the beginning and 124.8MB in the end (delta: -32.6MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.98ms. Allocated memory is still 165.7MB. Free memory was 124.8MB in the beginning and 122.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.57ms. Allocated memory is still 165.7MB. Free memory was 122.7MB in the beginning and 119.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 578.94ms. Allocated memory is still 165.7MB. Free memory was 119.6MB in the beginning and 95.4MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19477.36ms. Allocated memory was 165.7MB in the beginning and 453.0MB in the end (delta: 287.3MB). Free memory was 94.4MB in the beginning and 366.3MB in the end (delta: -271.9MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Witness Printer took 4.94ms. Allocated memory is still 453.0MB. Free memory was 366.3MB in the beginning and 365.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 170, overapproximation of someUnaryDOUBLEoperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 184, overapproximation of someBinaryArithmeticFLOAToperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed char var_1_7 = 0; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 4; [L29] unsigned long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 1422462314; [L31] signed short int var_1_12 = 8; [L32] signed short int var_1_15 = -50; [L33] unsigned long int var_1_16 = 1; [L34] unsigned long int var_1_17 = 3609236770; [L35] unsigned long int var_1_18 = 2902762324; [L36] double var_1_19 = 3.8; [L37] double var_1_20 = 255.75; [L38] unsigned short int var_1_21 = 0; [L39] signed char var_1_22 = -8; [L40] signed long int var_1_23 = -32; [L41] unsigned char var_1_25 = 10; [L42] unsigned char var_1_27 = 128; [L43] float var_1_30 = 31.3; [L44] float var_1_32 = 15.25; [L45] double var_1_33 = 128.8; [L46] signed char var_1_34 = 4; [L47] signed char var_1_35 = 1; [L48] unsigned char var_1_36 = 16; [L49] unsigned long int last_1_var_1_10 = 128; [L50] unsigned long int last_1_var_1_16 = 1; [L51] double last_1_var_1_19 = 3.8; VAL [isInitial=0, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L188] isInitial = 1 [L189] FCALL initially() [L190] COND TRUE 1 [L191] CALL updateLastVariables() [L179] last_1_var_1_10 = var_1_10 [L180] last_1_var_1_16 = var_1_16 [L181] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L191] RET updateLastVariables() [L192] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L145] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L145] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L146] var_1_7 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L147] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L148] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L148] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L149] var_1_8 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L150] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L151] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L151] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L152] var_1_9 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L153] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L154] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L155] var_1_11 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L156] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L157] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L158] var_1_17 = __VERIFIER_nondet_ulong() [L159] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L159] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L160] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L161] var_1_18 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L162] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L163] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L164] var_1_20 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L165] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L166] var_1_27 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L167] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L168] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L169] var_1_32 = __VERIFIER_nondet_float() [L170] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L170] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L171] var_1_34 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L172] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L173] CALL assume_abort_if_not(var_1_34 <= 5) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L173] RET assume_abort_if_not(var_1_34 <= 5) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L174] var_1_35 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L175] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L176] CALL assume_abort_if_not(var_1_35 <= 4) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L176] RET assume_abort_if_not(var_1_35 <= 4) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L192] RET updateVariables() [L193] CALL step() [L55] var_1_22 = ((((-25) < 0 ) ? -(-25) : (-25))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L56] COND FALSE !(var_1_7 > var_1_12) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L63] EXPR var_1_12 >> var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L63] EXPR ((var_1_9) < ((var_1_12 >> var_1_7))) ? (var_1_9) : ((var_1_12 >> var_1_7)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L63] COND FALSE !(var_1_18 <= ((((var_1_9) < ((var_1_12 >> var_1_7))) ? (var_1_9) : ((var_1_12 >> var_1_7))))) [L66] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L70] COND TRUE \read(var_1_1) [L71] var_1_30 = ((((var_1_20) < ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32)))))) ? (var_1_20) : ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))))))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L73] COND FALSE !(var_1_9 >= var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L86] COND TRUE var_1_27 >= (var_1_9 + var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L87] COND TRUE (-0.95f * ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > var_1_20 [L88] var_1_36 = (var_1_27 - var_1_35) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=127, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L97] unsigned long int stepLocal_1 = last_1_var_1_16; [L98] unsigned long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=127, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L99] COND TRUE stepLocal_1 != last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=127, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L100] COND FALSE !(var_1_8 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=127, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L108] COND TRUE var_1_12 == var_1_12 [L109] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L111] var_1_1 = (var_1_2 || (! var_1_3)) [L112] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L113] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L114] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L115] COND FALSE !(var_1_19 >= var_1_19) [L120] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=1, var_1_17=6442450943, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L125] COND TRUE var_1_19 != var_1_19 [L126] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=6442450943, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L134] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_2=1, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=6442450943, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L135] COND TRUE (var_1_16 == (var_1_8 - var_1_9)) && stepLocal_2 [L136] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=6442450943, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L193] RET step() [L194] CALL, EXPR property() [L184-L185] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_12 == var_1_12) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((last_1_var_1_16 != last_1_var_1_10) ? ((var_1_8 <= last_1_var_1_16) ? (((- last_1_var_1_19) >= last_1_var_1_19) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_1 ? ((var_1_19 >= var_1_19) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_19 != var_1_19) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_4 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_16 == (var_1_8 - var_1_9)) && var_1_1) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=6442450943, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L194] RET, EXPR property() [L194] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=6442450943, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=6442450943, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=127, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 9, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5102 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5019 mSDsluCounter, 3958 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3135 mSDsCounter, 1706 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4397 IncrementalHoareTripleChecker+Invalid, 6103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1706 mSolverCounterUnsat, 823 mSDtfsCounter, 4397 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1934 GetRequests, 1688 SyntacticMatches, 1 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5022 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1885occurred in iteration=8, InterpolantAutomatonStates: 209, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 1262 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 2093 NumberOfCodeBlocks, 2093 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2560 ConstructedInterpolants, 0 QuantifiedInterpolants, 9271 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1544 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 17097/17664 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-16 14:51:45,710 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.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 24ca5306f015ab172719330a0597265b0f70dab4b133299f4b32574bb8d8923a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:51:47,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:51:48,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 14:51:48,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:51:48,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:51:48,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:51:48,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:51:48,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:51:48,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:51:48,050 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:51:48,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:51:48,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:51:48,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:51:48,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:51:48,055 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:51:48,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:51:48,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:51:48,056 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:51:48,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:51:48,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:51:48,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:51:48,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:51:48,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:51:48,058 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 14:51:48,059 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 14:51:48,059 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:51:48,059 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 14:51:48,059 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:51:48,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:51:48,060 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:51:48,061 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:51:48,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:51:48,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:51:48,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:51:48,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:51:48,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:51:48,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:51:48,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:51:48,064 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 14:51:48,064 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 14:51:48,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:51:48,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:51:48,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:51:48,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:51:48,065 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 -> 24ca5306f015ab172719330a0597265b0f70dab4b133299f4b32574bb8d8923a [2024-11-16 14:51:48,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:51:48,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:51:48,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:51:48,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:51:48,404 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:51:48,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2024-11-16 14:51:49,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:51:50,202 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:51:50,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2024-11-16 14:51:50,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e34dec7/822a69ed41c547c99f4764315e2c5e30/FLAG694fdb7c7 [2024-11-16 14:51:50,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e34dec7/822a69ed41c547c99f4764315e2c5e30 [2024-11-16 14:51:50,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:51:50,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:51:50,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:51:50,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:51:50,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:51:50,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:51:50" (1/1) ... [2024-11-16 14:51:50,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21640f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:50, skipping insertion in model container [2024-11-16 14:51:50,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:51:50" (1/1) ... [2024-11-16 14:51:50,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:51:50,478 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i[919,932] [2024-11-16 14:51:50,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:51:50,588 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:51:50,600 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i[919,932] [2024-11-16 14:51:50,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:51:50,667 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:51:50,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:50 WrapperNode [2024-11-16 14:51:50,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:51:50,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:51:50,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:51:50,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:51:50,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:50" (1/1) ... [2024-11-16 14:51:50,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:50" (1/1) ... [2024-11-16 14:51:50,728 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-11-16 14:51:50,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:51:50,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:51:50,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:51:50,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:51:50,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:50" (1/1) ... [2024-11-16 14:51:50,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:50" (1/1) ... [2024-11-16 14:51:50,752 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:50" (1/1) ... [2024-11-16 14:51:50,769 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-16 14:51:50,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:50" (1/1) ... [2024-11-16 14:51:50,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:50" (1/1) ... [2024-11-16 14:51:50,788 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:50" (1/1) ... [2024-11-16 14:51:50,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:50" (1/1) ... [2024-11-16 14:51:50,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:50" (1/1) ... [2024-11-16 14:51:50,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:50" (1/1) ... [2024-11-16 14:51:50,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:51:50,804 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:51:50,807 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:51:50,807 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:51:50,808 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:50" (1/1) ... [2024-11-16 14:51:50,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:51:50,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:51:50,838 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-16 14:51:50,843 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-16 14:51:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:51:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 14:51:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:51:50,881 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:51:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:51:50,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:51:50,983 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:51:50,986 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:51:52,567 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 14:51:52,567 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:51:52,582 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:51:52,582 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:51:52,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:51:52 BoogieIcfgContainer [2024-11-16 14:51:52,582 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:51:52,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:51:52,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:51:52,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:51:52,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:51:50" (1/3) ... [2024-11-16 14:51:52,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3653a9b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:51:52, skipping insertion in model container [2024-11-16 14:51:52,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:50" (2/3) ... [2024-11-16 14:51:52,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3653a9b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:51:52, skipping insertion in model container [2024-11-16 14:51:52,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:51:52" (3/3) ... [2024-11-16 14:51:52,589 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2024-11-16 14:51:52,607 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:51:52,607 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:51:52,673 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:51:52,680 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;@20b53ae7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:51:52,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:51:52,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:51:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-16 14:51:52,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:52,698 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:52,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:52,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:52,703 INFO L85 PathProgramCache]: Analyzing trace with hash 488926245, now seen corresponding path program 1 times [2024-11-16 14:51:52,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:51:52,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593159012] [2024-11-16 14:51:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:52,720 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-16 14:51:52,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:51:52,724 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-16 14:51:52,725 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-16 14:51:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:53,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 14:51:53,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:51:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2024-11-16 14:51:53,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:51:53,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:51:53,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593159012] [2024-11-16 14:51:53,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593159012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:51:53,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:51:53,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:51:53,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577644484] [2024-11-16 14:51:53,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:51:53,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:51:53,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:51:53,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:51:53,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:51:53,141 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:51:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:53,169 INFO L93 Difference]: Finished difference Result 160 states and 281 transitions. [2024-11-16 14:51:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:51:53,172 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2024-11-16 14:51:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:53,179 INFO L225 Difference]: With dead ends: 160 [2024-11-16 14:51:53,179 INFO L226 Difference]: Without dead ends: 79 [2024-11-16 14:51:53,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 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-16 14:51:53,186 INFO L432 NwaCegarLoop]: 122 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, 122 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-16 14:51:53,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:51:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-16 14:51:53,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-16 14:51:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:51:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 122 transitions. [2024-11-16 14:51:53,244 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 122 transitions. Word has length 157 [2024-11-16 14:51:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:53,246 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 122 transitions. [2024-11-16 14:51:53,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:51:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2024-11-16 14:51:53,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-16 14:51:53,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:53,250 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:53,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 14:51:53,451 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-16 14:51:53,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:53,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:53,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1134364005, now seen corresponding path program 1 times [2024-11-16 14:51:53,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:51:53,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452765333] [2024-11-16 14:51:53,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:53,454 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-16 14:51:53,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:51:53,456 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-16 14:51:53,457 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-16 14:51:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:53,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 14:51:53,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:51:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:51:54,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:51:54,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:51:54,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452765333] [2024-11-16 14:51:54,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452765333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:51:54,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:51:54,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:51:54,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400750882] [2024-11-16 14:51:54,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:51:54,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 14:51:54,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:51:54,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 14:51:54,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:51:54,791 INFO L87 Difference]: Start difference. First operand 79 states and 122 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:51:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:55,326 INFO L93 Difference]: Finished difference Result 233 states and 362 transitions. [2024-11-16 14:51:55,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 14:51:55,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-16 14:51:55,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:55,332 INFO L225 Difference]: With dead ends: 233 [2024-11-16 14:51:55,333 INFO L226 Difference]: Without dead ends: 157 [2024-11-16 14:51:55,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 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-16 14:51:55,335 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 98 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 14:51:55,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 410 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 14:51:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-16 14:51:55,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 137. [2024-11-16 14:51:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 14:51:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 214 transitions. [2024-11-16 14:51:55,375 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 214 transitions. Word has length 157 [2024-11-16 14:51:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:55,376 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 214 transitions. [2024-11-16 14:51:55,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:51:55,376 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 214 transitions. [2024-11-16 14:51:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-16 14:51:55,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:55,379 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:55,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 14:51:55,579 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-16 14:51:55,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:55,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:55,581 INFO L85 PathProgramCache]: Analyzing trace with hash 941198661, now seen corresponding path program 1 times [2024-11-16 14:51:55,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:51:55,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133941465] [2024-11-16 14:51:55,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:55,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:51:55,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:51:55,584 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-16 14:51:55,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 14:51:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:55,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 14:51:55,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:51:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2024-11-16 14:51:56,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:51:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 14:51:56,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:51:56,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133941465] [2024-11-16 14:51:56,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133941465] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:51:56,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 14:51:56,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-16 14:51:56,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941439375] [2024-11-16 14:51:56,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 14:51:56,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 14:51:56,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:51:56,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 14:51:56,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 14:51:56,450 INFO L87 Difference]: Start difference. First operand 137 states and 214 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-11-16 14:51:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:57,552 INFO L93 Difference]: Finished difference Result 239 states and 365 transitions. [2024-11-16 14:51:57,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 14:51:57,556 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 158 [2024-11-16 14:51:57,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:57,560 INFO L225 Difference]: With dead ends: 239 [2024-11-16 14:51:57,563 INFO L226 Difference]: Without dead ends: 153 [2024-11-16 14:51:57,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-16 14:51:57,565 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 123 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:51:57,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 205 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 14:51:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-16 14:51:57,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2024-11-16 14:51:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 92 states have internal predecessors, (118), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 14:51:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 214 transitions. [2024-11-16 14:51:57,623 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 214 transitions. Word has length 158 [2024-11-16 14:51:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:57,624 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 214 transitions. [2024-11-16 14:51:57,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-11-16 14:51:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 214 transitions. [2024-11-16 14:51:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-16 14:51:57,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:57,629 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:57,640 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-16 14:51:57,829 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-16 14:51:57,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:57,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:57,831 INFO L85 PathProgramCache]: Analyzing trace with hash 209436199, now seen corresponding path program 1 times [2024-11-16 14:51:57,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:51:57,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974170627] [2024-11-16 14:51:57,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:57,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:51:57,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:51:57,835 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-16 14:51:57,840 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-16 14:51:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:58,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 14:51:58,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:51:58,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:51:58,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:51:58,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:51:58,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974170627] [2024-11-16 14:51:58,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974170627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:51:58,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:51:58,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:51:58,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39916120] [2024-11-16 14:51:58,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:51:58,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:51:58,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:51:58,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:51:58,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:51:58,467 INFO L87 Difference]: Start difference. First operand 145 states and 214 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:52:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:52:02,056 INFO L93 Difference]: Finished difference Result 229 states and 338 transitions. [2024-11-16 14:52:02,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:52:02,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2024-11-16 14:52:02,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:52:02,059 INFO L225 Difference]: With dead ends: 229 [2024-11-16 14:52:02,059 INFO L226 Difference]: Without dead ends: 149 [2024-11-16 14:52:02,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:52:02,064 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 99 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-16 14:52:02,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 270 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-16 14:52:02,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-16 14:52:02,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2024-11-16 14:52:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 92 states have (on average 1.25) internal successors, (115), 92 states have internal predecessors, (115), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 14:52:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2024-11-16 14:52:02,094 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 159 [2024-11-16 14:52:02,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:52:02,095 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2024-11-16 14:52:02,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:52:02,096 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2024-11-16 14:52:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-16 14:52:02,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:02,098 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:52:02,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 14:52:02,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:52:02,299 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:02,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:02,299 INFO L85 PathProgramCache]: Analyzing trace with hash -684673434, now seen corresponding path program 1 times [2024-11-16 14:52:02,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:52:02,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714357176] [2024-11-16 14:52:02,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:02,300 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-16 14:52:02,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:52:02,302 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:52:02,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 14:52:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:02,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-16 14:52:02,494 INFO L278 TraceCheckSpWp]: Computing forward predicates...