./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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-pr-ci_file-4.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 3ad0527d8972158d721d810d47d1a1d5d2a58507963c43f16ffd283735cf830c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:27:20,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:27:20,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:27:20,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:27:20,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:27:20,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:27:20,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:27:20,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:27:20,573 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:27:20,573 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:27:20,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:27:20,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:27:20,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:27:20,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:27:20,579 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:27:20,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:27:20,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:27:20,580 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:27:20,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:27:20,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:27:20,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:27:20,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:27:20,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:27:20,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:27:20,582 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:27:20,582 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:27:20,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:27:20,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:27:20,583 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:27:20,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:27:20,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:27:20,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:27:20,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:27:20,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:27:20,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:27:20,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:27:20,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:27:20,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:27:20,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:27:20,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:27:20,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:27:20,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:27:20,586 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 -> 3ad0527d8972158d721d810d47d1a1d5d2a58507963c43f16ffd283735cf830c [2024-11-10 05:27:20,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:27:20,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:27:20,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:27:20,807 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:27:20,808 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:27:20,809 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-pr-ci_file-4.i [2024-11-10 05:27:22,068 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:27:22,264 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:27:22,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-4.i [2024-11-10 05:27:22,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2674e584f/e761de089ffc40be9b69f7e2be51c3e8/FLAG7d32d34be [2024-11-10 05:27:22,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2674e584f/e761de089ffc40be9b69f7e2be51c3e8 [2024-11-10 05:27:22,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:27:22,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:27:22,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:27:22,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:27:22,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:27:22,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:22" (1/1) ... [2024-11-10 05:27:22,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a87fee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:22, skipping insertion in model container [2024-11-10 05:27:22,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:22" (1/1) ... [2024-11-10 05:27:22,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:27:22,465 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-pr-ci_file-4.i[918,931] [2024-11-10 05:27:22,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:27:22,530 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:27:22,539 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-pr-ci_file-4.i[918,931] [2024-11-10 05:27:22,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:27:22,618 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:27:22,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:22 WrapperNode [2024-11-10 05:27:22,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:27:22,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:27:22,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:27:22,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:27:22,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:22" (1/1) ... [2024-11-10 05:27:22,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:22" (1/1) ... [2024-11-10 05:27:22,693 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 227 [2024-11-10 05:27:22,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:27:22,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:27:22,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:27:22,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:27:22,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:22" (1/1) ... [2024-11-10 05:27:22,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:22" (1/1) ... [2024-11-10 05:27:22,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:22" (1/1) ... [2024-11-10 05:27:22,725 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-10 05:27:22,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:22" (1/1) ... [2024-11-10 05:27:22,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:22" (1/1) ... [2024-11-10 05:27:22,742 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:22" (1/1) ... [2024-11-10 05:27:22,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:22" (1/1) ... [2024-11-10 05:27:22,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:22" (1/1) ... [2024-11-10 05:27:22,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:22" (1/1) ... [2024-11-10 05:27:22,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:27:22,757 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:27:22,757 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:27:22,757 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:27:22,758 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:22" (1/1) ... [2024-11-10 05:27:22,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:27:22,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:27:22,785 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-10 05:27:22,788 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-10 05:27:22,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:27:22,825 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:27:22,825 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:27:22,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:27:22,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:27:22,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:27:22,895 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:27:22,898 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:27:23,285 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 05:27:23,285 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:27:23,308 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:27:23,308 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:27:23,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:27:23 BoogieIcfgContainer [2024-11-10 05:27:23,309 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:27:23,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:27:23,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:27:23,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:27:23,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:27:22" (1/3) ... [2024-11-10 05:27:23,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2880f605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:27:23, skipping insertion in model container [2024-11-10 05:27:23,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:22" (2/3) ... [2024-11-10 05:27:23,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2880f605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:27:23, skipping insertion in model container [2024-11-10 05:27:23,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:27:23" (3/3) ... [2024-11-10 05:27:23,317 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-4.i [2024-11-10 05:27:23,331 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:27:23,331 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:27:23,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:27:23,394 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;@4e373574, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:27:23,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:27:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 69 states have internal predecessors, (98), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 05:27:23,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-10 05:27:23,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:23,411 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:27:23,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:23,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:23,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1706176457, now seen corresponding path program 1 times [2024-11-10 05:27:23,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:23,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190572964] [2024-11-10 05:27:23,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:23,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:27:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:27:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:27:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:27:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:27:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:27:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:27:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:27:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:27:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:27:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:27:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:27:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:27:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:27:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:27:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:27:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:27:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:27:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:27:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:27:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:27:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:27:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:27:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:27:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:27:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:27:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:27:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:27:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:27:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:27:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:27:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 05:27:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 05:27:23,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:23,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190572964] [2024-11-10 05:27:23,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190572964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:23,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:23,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:27:23,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406329063] [2024-11-10 05:27:23,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:23,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:27:23,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:23,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:27:23,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:27:23,920 INFO L87 Difference]: Start difference. First operand has 104 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 69 states have internal predecessors, (98), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 05:27:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:23,952 INFO L93 Difference]: Finished difference Result 200 states and 354 transitions. [2024-11-10 05:27:23,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:27:23,955 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 212 [2024-11-10 05:27:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:23,961 INFO L225 Difference]: With dead ends: 200 [2024-11-10 05:27:23,961 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 05:27:23,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-10 05:27:23,968 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:23,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:27:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 05:27:24,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-10 05:27:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.390625) internal successors, (89), 64 states have internal predecessors, (89), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 05:27:24,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 155 transitions. [2024-11-10 05:27:24,035 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 155 transitions. Word has length 212 [2024-11-10 05:27:24,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:24,037 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 155 transitions. [2024-11-10 05:27:24,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 05:27:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 155 transitions. [2024-11-10 05:27:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-10 05:27:24,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:24,041 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:27:24,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:27:24,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:24,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash 930814609, now seen corresponding path program 1 times [2024-11-10 05:27:24,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:24,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530017650] [2024-11-10 05:27:24,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:24,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:27:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:27:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:27:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:27:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:27:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:27:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:27:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:27:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:27:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:27:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:27:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:27:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:27:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:27:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:27:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:27:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:27:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:27:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:27:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:27:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:27:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:27:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:27:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:27:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:27:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:27:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:27:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:27:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:27:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:27:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:27:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 05:27:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 05:27:24,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:24,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530017650] [2024-11-10 05:27:24,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530017650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:24,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:24,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:27:24,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148428372] [2024-11-10 05:27:24,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:24,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:27:24,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:24,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:27:24,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:27:24,728 INFO L87 Difference]: Start difference. First operand 99 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 05:27:24,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:24,840 INFO L93 Difference]: Finished difference Result 291 states and 459 transitions. [2024-11-10 05:27:24,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:27:24,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2024-11-10 05:27:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:24,845 INFO L225 Difference]: With dead ends: 291 [2024-11-10 05:27:24,845 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 05:27:24,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:27:24,846 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 93 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:24,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 307 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:27:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 05:27:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2024-11-10 05:27:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 123 states have (on average 1.3902439024390243) internal successors, (171), 123 states have internal predecessors, (171), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 05:27:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 303 transitions. [2024-11-10 05:27:24,893 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 303 transitions. Word has length 213 [2024-11-10 05:27:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:24,893 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 303 transitions. [2024-11-10 05:27:24,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 05:27:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 303 transitions. [2024-11-10 05:27:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-10 05:27:24,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:24,897 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:27:24,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:27:24,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:24,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:24,898 INFO L85 PathProgramCache]: Analyzing trace with hash -634927900, now seen corresponding path program 1 times [2024-11-10 05:27:24,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:24,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597770570] [2024-11-10 05:27:24,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:24,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:27:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:27:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:27:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:27:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:27:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:27:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:27:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:27:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:27:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:27:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:27:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:27:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:27:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:27:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:27:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:27:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:27:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:27:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:27:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:27:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:27:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:27:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:27:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:27:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:27:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:27:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:27:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:27:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:27:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:27:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:27:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 05:27:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 05:27:25,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:25,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597770570] [2024-11-10 05:27:25,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597770570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:25,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:25,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:27:25,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490280847] [2024-11-10 05:27:25,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:25,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:27:25,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:25,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:27:25,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:27:25,759 INFO L87 Difference]: Start difference. First operand 192 states and 303 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 05:27:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:26,043 INFO L93 Difference]: Finished difference Result 640 states and 999 transitions. [2024-11-10 05:27:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 05:27:26,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-11-10 05:27:26,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:26,048 INFO L225 Difference]: With dead ends: 640 [2024-11-10 05:27:26,049 INFO L226 Difference]: Without dead ends: 451 [2024-11-10 05:27:26,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:27:26,051 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 235 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:26,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 619 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:27:26,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-10 05:27:26,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 386. [2024-11-10 05:27:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 249 states have (on average 1.3734939759036144) internal successors, (342), 249 states have internal predecessors, (342), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-10 05:27:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 606 transitions. [2024-11-10 05:27:26,110 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 606 transitions. Word has length 214 [2024-11-10 05:27:26,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:26,111 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 606 transitions. [2024-11-10 05:27:26,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 05:27:26,111 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 606 transitions. [2024-11-10 05:27:26,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-10 05:27:26,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:26,118 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:27:26,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 05:27:26,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:26,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:26,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1107882435, now seen corresponding path program 1 times [2024-11-10 05:27:26,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:26,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935598072] [2024-11-10 05:27:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:26,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:27:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:27:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:27:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:27:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:27:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:27:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:27:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:27:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:27:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:27:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:27:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:27:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:27:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:27:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:27:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:27:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:27:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:27:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:27:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:27:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:27:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:27:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:27:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:27:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:27:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:27:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:27:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:27:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:27:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:27:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:27:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 05:27:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 05:27:30,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:30,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935598072] [2024-11-10 05:27:30,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935598072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:30,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:30,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 05:27:30,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388048974] [2024-11-10 05:27:30,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:30,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 05:27:30,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:30,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 05:27:30,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 05:27:30,155 INFO L87 Difference]: Start difference. First operand 386 states and 606 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 05:27:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:30,877 INFO L93 Difference]: Finished difference Result 1042 states and 1604 transitions. [2024-11-10 05:27:30,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 05:27:30,878 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), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-11-10 05:27:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:30,884 INFO L225 Difference]: With dead ends: 1042 [2024-11-10 05:27:30,886 INFO L226 Difference]: Without dead ends: 659 [2024-11-10 05:27:30,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-10 05:27:30,889 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 168 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:30,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 635 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 05:27:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-10 05:27:30,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 576. [2024-11-10 05:27:30,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 427 states have (on average 1.4074941451990632) internal successors, (601), 431 states have internal predecessors, (601), 140 states have call successors, (140), 8 states have call predecessors, (140), 8 states have return successors, (140), 136 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-10 05:27:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 881 transitions. [2024-11-10 05:27:30,936 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 881 transitions. Word has length 214 [2024-11-10 05:27:30,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:30,938 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 881 transitions. [2024-11-10 05:27:30,938 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), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 05:27:30,938 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 881 transitions. [2024-11-10 05:27:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-10 05:27:30,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:30,940 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:27:30,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 05:27:30,941 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:30,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:30,941 INFO L85 PathProgramCache]: Analyzing trace with hash 263410564, now seen corresponding path program 1 times [2024-11-10 05:27:30,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:30,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237904063] [2024-11-10 05:27:30,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:30,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:27:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:27:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:27:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:27:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:27:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:27:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:27:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:27:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:27:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:27:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:27:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:27:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:27:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:27:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:27:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:27:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:27:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:27:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:27:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:27:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:27:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:27:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:27:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:27:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:27:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:27:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:27:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:27:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:27:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:27:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:27:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 05:27:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 05:27:31,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:31,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237904063] [2024-11-10 05:27:31,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237904063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:31,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:31,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:27:31,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338393059] [2024-11-10 05:27:31,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:31,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:27:31,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:31,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:27:31,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:27:31,315 INFO L87 Difference]: Start difference. First operand 576 states and 881 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 05:27:31,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:31,436 INFO L93 Difference]: Finished difference Result 1418 states and 2167 transitions. [2024-11-10 05:27:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:27:31,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-11-10 05:27:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:31,445 INFO L225 Difference]: With dead ends: 1418 [2024-11-10 05:27:31,445 INFO L226 Difference]: Without dead ends: 845 [2024-11-10 05:27:31,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:27:31,448 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 83 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:31,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 296 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:27:31,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-11-10 05:27:31,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 842. [2024-11-10 05:27:31,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 619 states have (on average 1.394184168012924) internal successors, (863), 625 states have internal predecessors, (863), 210 states have call successors, (210), 12 states have call predecessors, (210), 12 states have return successors, (210), 204 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-10 05:27:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1283 transitions. [2024-11-10 05:27:31,530 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1283 transitions. Word has length 214 [2024-11-10 05:27:31,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:31,530 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1283 transitions. [2024-11-10 05:27:31,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 05:27:31,532 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1283 transitions. [2024-11-10 05:27:31,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 05:27:31,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:31,535 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:27:31,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 05:27:31,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:31,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:31,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2007655374, now seen corresponding path program 1 times [2024-11-10 05:27:31,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:31,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593632419] [2024-11-10 05:27:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:31,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:27:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:27:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:27:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:27:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:27:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:27:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:27:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:27:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:27:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:27:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:27:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:27:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:27:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:27:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:27:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:27:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:27:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:27:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:27:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:27:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:27:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:27:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:27:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:27:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:27:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:27:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:27:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:27:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:27:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:27:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:27:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 05:27:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-10 05:27:31,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:31,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593632419] [2024-11-10 05:27:31,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593632419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:27:31,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772928664] [2024-11-10 05:27:31,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:31,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:27:31,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:27:31,921 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-10 05:27:31,922 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-10 05:27:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 05:27:32,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:27:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 386 proven. 87 refuted. 0 times theorem prover too weak. 1639 trivial. 0 not checked. [2024-11-10 05:27:32,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:27:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-10 05:27:32,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772928664] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:27:32,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 05:27:32,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 05:27:32,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454438694] [2024-11-10 05:27:32,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 05:27:32,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 05:27:32,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:32,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 05:27:32,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:27:32,606 INFO L87 Difference]: Start difference. First operand 842 states and 1283 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-10 05:27:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:32,814 INFO L93 Difference]: Finished difference Result 1285 states and 1927 transitions. [2024-11-10 05:27:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 05:27:32,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 215 [2024-11-10 05:27:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:32,818 INFO L225 Difference]: With dead ends: 1285 [2024-11-10 05:27:32,818 INFO L226 Difference]: Without dead ends: 446 [2024-11-10 05:27:32,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 492 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 05:27:32,822 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 129 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:32,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 261 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:27:32,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-10 05:27:32,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 422. [2024-11-10 05:27:32,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 277 states have (on average 1.2815884476534296) internal successors, (355), 277 states have internal predecessors, (355), 132 states have call successors, (132), 12 states have call predecessors, (132), 12 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-10 05:27:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 619 transitions. [2024-11-10 05:27:32,855 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 619 transitions. Word has length 215 [2024-11-10 05:27:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:32,856 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 619 transitions. [2024-11-10 05:27:32,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-10 05:27:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 619 transitions. [2024-11-10 05:27:32,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 05:27:32,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:32,858 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:27:32,873 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-10 05:27:33,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 05:27:33,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:33,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:33,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1414927197, now seen corresponding path program 1 times [2024-11-10 05:27:33,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:33,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794339092] [2024-11-10 05:27:33,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:33,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:27:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:27:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:27:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:27:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:27:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:27:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:27:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:27:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:27:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:27:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:27:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:27:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:27:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:27:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:27:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:27:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:27:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:27:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:27:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:27:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:27:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:27:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:27:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:27:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:27:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:27:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:27:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:27:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:27:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:27:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:27:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 05:27:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 05:27:33,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:33,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794339092] [2024-11-10 05:27:33,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794339092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:33,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:33,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:27:33,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413763502] [2024-11-10 05:27:33,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:33,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:27:33,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:33,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:27:33,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:27:33,284 INFO L87 Difference]: Start difference. First operand 422 states and 619 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 05:27:33,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:33,521 INFO L93 Difference]: Finished difference Result 842 states and 1241 transitions. [2024-11-10 05:27:33,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:27:33,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2024-11-10 05:27:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:33,526 INFO L225 Difference]: With dead ends: 842 [2024-11-10 05:27:33,526 INFO L226 Difference]: Without dead ends: 619 [2024-11-10 05:27:33,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:27:33,527 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 166 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:33,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 535 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:27:33,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-10 05:27:33,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 610. [2024-11-10 05:27:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 393 states have (on average 1.27735368956743) internal successors, (502), 393 states have internal predecessors, (502), 198 states have call successors, (198), 18 states have call predecessors, (198), 18 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2024-11-10 05:27:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 898 transitions. [2024-11-10 05:27:33,587 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 898 transitions. Word has length 215 [2024-11-10 05:27:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:33,588 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 898 transitions. [2024-11-10 05:27:33,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 05:27:33,588 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 898 transitions. [2024-11-10 05:27:33,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 05:27:33,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:33,590 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:27:33,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 05:27:33,590 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:33,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:33,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1708330204, now seen corresponding path program 1 times [2024-11-10 05:27:33,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:33,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000378917] [2024-11-10 05:27:33,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:33,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:27:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:27:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:27:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:27:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:27:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:27:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:27:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:27:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:27:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:27:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:27:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:27:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:27:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:27:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:27:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:27:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:27:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:27:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:27:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:27:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:27:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:27:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:27:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:27:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:27:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:27:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:27:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:27:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:27:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:27:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:27:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 05:27:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 51 proven. 135 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [2024-11-10 05:27:34,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:34,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000378917] [2024-11-10 05:27:34,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000378917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:27:34,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679085018] [2024-11-10 05:27:34,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:34,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:27:34,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:27:34,482 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-10 05:27:34,483 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-10 05:27:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:34,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-10 05:27:34,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:27:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1325 proven. 327 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2024-11-10 05:27:37,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:27:52,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679085018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:27:52,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 05:27:52,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22] total 30 [2024-11-10 05:27:52,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493501906] [2024-11-10 05:27:52,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 05:27:52,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 05:27:52,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:52,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 05:27:52,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2024-11-10 05:27:52,004 INFO L87 Difference]: Start difference. First operand 610 states and 898 transitions. Second operand has 30 states, 30 states have (on average 4.033333333333333) internal successors, (121), 28 states have internal predecessors, (121), 10 states have call successors, (66), 8 states have call predecessors, (66), 12 states have return successors, (66), 10 states have call predecessors, (66), 10 states have call successors, (66) [2024-11-10 05:27:56,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:56,024 INFO L93 Difference]: Finished difference Result 1765 states and 2382 transitions. [2024-11-10 05:27:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-11-10 05:27:56,027 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.033333333333333) internal successors, (121), 28 states have internal predecessors, (121), 10 states have call successors, (66), 8 states have call predecessors, (66), 12 states have return successors, (66), 10 states have call predecessors, (66), 10 states have call successors, (66) Word has length 215 [2024-11-10 05:27:56,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:56,034 INFO L225 Difference]: With dead ends: 1765 [2024-11-10 05:27:56,034 INFO L226 Difference]: Without dead ends: 1158 [2024-11-10 05:27:56,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4960 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=3655, Invalid=12095, Unknown=0, NotChecked=0, Total=15750 [2024-11-10 05:27:56,039 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1120 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:56,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 749 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 05:27:56,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-10 05:27:56,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 936. [2024-11-10 05:27:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 611 states have (on average 1.1751227495908347) internal successors, (718), 613 states have internal predecessors, (718), 246 states have call successors, (246), 78 states have call predecessors, (246), 78 states have return successors, (246), 244 states have call predecessors, (246), 246 states have call successors, (246) [2024-11-10 05:27:56,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1210 transitions. [2024-11-10 05:27:56,119 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1210 transitions. Word has length 215 [2024-11-10 05:27:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:56,119 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1210 transitions. [2024-11-10 05:27:56,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.033333333333333) internal successors, (121), 28 states have internal predecessors, (121), 10 states have call successors, (66), 8 states have call predecessors, (66), 12 states have return successors, (66), 10 states have call predecessors, (66), 10 states have call successors, (66) [2024-11-10 05:27:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1210 transitions. [2024-11-10 05:27:56,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 05:27:56,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:56,123 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:27:56,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 05:27:56,323 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,SelfDestructingSolverStorable7 [2024-11-10 05:27:56,324 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:56,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:56,324 INFO L85 PathProgramCache]: Analyzing trace with hash -630065183, now seen corresponding path program 1 times [2024-11-10 05:27:56,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:56,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215200537] [2024-11-10 05:27:56,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:56,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:27:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:27:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:27:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:27:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:27:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:27:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:27:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:27:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:27:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:27:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:27:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:27:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:27:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:27:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:27:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:27:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:27:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:27:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:27:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:27:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:27:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:27:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:27:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:27:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:27:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:27:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:27:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:27:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:27:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:27:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:27:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 05:27:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-10 05:27:56,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:56,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215200537] [2024-11-10 05:27:56,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215200537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:27:56,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302462198] [2024-11-10 05:27:56,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:56,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:27:56,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:27:56,664 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-10 05:27:56,665 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-10 05:27:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 05:27:56,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:27:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 158 proven. 93 refuted. 0 times theorem prover too weak. 1861 trivial. 0 not checked. [2024-11-10 05:27:57,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:27:57,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-10 05:27:57,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302462198] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:27:57,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 05:27:57,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-10 05:27:57,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814111825] [2024-11-10 05:27:57,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 05:27:57,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 05:27:57,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:57,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 05:27:57,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 05:27:57,343 INFO L87 Difference]: Start difference. First operand 936 states and 1210 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-10 05:27:57,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:57,995 INFO L93 Difference]: Finished difference Result 1964 states and 2515 transitions. [2024-11-10 05:27:57,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 05:27:57,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) Word has length 215 [2024-11-10 05:27:57,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:58,001 INFO L225 Difference]: With dead ends: 1964 [2024-11-10 05:27:58,001 INFO L226 Difference]: Without dead ends: 1031 [2024-11-10 05:27:58,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 490 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-10 05:27:58,005 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 207 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:58,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 819 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 05:27:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2024-11-10 05:27:58,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 941. [2024-11-10 05:27:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 616 states have (on average 1.1737012987012987) internal successors, (723), 618 states have internal predecessors, (723), 246 states have call successors, (246), 78 states have call predecessors, (246), 78 states have return successors, (246), 244 states have call predecessors, (246), 246 states have call successors, (246) [2024-11-10 05:27:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1215 transitions. [2024-11-10 05:27:58,094 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1215 transitions. Word has length 215 [2024-11-10 05:27:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:58,094 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1215 transitions. [2024-11-10 05:27:58,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-10 05:27:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1215 transitions. [2024-11-10 05:27:58,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 05:27:58,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:58,098 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:27:58,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 05:27:58,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:27:58,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:58,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:58,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1112745152, now seen corresponding path program 1 times [2024-11-10 05:27:58,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:58,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143272087] [2024-11-10 05:27:58,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:58,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:27:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:27:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:27:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:27:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:27:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:27:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 05:27:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:27:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:27:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:27:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:27:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:27:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:27:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:27:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:27:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:27:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:27:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:27:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:27:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:27:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 05:27:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:27:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 05:27:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:27:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:27:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:27:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:27:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:27:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:27:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:27:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:27:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 05:27:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 05:27:58,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:58,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143272087] [2024-11-10 05:27:58,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143272087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:58,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:58,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:27:58,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431897034] [2024-11-10 05:27:58,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:58,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:27:58,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:58,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:27:58,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:27:58,432 INFO L87 Difference]: Start difference. First operand 941 states and 1215 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 05:27:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:58,520 INFO L93 Difference]: Finished difference Result 1563 states and 2018 transitions. [2024-11-10 05:27:58,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:27:58,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2024-11-10 05:27:58,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:58,525 INFO L225 Difference]: With dead ends: 1563 [2024-11-10 05:27:58,525 INFO L226 Difference]: Without dead ends: 610 [2024-11-10 05:27:58,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:27:58,528 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 135 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:58,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 274 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:27:58,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-10 05:27:58,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 604. [2024-11-10 05:27:58,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 398 states have (on average 1.1658291457286432) internal successors, (464), 399 states have internal predecessors, (464), 156 states have call successors, (156), 49 states have call predecessors, (156), 49 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-10 05:27:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 776 transitions. [2024-11-10 05:27:58,606 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 776 transitions. Word has length 215 [2024-11-10 05:27:58,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:58,606 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 776 transitions. [2024-11-10 05:27:58,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 05:27:58,606 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 776 transitions. [2024-11-10 05:27:58,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-10 05:27:58,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:58,607 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:27:58,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 05:27:58,607 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:58,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:58,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1264182970, now seen corresponding path program 1 times [2024-11-10 05:27:58,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:58,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471096607] [2024-11-10 05:27:58,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:58,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 05:27:58,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1199028439] [2024-11-10 05:27:58,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:58,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:27:58,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:27:58,756 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-10 05:27:58,756 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-10 05:27:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:27:58,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 05:27:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:27:59,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 05:27:59,100 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 05:27:59,102 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 05:27:59,113 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-10 05:27:59,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:27:59,307 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:27:59,413 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 05:27:59,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:27:59 BoogieIcfgContainer [2024-11-10 05:27:59,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 05:27:59,419 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 05:27:59,419 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 05:27:59,419 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 05:27:59,419 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:27:23" (3/4) ... [2024-11-10 05:27:59,421 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 05:27:59,422 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 05:27:59,422 INFO L158 Benchmark]: Toolchain (without parser) took 37125.49ms. Allocated memory was 180.4MB in the beginning and 578.8MB in the end (delta: 398.5MB). Free memory was 107.9MB in the beginning and 330.0MB in the end (delta: -222.0MB). Peak memory consumption was 178.2MB. Max. memory is 16.1GB. [2024-11-10 05:27:59,422 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 180.4MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:27:59,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.90ms. Allocated memory is still 180.4MB. Free memory was 107.7MB in the beginning and 150.0MB in the end (delta: -42.3MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-11-10 05:27:59,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.69ms. Allocated memory is still 180.4MB. Free memory was 150.0MB in the beginning and 145.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 05:27:59,423 INFO L158 Benchmark]: Boogie Preprocessor took 62.28ms. Allocated memory is still 180.4MB. Free memory was 145.8MB in the beginning and 140.7MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 05:27:59,423 INFO L158 Benchmark]: IcfgBuilder took 551.83ms. Allocated memory is still 180.4MB. Free memory was 140.7MB in the beginning and 110.5MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-10 05:27:59,423 INFO L158 Benchmark]: TraceAbstraction took 36107.81ms. Allocated memory was 180.4MB in the beginning and 578.8MB in the end (delta: 398.5MB). Free memory was 110.5MB in the beginning and 330.0MB in the end (delta: -219.4MB). Peak memory consumption was 181.6MB. Max. memory is 16.1GB. [2024-11-10 05:27:59,423 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 578.8MB. Free memory is still 330.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:27:59,424 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.15ms. Allocated memory is still 180.4MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.90ms. Allocated memory is still 180.4MB. Free memory was 107.7MB in the beginning and 150.0MB in the end (delta: -42.3MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.69ms. Allocated memory is still 180.4MB. Free memory was 150.0MB in the beginning and 145.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.28ms. Allocated memory is still 180.4MB. Free memory was 145.8MB in the beginning and 140.7MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 551.83ms. Allocated memory is still 180.4MB. Free memory was 140.7MB in the beginning and 110.5MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 36107.81ms. Allocated memory was 180.4MB in the beginning and 578.8MB in the end (delta: 398.5MB). Free memory was 110.5MB in the beginning and 330.0MB in the end (delta: -219.4MB). Peak memory consumption was 181.6MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 578.8MB. Free memory is still 330.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 202, overapproximation of someBinaryArithmeticDOUBLEoperation at line 127. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] signed char var_1_23 = 1; [L40] signed char var_1_24 = 2; [L41] signed short int var_1_25 = -500; [L42] signed char var_1_26 = -2; [L43] signed char var_1_29 = 10; [L44] double var_1_30 = 0.5; [L45] unsigned char var_1_34 = 2; [L46] unsigned char var_1_35 = 4; [L47] signed long int var_1_36 = -256; [L48] unsigned short int var_1_37 = 64; [L49] unsigned short int var_1_38 = 57633; [L50] unsigned short int var_1_39 = 28505; [L51] signed short int var_1_40 = 64; [L52] signed char var_1_41 = -100; [L53] unsigned short int var_1_42 = 5; [L54] signed char var_1_43 = 100; [L55] unsigned short int last_1_var_1_6 = 4; [L56] unsigned short int last_1_var_1_9 = 4; [L57] unsigned long int last_1_var_1_14 = 500; [L58] signed short int last_1_var_1_17 = 16; VAL [isInitial=0, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L206] isInitial = 1 [L207] FCALL initially() [L208] COND TRUE 1 [L209] CALL updateLastVariables() [L196] last_1_var_1_6 = var_1_6 [L197] last_1_var_1_9 = var_1_9 [L198] last_1_var_1_14 = var_1_14 [L199] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L209] RET updateLastVariables() [L210] CALL updateVariables() [L144] var_1_4 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_5=0, var_1_6=4, var_1_9=4] [L145] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_5=0, var_1_6=4, var_1_9=4] [L146] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L146] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] var_1_5 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_6=4, var_1_9=4] [L148] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_6=4, var_1_9=4] [L149] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L149] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] var_1_10 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L151] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] var_1_12 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L154] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] var_1_13 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L157] var_1_15 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L159] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L159] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L160] var_1_16 = __VERIFIER_nondet_ulong() [L161] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L161] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L162] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L162] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L163] var_1_19 = __VERIFIER_nondet_short() [L164] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L164] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L165] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L165] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L166] var_1_20 = __VERIFIER_nondet_short() [L167] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L167] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L168] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L168] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L169] var_1_21 = __VERIFIER_nondet_short() [L170] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L170] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L171] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L171] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L172] var_1_22 = __VERIFIER_nondet_short() [L173] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L173] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L174] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L174] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L175] var_1_24 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_24 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L176] RET assume_abort_if_not(var_1_24 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L177] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L177] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L178] var_1_29 = __VERIFIER_nondet_char() [L179] CALL assume_abort_if_not(var_1_29 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L179] RET assume_abort_if_not(var_1_29 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L180] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L180] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L181] var_1_35 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L182] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L183] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L183] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L184] var_1_38 = __VERIFIER_nondet_ushort() [L185] CALL assume_abort_if_not(var_1_38 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L185] RET assume_abort_if_not(var_1_38 >= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L186] CALL assume_abort_if_not(var_1_38 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L186] RET assume_abort_if_not(var_1_38 <= 65535) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L187] var_1_39 = __VERIFIER_nondet_ushort() [L188] CALL assume_abort_if_not(var_1_39 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L188] RET assume_abort_if_not(var_1_39 >= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L189] CALL assume_abort_if_not(var_1_39 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L189] RET assume_abort_if_not(var_1_39 <= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L190] var_1_41 = __VERIFIER_nondet_char() [L191] CALL assume_abort_if_not(var_1_41 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=1, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=1, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L191] RET assume_abort_if_not(var_1_41 >= -128) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=1, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L192] CALL assume_abort_if_not(var_1_41 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=1, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=1, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L192] RET assume_abort_if_not(var_1_41 <= 127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=1, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L193] CALL assume_abort_if_not(var_1_41 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=1, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=1, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L193] RET assume_abort_if_not(var_1_41 != 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=1, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L210] RET updateVariables() [L211] CALL step() [L62] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=1, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L63] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=1, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L68] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=1, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L69] COND TRUE (- var_1_13) >= var_1_12 [L70] var_1_26 = ((((var_1_24) > (var_1_29)) ? (var_1_24) : (var_1_29))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=-500, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=1, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L72] EXPR var_1_14 ^ (var_1_20 % var_1_41) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=-500, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=64, var_1_41=1, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L72] COND FALSE !(var_1_24 >= (var_1_14 ^ (var_1_20 % var_1_41))) [L81] var_1_40 = var_1_17 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=-500, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L83] var_1_43 = var_1_24 [L84] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=5, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=-500, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=5, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L85] COND TRUE last_1_var_1_14 >= stepLocal_3 [L86] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=5, var_1_11=78/5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=-500, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=5, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L88] var_1_25 = var_1_6 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=5, var_1_11=78/5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=5, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L89] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=5, var_1_11=78/5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=5, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L94] var_1_42 = var_1_39 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=5, var_1_11=78/5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L95] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=5, var_1_11=78/5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L96] COND TRUE (- var_1_14) > var_1_6 [L97] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=5, var_1_11=78/5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L102] unsigned char stepLocal_2 = var_1_4; [L103] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225449, stepLocal_2=0, var_1_10=5, var_1_11=78/5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L104] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225449, var_1_10=5, var_1_11=78/5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L107] COND TRUE stepLocal_1 >= var_1_6 [L108] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=5, var_1_11=78/5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=-256, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=5] [L113] COND TRUE var_1_14 != ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))) [L114] var_1_36 = (((((var_1_14 - var_1_6)) < ((((((var_1_24 + var_1_20)) < (var_1_21)) ? ((var_1_24 + var_1_20)) : (var_1_21))))) ? ((var_1_14 - var_1_6)) : ((((((var_1_24 + var_1_20)) < (var_1_21)) ? ((var_1_24 + var_1_20)) : (var_1_21)))))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=5, var_1_11=78/5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=0, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=5] [L116] unsigned char stepLocal_5 = var_1_1; [L117] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=5, var_1_11=78/5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=0, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=5] [L118] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=5, var_1_11=78/5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=0, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=5] [L125] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=5, var_1_11=78/5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=0, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=5] [L126] COND TRUE ! var_1_1 [L127] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=-2, var_1_36=0, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=5] [L132] COND TRUE var_1_19 < var_1_24 [L133] var_1_34 = var_1_35 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=-2, var_1_35=-2, var_1_36=0, var_1_37=64, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=5] [L135] COND TRUE (var_1_6 * (var_1_38 - var_1_9)) <= var_1_14 [L136] var_1_37 = ((var_1_39 - var_1_35) + var_1_9) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=-2, var_1_35=-2, var_1_36=0, var_1_37=16134, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=5] [L211] RET step() [L212] CALL, EXPR property() [L202-L203] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=-2, var_1_35=-2, var_1_36=0, var_1_37=16134, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=5] [L212] RET, EXPR property() [L212] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=-2, var_1_35=-2, var_1_36=0, var_1_37=16134, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=5, var_1_14=3221225449, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=-2, var_1_35=-2, var_1_36=0, var_1_37=16134, var_1_38=65535, var_1_39=16383, var_1_40=16, var_1_41=1, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.9s, OverallIterations: 11, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2340 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2336 mSDsluCounter, 4649 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2941 mSDsCounter, 633 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2825 IncrementalHoareTripleChecker+Invalid, 3458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 633 mSolverCounterUnsat, 1708 mSDtfsCounter, 2825 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2125 GetRequests, 1948 SyntacticMatches, 4 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5037 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=941occurred in iteration=9, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 505 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 25.9s InterpolantComputationTime, 3219 NumberOfCodeBlocks, 3219 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3202 ConstructedInterpolants, 0 QuantifiedInterpolants, 17511 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1509 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 30678/31680 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-10 05:27:59,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-4.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 3ad0527d8972158d721d810d47d1a1d5d2a58507963c43f16ffd283735cf830c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:28:01,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:28:01,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 05:28:01,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:28:01,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:28:01,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:28:01,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:28:01,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:28:01,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:28:01,454 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:28:01,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:28:01,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:28:01,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:28:01,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:28:01,457 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:28:01,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:28:01,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:28:01,458 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:28:01,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:28:01,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:28:01,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:28:01,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:28:01,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:28:01,462 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 05:28:01,462 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 05:28:01,462 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:28:01,472 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 05:28:01,472 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:28:01,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:28:01,473 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:28:01,473 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:28:01,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:28:01,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:28:01,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:28:01,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:28:01,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:28:01,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:28:01,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:28:01,474 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 05:28:01,474 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 05:28:01,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:28:01,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:28:01,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:28:01,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:28:01,477 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 -> 3ad0527d8972158d721d810d47d1a1d5d2a58507963c43f16ffd283735cf830c [2024-11-10 05:28:01,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:28:01,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:28:01,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:28:01,770 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:28:01,770 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:28:01,777 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-pr-ci_file-4.i [2024-11-10 05:28:03,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:28:03,316 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:28:03,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-4.i [2024-11-10 05:28:03,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3c439d0/e0d907c50cc04254a1dd7162efa03b4a/FLAGba56725f2 [2024-11-10 05:28:03,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3c439d0/e0d907c50cc04254a1dd7162efa03b4a [2024-11-10 05:28:03,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:28:03,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:28:03,339 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:28:03,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:28:03,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:28:03,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:28:03" (1/1) ... [2024-11-10 05:28:03,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40433716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:03, skipping insertion in model container [2024-11-10 05:28:03,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:28:03" (1/1) ... [2024-11-10 05:28:03,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:28:03,523 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-pr-ci_file-4.i[918,931] [2024-11-10 05:28:03,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:28:03,624 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:28:03,649 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-pr-ci_file-4.i[918,931] [2024-11-10 05:28:03,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:28:03,698 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:28:03,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:03 WrapperNode [2024-11-10 05:28:03,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:28:03,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:28:03,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:28:03,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:28:03,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:03" (1/1) ... [2024-11-10 05:28:03,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:03" (1/1) ... [2024-11-10 05:28:03,749 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-11-10 05:28:03,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:28:03,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:28:03,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:28:03,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:28:03,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:03" (1/1) ... [2024-11-10 05:28:03,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:03" (1/1) ... [2024-11-10 05:28:03,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:03" (1/1) ... [2024-11-10 05:28:03,785 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-10 05:28:03,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:03" (1/1) ... [2024-11-10 05:28:03,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:03" (1/1) ... [2024-11-10 05:28:03,800 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:03" (1/1) ... [2024-11-10 05:28:03,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:03" (1/1) ... [2024-11-10 05:28:03,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:03" (1/1) ... [2024-11-10 05:28:03,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:03" (1/1) ... [2024-11-10 05:28:03,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:28:03,811 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:28:03,811 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:28:03,811 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:28:03,812 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:03" (1/1) ... [2024-11-10 05:28:03,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:28:03,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:28:03,854 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-10 05:28:03,859 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-10 05:28:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:28:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 05:28:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:28:03,896 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:28:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:28:03,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:28:03,984 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:28:03,987 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:28:04,674 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 05:28:04,675 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:28:04,685 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:28:04,685 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:28:04,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:28:04 BoogieIcfgContainer [2024-11-10 05:28:04,686 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:28:04,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:28:04,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:28:04,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:28:04,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:28:03" (1/3) ... [2024-11-10 05:28:04,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f6bab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:28:04, skipping insertion in model container [2024-11-10 05:28:04,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:03" (2/3) ... [2024-11-10 05:28:04,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f6bab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:28:04, skipping insertion in model container [2024-11-10 05:28:04,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:28:04" (3/3) ... [2024-11-10 05:28:04,692 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-4.i [2024-11-10 05:28:04,704 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:28:04,704 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:28:04,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:28:04,753 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;@404e86a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:28:04,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:28:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 64 states have (on average 1.421875) internal successors, (91), 65 states have internal predecessors, (91), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 05:28:04,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 05:28:04,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:04,778 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:28:04,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:04,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:04,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1961811781, now seen corresponding path program 1 times [2024-11-10 05:28:04,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:28:04,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364418262] [2024-11-10 05:28:04,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:04,793 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-10 05:28:04,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:28:04,794 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-10 05:28:04,795 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-10 05:28:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:05,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 05:28:05,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:28:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 1508 trivial. 0 not checked. [2024-11-10 05:28:05,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:28:05,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:28:05,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364418262] [2024-11-10 05:28:05,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364418262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:28:05,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:28:05,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:28:05,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697085146] [2024-11-10 05:28:05,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:05,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:28:05,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:28:05,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:28:05,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:28:05,168 INFO L87 Difference]: Start difference. First operand has 100 states, 64 states have (on average 1.421875) internal successors, (91), 65 states have internal predecessors, (91), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 05:28:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:05,196 INFO L93 Difference]: Finished difference Result 192 states and 340 transitions. [2024-11-10 05:28:05,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:28:05,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 211 [2024-11-10 05:28:05,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:05,204 INFO L225 Difference]: With dead ends: 192 [2024-11-10 05:28:05,204 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 05:28:05,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 210 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-10 05:28:05,212 INFO L432 NwaCegarLoop]: 148 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, 148 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-10 05:28:05,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:28:05,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 05:28:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-10 05:28:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 60 states have internal predecessors, (82), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 05:28:05,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 148 transitions. [2024-11-10 05:28:05,255 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 148 transitions. Word has length 211 [2024-11-10 05:28:05,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:05,255 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 148 transitions. [2024-11-10 05:28:05,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 05:28:05,256 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 148 transitions. [2024-11-10 05:28:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-10 05:28:05,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:05,258 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:28:05,267 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-10 05:28:05,459 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-10 05:28:05,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:05,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:05,460 INFO L85 PathProgramCache]: Analyzing trace with hash 307446181, now seen corresponding path program 1 times [2024-11-10 05:28:05,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:28:05,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451699268] [2024-11-10 05:28:05,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:05,461 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-10 05:28:05,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:28:05,463 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-10 05:28:05,464 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-10 05:28:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:05,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 05:28:05,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:28:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 309 proven. 177 refuted. 0 times theorem prover too weak. 1626 trivial. 0 not checked. [2024-11-10 05:28:06,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:28:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 180 refuted. 0 times theorem prover too weak. 1923 trivial. 0 not checked. [2024-11-10 05:28:07,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:28:07,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451699268] [2024-11-10 05:28:07,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451699268] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:28:07,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 05:28:07,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-10 05:28:07,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674776400] [2024-11-10 05:28:07,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 05:28:07,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 05:28:07,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:28:07,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 05:28:07,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-10 05:28:07,192 INFO L87 Difference]: Start difference. First operand 95 states and 148 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2024-11-10 05:28:08,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:08,151 INFO L93 Difference]: Finished difference Result 222 states and 333 transitions. [2024-11-10 05:28:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 05:28:08,151 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) Word has length 212 [2024-11-10 05:28:08,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:08,154 INFO L225 Difference]: With dead ends: 222 [2024-11-10 05:28:08,154 INFO L226 Difference]: Without dead ends: 130 [2024-11-10 05:28:08,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 409 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-11-10 05:28:08,155 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 248 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:08,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 384 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 05:28:08,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-10 05:28:08,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2024-11-10 05:28:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 74 states have internal predecessors, (95), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 05:28:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2024-11-10 05:28:08,179 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 212 [2024-11-10 05:28:08,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:08,182 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2024-11-10 05:28:08,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2024-11-10 05:28:08,182 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2024-11-10 05:28:08,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-10 05:28:08,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:08,187 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:28:08,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 05:28:08,388 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-10 05:28:08,389 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:08,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2028865538, now seen corresponding path program 1 times [2024-11-10 05:28:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:28:08,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000819081] [2024-11-10 05:28:08,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:08,392 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-10 05:28:08,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:28:08,393 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-10 05:28:08,394 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-10 05:28:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:08,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 05:28:08,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:28:08,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 05:28:08,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:28:08,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:28:08,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000819081] [2024-11-10 05:28:08,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000819081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:28:08,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:28:08,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:28:08,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889072758] [2024-11-10 05:28:08,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:08,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:28:08,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:28:08,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:28:08,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:28:08,899 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 05:28:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:09,603 INFO L93 Difference]: Finished difference Result 318 states and 463 transitions. [2024-11-10 05:28:09,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:28:09,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2024-11-10 05:28:09,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:09,606 INFO L225 Difference]: With dead ends: 318 [2024-11-10 05:28:09,606 INFO L226 Difference]: Without dead ends: 210 [2024-11-10 05:28:09,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:28:09,608 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 169 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:09,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 378 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 05:28:09,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-10 05:28:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 205. [2024-11-10 05:28:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 132 states have (on average 1.2424242424242424) internal successors, (164), 132 states have internal predecessors, (164), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 05:28:09,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 296 transitions. [2024-11-10 05:28:09,647 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 296 transitions. Word has length 213 [2024-11-10 05:28:09,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:09,647 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 296 transitions. [2024-11-10 05:28:09,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 05:28:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 296 transitions. [2024-11-10 05:28:09,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-10 05:28:09,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:09,652 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:28:09,661 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-10 05:28:09,852 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-10 05:28:09,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:09,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:09,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1735462531, now seen corresponding path program 1 times [2024-11-10 05:28:09,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:28:09,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336677426] [2024-11-10 05:28:09,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:09,854 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-10 05:28:09,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:28:09,856 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-10 05:28:09,857 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-10 05:28:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:10,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 05:28:10,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:28:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 816 proven. 72 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2024-11-10 05:28:11,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:28:11,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:28:11,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336677426] [2024-11-10 05:28:11,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336677426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:28:11,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2053326526] [2024-11-10 05:28:11,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:11,449 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 05:28:11,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 05:28:11,452 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 05:28:11,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-10 05:28:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:12,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 05:28:12,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:28:13,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 932 proven. 135 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2024-11-10 05:28:13,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:28:13,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2053326526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:28:13,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 05:28:13,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-11-10 05:28:13,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487547515] [2024-11-10 05:28:13,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 05:28:13,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 05:28:13,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:28:13,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 05:28:13,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-10 05:28:13,708 INFO L87 Difference]: Start difference. First operand 205 states and 296 transitions. Second operand has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 16 states have internal predecessors, (105), 5 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) [2024-11-10 05:28:17,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:17,375 INFO L93 Difference]: Finished difference Result 550 states and 772 transitions. [2024-11-10 05:28:17,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 05:28:17,376 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 16 states have internal predecessors, (105), 5 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) Word has length 213 [2024-11-10 05:28:17,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:17,379 INFO L225 Difference]: With dead ends: 550 [2024-11-10 05:28:17,379 INFO L226 Difference]: Without dead ends: 348 [2024-11-10 05:28:17,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 05:28:17,380 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 401 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:17,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 774 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-10 05:28:17,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-10 05:28:17,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 324. [2024-11-10 05:28:17,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 209 states have (on average 1.2105263157894737) internal successors, (253), 209 states have internal predecessors, (253), 99 states have call successors, (99), 15 states have call predecessors, (99), 15 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-10 05:28:17,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 451 transitions. [2024-11-10 05:28:17,423 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 451 transitions. Word has length 213 [2024-11-10 05:28:17,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:17,423 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 451 transitions. [2024-11-10 05:28:17,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 16 states have internal predecessors, (105), 5 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) [2024-11-10 05:28:17,423 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 451 transitions. [2024-11-10 05:28:17,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-10 05:28:17,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:17,426 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:28:17,439 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-10 05:28:17,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-10 05:28:17,827 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 05:28:17,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:17,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:17,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1326638306, now seen corresponding path program 1 times [2024-11-10 05:28:17,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:28:17,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494414995] [2024-11-10 05:28:17,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:17,829 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-10 05:28:17,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:28:17,831 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:28:17,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 05:28:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:18,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 05:28:18,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:28:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 05:28:18,570 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:28:18,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:28:18,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494414995] [2024-11-10 05:28:18,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494414995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:28:18,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:28:18,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:28:18,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439254174] [2024-11-10 05:28:18,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:18,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:28:18,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:28:18,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:28:18,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:28:18,572 INFO L87 Difference]: Start difference. First operand 324 states and 451 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 05:28:19,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:19,436 INFO L93 Difference]: Finished difference Result 538 states and 743 transitions. [2024-11-10 05:28:19,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:28:19,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2024-11-10 05:28:19,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:19,448 INFO L225 Difference]: With dead ends: 538 [2024-11-10 05:28:19,448 INFO L226 Difference]: Without dead ends: 217 [2024-11-10 05:28:19,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:28:19,453 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 77 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:19,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 432 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 05:28:19,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-10 05:28:19,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 191. [2024-11-10 05:28:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 114 states have (on average 1.1403508771929824) internal successors, (130), 114 states have internal predecessors, (130), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 05:28:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 262 transitions. [2024-11-10 05:28:19,478 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 262 transitions. Word has length 213 [2024-11-10 05:28:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:19,478 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 262 transitions. [2024-11-10 05:28:19,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 05:28:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 262 transitions. [2024-11-10 05:28:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-10 05:28:19,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:19,481 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:28:19,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-10 05:28:19,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-10 05:28:19,686 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:19,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:19,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1880790585, now seen corresponding path program 1 times [2024-11-10 05:28:19,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:28:19,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54030477] [2024-11-10 05:28:19,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:19,687 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-10 05:28:19,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:28:19,688 INFO L229 MonitoredProcess]: Starting monitored process 8 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-10 05:28:19,689 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 (8)] Waiting until timeout for monitored process [2024-11-10 05:28:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:19,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 05:28:19,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:28:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 46 proven. 800 refuted. 0 times theorem prover too weak. 1266 trivial. 0 not checked. [2024-11-10 05:28:21,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:28:22,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:28:22,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54030477] [2024-11-10 05:28:22,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54030477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:28:22,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [776116309] [2024-11-10 05:28:22,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:22,111 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 05:28:22,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 05:28:22,113 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 05:28:22,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-10 05:28:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:22,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 05:28:22,768 INFO L278 TraceCheckSpWp]: Computing forward predicates...