./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-47.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-ps-ci_file-47.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 5fbcc6b61cdc6684a2bdeefe8da32daac5b250ade7f730c6a74b940b2fda0e8b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:00:11,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:00:11,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:00:11,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:00:11,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:00:11,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:00:11,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:00:11,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:00:11,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:00:11,502 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:00:11,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:00:11,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:00:11,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:00:11,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:00:11,508 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:00:11,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:00:11,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:00:11,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:00:11,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:00:11,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:00:11,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:00:11,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:00:11,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:00:11,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:00:11,516 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:00:11,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:00:11,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:00:11,516 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:00:11,517 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:00:11,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:00:11,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:00:11,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:00:11,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:00:11,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:00:11,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:00:11,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:00:11,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:00:11,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:00:11,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:00:11,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:00:11,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:00:11,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:00:11,520 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 -> 5fbcc6b61cdc6684a2bdeefe8da32daac5b250ade7f730c6a74b940b2fda0e8b [2024-11-10 06:00:11,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:00:11,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:00:11,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:00:11,815 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:00:11,817 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:00:11,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-47.i [2024-11-10 06:00:13,886 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:00:14,267 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:00:14,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-47.i [2024-11-10 06:00:14,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b4bd3ba3/7fc9d6fa645c4539a2f0997af3820420/FLAG19713a253 [2024-11-10 06:00:14,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b4bd3ba3/7fc9d6fa645c4539a2f0997af3820420 [2024-11-10 06:00:14,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:00:14,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:00:14,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:00:14,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:00:14,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:00:14,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:00:14" (1/1) ... [2024-11-10 06:00:14,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2409b800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:14, skipping insertion in model container [2024-11-10 06:00:14,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:00:14" (1/1) ... [2024-11-10 06:00:14,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:00:15,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-47.i[919,932] [2024-11-10 06:00:15,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:00:15,333 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:00:15,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-47.i[919,932] [2024-11-10 06:00:15,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:00:15,473 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:00:15,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:15 WrapperNode [2024-11-10 06:00:15,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:00:15,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:00:15,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:00:15,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:00:15,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:15" (1/1) ... [2024-11-10 06:00:15,504 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:15" (1/1) ... [2024-11-10 06:00:15,565 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 289 [2024-11-10 06:00:15,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:00:15,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:00:15,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:00:15,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:00:15,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:15" (1/1) ... [2024-11-10 06:00:15,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:15" (1/1) ... [2024-11-10 06:00:15,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:15" (1/1) ... [2024-11-10 06:00:15,634 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 06:00:15,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:15" (1/1) ... [2024-11-10 06:00:15,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:15" (1/1) ... [2024-11-10 06:00:15,654 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:15" (1/1) ... [2024-11-10 06:00:15,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:15" (1/1) ... [2024-11-10 06:00:15,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:15" (1/1) ... [2024-11-10 06:00:15,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:15" (1/1) ... [2024-11-10 06:00:15,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:00:15,668 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:00:15,668 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:00:15,668 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:00:15,669 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:15" (1/1) ... [2024-11-10 06:00:15,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:00:15,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:00:15,731 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 06:00:15,735 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 06:00:15,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:00:15,831 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:00:15,831 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:00:15,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:00:15,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:00:15,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:00:16,026 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:00:16,029 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:00:16,471 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L197: havoc property_#t~bitwise26#1;havoc property_#t~ite28#1;havoc property_#t~bitwise27#1;havoc property_#t~short29#1; [2024-11-10 06:00:16,509 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-10 06:00:16,510 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:00:16,536 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:00:16,537 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:00:16,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:00:16 BoogieIcfgContainer [2024-11-10 06:00:16,538 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:00:16,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:00:16,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:00:16,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:00:16,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:00:14" (1/3) ... [2024-11-10 06:00:16,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d733a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:00:16, skipping insertion in model container [2024-11-10 06:00:16,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:15" (2/3) ... [2024-11-10 06:00:16,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d733a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:00:16, skipping insertion in model container [2024-11-10 06:00:16,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:00:16" (3/3) ... [2024-11-10 06:00:16,546 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-47.i [2024-11-10 06:00:16,564 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:00:16,565 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:00:16,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:00:16,634 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;@225a6302, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:00:16,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:00:16,639 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 93 states have (on average 1.5161290322580645) internal successors, (141), 94 states have internal predecessors, (141), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 06:00:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-10 06:00:16,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:00:16,656 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:00:16,656 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:00:16,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:00:16,662 INFO L85 PathProgramCache]: Analyzing trace with hash -460199724, now seen corresponding path program 1 times [2024-11-10 06:00:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:00:16,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106615193] [2024-11-10 06:00:16,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:00:16,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:00:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:00:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:00:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:00:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:00:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:00:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:00:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:00:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:00:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:00:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:00:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:00:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:00:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:00:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:00:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:00:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:00:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:00:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:00:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:00:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:00:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:00:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:00:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:00:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:00:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 06:00:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 06:00:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 06:00:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 06:00:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:00:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:17,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 06:00:17,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:00:17,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106615193] [2024-11-10 06:00:17,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106615193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:00:17,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:00:17,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:00:17,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277640118] [2024-11-10 06:00:17,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:00:17,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:00:17,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:00:17,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:00:17,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:00:17,549 INFO L87 Difference]: Start difference. First operand has 125 states, 93 states have (on average 1.5161290322580645) internal successors, (141), 94 states have internal predecessors, (141), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 06:00:17,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:00:17,600 INFO L93 Difference]: Finished difference Result 242 states and 420 transitions. [2024-11-10 06:00:17,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:00:17,603 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 195 [2024-11-10 06:00:17,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:00:17,612 INFO L225 Difference]: With dead ends: 242 [2024-11-10 06:00:17,612 INFO L226 Difference]: Without dead ends: 120 [2024-11-10 06:00:17,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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 06:00:17,620 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:00:17,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:00:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-10 06:00:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-10 06:00:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 89 states have (on average 1.449438202247191) internal successors, (129), 89 states have internal predecessors, (129), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 06:00:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 187 transitions. [2024-11-10 06:00:17,671 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 187 transitions. Word has length 195 [2024-11-10 06:00:17,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:00:17,671 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 187 transitions. [2024-11-10 06:00:17,672 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 06:00:17,672 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 187 transitions. [2024-11-10 06:00:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-10 06:00:17,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:00:17,676 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:00:17,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:00:17,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:00:17,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:00:17,678 INFO L85 PathProgramCache]: Analyzing trace with hash 408453400, now seen corresponding path program 1 times [2024-11-10 06:00:17,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:00:17,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200694503] [2024-11-10 06:00:17,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:00:17,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:00:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:00:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:00:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:00:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:00:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:00:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:00:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:00:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:00:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:00:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:00:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:00:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:00:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:00:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:00:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:00:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:00:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:00:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:00:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:00:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:00:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:00:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:00:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:00:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:00:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 06:00:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 06:00:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 06:00:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 06:00:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:00:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 06:00:18,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:00:18,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200694503] [2024-11-10 06:00:18,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200694503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:00:18,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:00:18,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:00:18,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734916955] [2024-11-10 06:00:18,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:00:18,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:00:18,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:00:18,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:00:18,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:00:18,307 INFO L87 Difference]: Start difference. First operand 120 states and 187 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 06:00:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:00:18,558 INFO L93 Difference]: Finished difference Result 420 states and 655 transitions. [2024-11-10 06:00:18,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:00:18,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 196 [2024-11-10 06:00:18,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:00:18,565 INFO L225 Difference]: With dead ends: 420 [2024-11-10 06:00:18,565 INFO L226 Difference]: Without dead ends: 303 [2024-11-10 06:00:18,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 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 06:00:18,567 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 269 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:00:18,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 682 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:00:18,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-10 06:00:18,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2024-11-10 06:00:18,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 230 states have (on average 1.4739130434782608) internal successors, (339), 231 states have internal predecessors, (339), 62 states have call successors, (62), 3 states have call predecessors, (62), 3 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-10 06:00:18,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 463 transitions. [2024-11-10 06:00:18,605 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 463 transitions. Word has length 196 [2024-11-10 06:00:18,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:00:18,606 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 463 transitions. [2024-11-10 06:00:18,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 06:00:18,607 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 463 transitions. [2024-11-10 06:00:18,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-10 06:00:18,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:00:18,610 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:00:18,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:00:18,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:00:18,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:00:18,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1653217881, now seen corresponding path program 1 times [2024-11-10 06:00:18,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:00:18,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100600333] [2024-11-10 06:00:18,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:00:18,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:00:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:00:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:00:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:00:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:00:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:00:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:00:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:00:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:00:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:00:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:00:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:00:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:00:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:00:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:00:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:00:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:00:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:00:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:00:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:00:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:00:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:00:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:00:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:00:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:00:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 06:00:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 06:00:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 06:00:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 06:00:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:00:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 06:00:19,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:00:19,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100600333] [2024-11-10 06:00:19,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100600333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:00:19,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:00:19,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:00:19,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850213621] [2024-11-10 06:00:19,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:00:19,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:00:19,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:00:19,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:00:19,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:00:19,203 INFO L87 Difference]: Start difference. First operand 296 states and 463 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 06:00:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:00:19,595 INFO L93 Difference]: Finished difference Result 1201 states and 1866 transitions. [2024-11-10 06:00:19,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 06:00:19,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 196 [2024-11-10 06:00:19,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:00:19,605 INFO L225 Difference]: With dead ends: 1201 [2024-11-10 06:00:19,605 INFO L226 Difference]: Without dead ends: 908 [2024-11-10 06:00:19,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:00:19,609 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 496 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:00:19,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 705 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:00:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-11-10 06:00:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 673. [2024-11-10 06:00:19,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 511 states have (on average 1.442270058708415) internal successors, (737), 514 states have internal predecessors, (737), 153 states have call successors, (153), 8 states have call predecessors, (153), 8 states have return successors, (153), 150 states have call predecessors, (153), 153 states have call successors, (153) [2024-11-10 06:00:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1043 transitions. [2024-11-10 06:00:19,699 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1043 transitions. Word has length 196 [2024-11-10 06:00:19,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:00:19,700 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 1043 transitions. [2024-11-10 06:00:19,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 06:00:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1043 transitions. [2024-11-10 06:00:19,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-10 06:00:19,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:00:19,704 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:00:19,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:00:19,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:00:19,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:00:19,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1244393656, now seen corresponding path program 1 times [2024-11-10 06:00:19,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:00:19,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052827862] [2024-11-10 06:00:19,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:00:19,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:00:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:00:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:00:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:00:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:00:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:00:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:00:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:00:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:00:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:00:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:00:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:00:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:00:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:00:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:00:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:00:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:00:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:00:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:00:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:00:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:00:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:00:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:00:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:00:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:00:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 06:00:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 06:00:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 06:00:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 06:00:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:00:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:20,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 06:00:20,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:00:20,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052827862] [2024-11-10 06:00:20,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052827862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:00:20,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:00:20,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:00:20,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39525286] [2024-11-10 06:00:20,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:00:20,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:00:20,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:00:20,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:00:20,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:00:20,495 INFO L87 Difference]: Start difference. First operand 673 states and 1043 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 06:00:20,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:00:20,783 INFO L93 Difference]: Finished difference Result 1135 states and 1756 transitions. [2024-11-10 06:00:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:00:20,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 196 [2024-11-10 06:00:20,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:00:20,789 INFO L225 Difference]: With dead ends: 1135 [2024-11-10 06:00:20,789 INFO L226 Difference]: Without dead ends: 520 [2024-11-10 06:00:20,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:00:20,792 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 162 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:00:20,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 500 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:00:20,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-10 06:00:20,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 427. [2024-11-10 06:00:20,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 330 states have (on average 1.4606060606060607) internal successors, (482), 331 states have internal predecessors, (482), 91 states have call successors, (91), 5 states have call predecessors, (91), 5 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-10 06:00:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 664 transitions. [2024-11-10 06:00:20,871 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 664 transitions. Word has length 196 [2024-11-10 06:00:20,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:00:20,872 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 664 transitions. [2024-11-10 06:00:20,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 06:00:20,872 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 664 transitions. [2024-11-10 06:00:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-10 06:00:20,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:00:20,875 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:00:20,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 06:00:20,876 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:00:20,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:00:20,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2053043110, now seen corresponding path program 1 times [2024-11-10 06:00:20,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:00:20,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56583693] [2024-11-10 06:00:20,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:00:20,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:00:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:00:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:00:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:00:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:00:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:00:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:00:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:00:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:00:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:00:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:00:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:00:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:00:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:00:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:00:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:00:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:00:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:00:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:00:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:00:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:00:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:00:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:00:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:00:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:00:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 06:00:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 06:00:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 06:00:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 06:00:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:00:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 06:00:21,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:00:21,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56583693] [2024-11-10 06:00:21,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56583693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:00:21,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:00:21,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 06:00:21,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17306085] [2024-11-10 06:00:21,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:00:21,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 06:00:21,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:00:21,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 06:00:21,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 06:00:21,560 INFO L87 Difference]: Start difference. First operand 427 states and 664 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 06:00:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:00:22,357 INFO L93 Difference]: Finished difference Result 1228 states and 1918 transitions. [2024-11-10 06:00:22,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 06:00:22,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 198 [2024-11-10 06:00:22,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:00:22,365 INFO L225 Difference]: With dead ends: 1228 [2024-11-10 06:00:22,366 INFO L226 Difference]: Without dead ends: 935 [2024-11-10 06:00:22,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-10 06:00:22,371 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 296 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 06:00:22,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 884 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 06:00:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-11-10 06:00:22,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 682. [2024-11-10 06:00:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 550 states have (on average 1.4563636363636363) internal successors, (801), 552 states have internal predecessors, (801), 124 states have call successors, (124), 7 states have call predecessors, (124), 7 states have return successors, (124), 122 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-10 06:00:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1049 transitions. [2024-11-10 06:00:22,490 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1049 transitions. Word has length 198 [2024-11-10 06:00:22,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:00:22,490 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 1049 transitions. [2024-11-10 06:00:22,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 06:00:22,491 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1049 transitions. [2024-11-10 06:00:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 06:00:22,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:00:22,495 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:00:22,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 06:00:22,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:00:22,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:00:22,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2080501485, now seen corresponding path program 1 times [2024-11-10 06:00:22,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:00:22,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225910477] [2024-11-10 06:00:22,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:00:22,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:00:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:22,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:00:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:22,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:00:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:22,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:00:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:22,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:00:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:22,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:00:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:22,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:00:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:22,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:00:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:22,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:00:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:22,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:00:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:22,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:00:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:22,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:00:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:22,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:00:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:00:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:00:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:00:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:00:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:00:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:00:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:00:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:00:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:00:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:00:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:00:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:00:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 06:00:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 06:00:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 06:00:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 06:00:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:00:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 06:00:23,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:00:23,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225910477] [2024-11-10 06:00:23,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225910477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:00:23,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:00:23,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:00:23,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267456686] [2024-11-10 06:00:23,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:00:23,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:00:23,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:00:23,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:00:23,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:00:23,103 INFO L87 Difference]: Start difference. First operand 682 states and 1049 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 06:00:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:00:23,554 INFO L93 Difference]: Finished difference Result 1243 states and 1905 transitions. [2024-11-10 06:00:23,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:00:23,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 199 [2024-11-10 06:00:23,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:00:23,560 INFO L225 Difference]: With dead ends: 1243 [2024-11-10 06:00:23,560 INFO L226 Difference]: Without dead ends: 674 [2024-11-10 06:00:23,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 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 06:00:23,563 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 313 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:00:23,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 629 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:00:23,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-10 06:00:23,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 666. [2024-11-10 06:00:23,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 534 states have (on average 1.4307116104868913) internal successors, (764), 536 states have internal predecessors, (764), 124 states have call successors, (124), 7 states have call predecessors, (124), 7 states have return successors, (124), 122 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-10 06:00:23,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1012 transitions. [2024-11-10 06:00:23,626 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1012 transitions. Word has length 199 [2024-11-10 06:00:23,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:00:23,627 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1012 transitions. [2024-11-10 06:00:23,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 06:00:23,627 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1012 transitions. [2024-11-10 06:00:23,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 06:00:23,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:00:23,630 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:00:23,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 06:00:23,630 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:00:23,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:00:23,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2049481678, now seen corresponding path program 1 times [2024-11-10 06:00:23,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:00:23,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659476899] [2024-11-10 06:00:23,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:00:23,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:00:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:00:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:00:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:00:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:00:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:23,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:00:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:00:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:00:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:00:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:00:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:00:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:00:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:00:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:00:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:00:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:00:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:00:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:00:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:00:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:00:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:00:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:00:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:00:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:00:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:00:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 06:00:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 06:00:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 06:00:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 06:00:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:00:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:24,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 06:00:24,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:00:24,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659476899] [2024-11-10 06:00:24,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659476899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:00:24,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:00:24,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:00:24,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503342587] [2024-11-10 06:00:24,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:00:24,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:00:24,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:00:24,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:00:24,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:00:24,098 INFO L87 Difference]: Start difference. First operand 666 states and 1012 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 06:00:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:00:24,575 INFO L93 Difference]: Finished difference Result 1319 states and 1993 transitions. [2024-11-10 06:00:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:00:24,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 199 [2024-11-10 06:00:24,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:00:24,580 INFO L225 Difference]: With dead ends: 1319 [2024-11-10 06:00:24,580 INFO L226 Difference]: Without dead ends: 754 [2024-11-10 06:00:24,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:00:24,582 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 430 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 06:00:24,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 712 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 06:00:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-10 06:00:24,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 743. [2024-11-10 06:00:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 593 states have (on average 1.4131534569983137) internal successors, (838), 596 states have internal predecessors, (838), 140 states have call successors, (140), 9 states have call predecessors, (140), 9 states have return successors, (140), 137 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-10 06:00:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1118 transitions. [2024-11-10 06:00:24,642 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1118 transitions. Word has length 199 [2024-11-10 06:00:24,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:00:24,642 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1118 transitions. [2024-11-10 06:00:24,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 06:00:24,643 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1118 transitions. [2024-11-10 06:00:24,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 06:00:24,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:00:24,646 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:00:24,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 06:00:24,646 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:00:24,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:00:24,647 INFO L85 PathProgramCache]: Analyzing trace with hash 898775860, now seen corresponding path program 1 times [2024-11-10 06:00:24,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:00:24,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955085164] [2024-11-10 06:00:24,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:00:24,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:00:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:00:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:00:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:00:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:00:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:00:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:00:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:00:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:00:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:00:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:00:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:00:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:00:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:00:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:00:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:00:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:00:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:00:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:00:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:00:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:00:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:00:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:00:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:00:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:00:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 06:00:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 06:00:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 06:00:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 06:00:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:00:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 114 proven. 120 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2024-11-10 06:00:25,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:00:25,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955085164] [2024-11-10 06:00:25,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955085164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:00:25,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681572106] [2024-11-10 06:00:25,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:00:25,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:00:25,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:00:25,776 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 06:00:25,777 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 06:00:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:25,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 06:00:25,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:00:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 864 proven. 246 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2024-11-10 06:00:27,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:00:28,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681572106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:00:28,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 06:00:28,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 20 [2024-11-10 06:00:28,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162959016] [2024-11-10 06:00:28,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 06:00:28,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 06:00:28,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:00:28,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 06:00:28,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2024-11-10 06:00:28,870 INFO L87 Difference]: Start difference. First operand 743 states and 1118 transitions. Second operand has 20 states, 19 states have (on average 6.315789473684211) internal successors, (120), 17 states have internal predecessors, (120), 9 states have call successors, (58), 5 states have call predecessors, (58), 7 states have return successors, (58), 9 states have call predecessors, (58), 9 states have call successors, (58) [2024-11-10 06:00:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:00:33,118 INFO L93 Difference]: Finished difference Result 2295 states and 3302 transitions. [2024-11-10 06:00:33,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-10 06:00:33,122 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.315789473684211) internal successors, (120), 17 states have internal predecessors, (120), 9 states have call successors, (58), 5 states have call predecessors, (58), 7 states have return successors, (58), 9 states have call predecessors, (58), 9 states have call successors, (58) Word has length 199 [2024-11-10 06:00:33,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:00:33,136 INFO L225 Difference]: With dead ends: 2295 [2024-11-10 06:00:33,137 INFO L226 Difference]: Without dead ends: 1641 [2024-11-10 06:00:33,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2318 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1530, Invalid=6660, Unknown=0, NotChecked=0, Total=8190 [2024-11-10 06:00:33,144 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1223 mSDsluCounter, 1995 mSDsCounter, 0 mSdLazyCounter, 3039 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 2310 SdHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 3039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:00:33,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 2310 Invalid, 3383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 3039 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 06:00:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2024-11-10 06:00:33,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 919. [2024-11-10 06:00:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 750 states have (on average 1.3546666666666667) internal successors, (1016), 753 states have internal predecessors, (1016), 138 states have call successors, (138), 30 states have call predecessors, (138), 30 states have return successors, (138), 135 states have call predecessors, (138), 138 states have call successors, (138) [2024-11-10 06:00:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1292 transitions. [2024-11-10 06:00:33,231 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1292 transitions. Word has length 199 [2024-11-10 06:00:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:00:33,231 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1292 transitions. [2024-11-10 06:00:33,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.315789473684211) internal successors, (120), 17 states have internal predecessors, (120), 9 states have call successors, (58), 5 states have call predecessors, (58), 7 states have return successors, (58), 9 states have call predecessors, (58), 9 states have call successors, (58) [2024-11-10 06:00:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1292 transitions. [2024-11-10 06:00:33,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 06:00:33,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:00:33,233 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:00:33,249 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 06:00:33,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:00:33,434 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:00:33,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:00:33,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2013521305, now seen corresponding path program 1 times [2024-11-10 06:00:33,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:00:33,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491079211] [2024-11-10 06:00:33,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:00:33,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:00:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:33,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:00:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:33,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:00:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:33,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:00:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:33,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:00:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:33,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:00:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:33,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:00:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:33,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:00:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:33,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:00:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:33,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:00:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:33,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:00:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:33,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:00:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:33,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:00:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:33,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:00:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:33,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:00:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:33,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:00:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:33,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:00:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:34,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:00:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:34,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:00:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:34,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:00:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:34,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:00:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:34,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:00:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:34,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:00:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:34,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:00:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:34,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:00:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:34,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 06:00:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:34,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 06:00:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:34,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 06:00:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:34,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 06:00:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:34,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:00:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 06:00:34,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:00:34,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491079211] [2024-11-10 06:00:34,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491079211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:00:34,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:00:34,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 06:00:34,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746049134] [2024-11-10 06:00:34,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:00:34,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 06:00:34,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:00:34,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 06:00:34,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:00:34,057 INFO L87 Difference]: Start difference. First operand 919 states and 1292 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 06:00:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:00:34,776 INFO L93 Difference]: Finished difference Result 2101 states and 2939 transitions. [2024-11-10 06:00:34,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 06:00:34,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 200 [2024-11-10 06:00:34,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:00:34,794 INFO L225 Difference]: With dead ends: 2101 [2024-11-10 06:00:34,795 INFO L226 Difference]: Without dead ends: 1301 [2024-11-10 06:00:34,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-10 06:00:34,798 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 515 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 06:00:34,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1202 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 06:00:34,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2024-11-10 06:00:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 960. [2024-11-10 06:00:34,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 791 states have (on average 1.3653603034134008) internal successors, (1080), 794 states have internal predecessors, (1080), 138 states have call successors, (138), 30 states have call predecessors, (138), 30 states have return successors, (138), 135 states have call predecessors, (138), 138 states have call successors, (138) [2024-11-10 06:00:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1356 transitions. [2024-11-10 06:00:34,969 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1356 transitions. Word has length 200 [2024-11-10 06:00:34,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:00:34,974 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1356 transitions. [2024-11-10 06:00:34,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 06:00:34,974 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1356 transitions. [2024-11-10 06:00:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 06:00:34,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:00:34,981 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:00:34,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 06:00:34,981 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:00:34,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:00:34,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2044541112, now seen corresponding path program 1 times [2024-11-10 06:00:34,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:00:34,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945032734] [2024-11-10 06:00:34,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:00:34,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:00:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:00:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:00:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:00:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:00:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:00:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:00:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:00:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:00:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:00:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:00:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:00:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:00:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:00:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:00:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:00:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:00:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:00:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:00:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:00:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:00:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:00:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:00:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:00:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:00:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 06:00:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 06:00:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 06:00:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 06:00:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:00:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 06:00:35,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:00:35,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945032734] [2024-11-10 06:00:35,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945032734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:00:35,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:00:35,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:00:35,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14618885] [2024-11-10 06:00:35,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:00:35,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:00:35,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:00:35,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:00:35,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:00:35,195 INFO L87 Difference]: Start difference. First operand 960 states and 1356 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 06:00:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:00:35,374 INFO L93 Difference]: Finished difference Result 1813 states and 2580 transitions. [2024-11-10 06:00:35,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:00:35,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 200 [2024-11-10 06:00:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:00:35,380 INFO L225 Difference]: With dead ends: 1813 [2024-11-10 06:00:35,380 INFO L226 Difference]: Without dead ends: 1413 [2024-11-10 06:00:35,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 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 06:00:35,382 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 163 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:00:35,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 697 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:00:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2024-11-10 06:00:35,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 954. [2024-11-10 06:00:35,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 785 states have (on average 1.3656050955414012) internal successors, (1072), 788 states have internal predecessors, (1072), 138 states have call successors, (138), 30 states have call predecessors, (138), 30 states have return successors, (138), 135 states have call predecessors, (138), 138 states have call successors, (138) [2024-11-10 06:00:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1348 transitions. [2024-11-10 06:00:35,498 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1348 transitions. Word has length 200 [2024-11-10 06:00:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:00:35,500 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1348 transitions. [2024-11-10 06:00:35,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 06:00:35,500 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1348 transitions. [2024-11-10 06:00:35,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 06:00:35,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:00:35,502 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:00:35,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 06:00:35,502 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:00:35,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:00:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash -433214952, now seen corresponding path program 1 times [2024-11-10 06:00:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:00:35,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211182155] [2024-11-10 06:00:35,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:00:35,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:00:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:00:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:00:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:00:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:00:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:00:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:00:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:00:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:00:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:00:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:00:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:00:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:00:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:00:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:00:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:00:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:00:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:00:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:00:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:00:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:00:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:00:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:00:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:00:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:00:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 06:00:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 06:00:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 06:00:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 06:00:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:00:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 06:00:35,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:00:35,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211182155] [2024-11-10 06:00:35,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211182155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:00:35,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309638929] [2024-11-10 06:00:35,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:00:35,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:00:35,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:00:35,939 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 06:00:35,940 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 06:00:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:36,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 06:00:36,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:00:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-10 06:00:36,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:00:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 06:00:36,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309638929] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:00:36,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 06:00:36,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2024-11-10 06:00:36,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421900849] [2024-11-10 06:00:36,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 06:00:36,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 06:00:36,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:00:36,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 06:00:36,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-10 06:00:36,721 INFO L87 Difference]: Start difference. First operand 954 states and 1348 transitions. Second operand has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 5 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 5 states have call predecessors, (85), 5 states have call successors, (85) [2024-11-10 06:00:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:00:37,461 INFO L93 Difference]: Finished difference Result 1772 states and 2501 transitions. [2024-11-10 06:00:37,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 06:00:37,462 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 5 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 5 states have call predecessors, (85), 5 states have call successors, (85) Word has length 200 [2024-11-10 06:00:37,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:00:37,467 INFO L225 Difference]: With dead ends: 1772 [2024-11-10 06:00:37,467 INFO L226 Difference]: Without dead ends: 969 [2024-11-10 06:00:37,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2024-11-10 06:00:37,470 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 492 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 06:00:37,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 600 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 06:00:37,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2024-11-10 06:00:37,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 954. [2024-11-10 06:00:37,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 785 states have (on average 1.356687898089172) internal successors, (1065), 788 states have internal predecessors, (1065), 138 states have call successors, (138), 30 states have call predecessors, (138), 30 states have return successors, (138), 135 states have call predecessors, (138), 138 states have call successors, (138) [2024-11-10 06:00:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1341 transitions. [2024-11-10 06:00:37,550 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1341 transitions. Word has length 200 [2024-11-10 06:00:37,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:00:37,551 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1341 transitions. [2024-11-10 06:00:37,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 5 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 5 states have call predecessors, (85), 5 states have call successors, (85) [2024-11-10 06:00:37,551 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1341 transitions. [2024-11-10 06:00:37,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-10 06:00:37,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:00:37,553 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:00:37,573 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 06:00:37,754 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,SelfDestructingSolverStorable10 [2024-11-10 06:00:37,755 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:00:37,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:00:37,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1711495085, now seen corresponding path program 1 times [2024-11-10 06:00:37,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:00:37,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104795461] [2024-11-10 06:00:37,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:00:37,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:00:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:00:37,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [414780940] [2024-11-10 06:00:37,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:00:37,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:00:37,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:00:37,931 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 06:00:37,943 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 06:00:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:00:38,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 06:00:38,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:00:38,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-10 06:00:38,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:00:43,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 06:00:43,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:00:43,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104795461] [2024-11-10 06:00:43,860 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 06:00:43,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414780940] [2024-11-10 06:00:43,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414780940] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:00:43,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 06:00:43,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2024-11-10 06:00:43,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440048929] [2024-11-10 06:00:43,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 06:00:43,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 06:00:43,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:00:43,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 06:00:43,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-10 06:00:43,867 INFO L87 Difference]: Start difference. First operand 954 states and 1341 transitions. Second operand has 16 states, 16 states have (on average 7.5) internal successors, (120), 16 states have internal predecessors, (120), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2024-11-10 06:00:49,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:00:49,684 INFO L93 Difference]: Finished difference Result 2519 states and 3532 transitions. [2024-11-10 06:00:49,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-10 06:00:49,686 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.5) internal successors, (120), 16 states have internal predecessors, (120), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) Word has length 201 [2024-11-10 06:00:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:00:49,696 INFO L225 Difference]: With dead ends: 2519 [2024-11-10 06:00:49,696 INFO L226 Difference]: Without dead ends: 1734 [2024-11-10 06:00:49,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=465, Invalid=1257, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 06:00:49,701 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 1449 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:00:49,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 1161 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-10 06:00:49,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2024-11-10 06:00:49,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 989. [2024-11-10 06:00:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 818 states have (on average 1.3496332518337408) internal successors, (1104), 821 states have internal predecessors, (1104), 138 states have call successors, (138), 32 states have call predecessors, (138), 32 states have return successors, (138), 135 states have call predecessors, (138), 138 states have call successors, (138) [2024-11-10 06:00:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1380 transitions. [2024-11-10 06:00:49,816 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1380 transitions. Word has length 201 [2024-11-10 06:00:49,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:00:49,817 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1380 transitions. [2024-11-10 06:00:49,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.5) internal successors, (120), 16 states have internal predecessors, (120), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2024-11-10 06:00:49,817 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1380 transitions. [2024-11-10 06:00:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-10 06:00:49,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:00:49,820 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:00:49,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 06:00:50,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:00:50,021 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:00:50,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:00:50,022 INFO L85 PathProgramCache]: Analyzing trace with hash 31315250, now seen corresponding path program 1 times [2024-11-10 06:00:50,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:00:50,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324158078] [2024-11-10 06:00:50,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:00:50,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:00:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:00:50,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [149845310] [2024-11-10 06:00:50,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:00:50,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:00:50,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:00:50,193 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 06:00:50,205 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 06:00:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:00:50,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:00:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:00:50,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:00:50,677 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:00:50,678 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:00:50,696 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 06:00:50,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:00:50,892 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:00:51,041 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:00:51,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:00:51 BoogieIcfgContainer [2024-11-10 06:00:51,044 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:00:51,044 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:00:51,045 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:00:51,045 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:00:51,045 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:00:16" (3/4) ... [2024-11-10 06:00:51,047 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:00:51,048 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:00:51,049 INFO L158 Benchmark]: Toolchain (without parser) took 36496.26ms. Allocated memory was 134.2MB in the beginning and 578.8MB in the end (delta: 444.6MB). Free memory was 62.9MB in the beginning and 260.4MB in the end (delta: -197.6MB). Peak memory consumption was 248.9MB. Max. memory is 16.1GB. [2024-11-10 06:00:51,049 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 134.2MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:00:51,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 916.58ms. Allocated memory was 134.2MB in the beginning and 209.7MB in the end (delta: 75.5MB). Free memory was 62.6MB in the beginning and 168.7MB in the end (delta: -106.1MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-11-10 06:00:51,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.50ms. Allocated memory is still 209.7MB. Free memory was 168.7MB in the beginning and 162.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 06:00:51,051 INFO L158 Benchmark]: Boogie Preprocessor took 100.38ms. Allocated memory is still 209.7MB. Free memory was 162.4MB in the beginning and 154.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 06:00:51,051 INFO L158 Benchmark]: IcfgBuilder took 869.56ms. Allocated memory is still 209.7MB. Free memory was 154.0MB in the beginning and 114.1MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-10 06:00:51,051 INFO L158 Benchmark]: TraceAbstraction took 34504.22ms. Allocated memory was 209.7MB in the beginning and 578.8MB in the end (delta: 369.1MB). Free memory was 113.1MB in the beginning and 260.4MB in the end (delta: -147.3MB). Peak memory consumption was 222.8MB. Max. memory is 16.1GB. [2024-11-10 06:00:51,052 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 578.8MB. Free memory is still 260.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:00:51,053 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.30ms. Allocated memory is still 134.2MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 916.58ms. Allocated memory was 134.2MB in the beginning and 209.7MB in the end (delta: 75.5MB). Free memory was 62.6MB in the beginning and 168.7MB in the end (delta: -106.1MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.50ms. Allocated memory is still 209.7MB. Free memory was 168.7MB in the beginning and 162.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.38ms. Allocated memory is still 209.7MB. Free memory was 162.4MB in the beginning and 154.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 869.56ms. Allocated memory is still 209.7MB. Free memory was 154.0MB in the beginning and 114.1MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 34504.22ms. Allocated memory was 209.7MB in the beginning and 578.8MB in the end (delta: 369.1MB). Free memory was 113.1MB in the beginning and 260.4MB in the end (delta: -147.3MB). Peak memory consumption was 222.8MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 578.8MB. Free memory is still 260.4MB. 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 197, overapproximation of someBinaryFLOATComparisonOperation at line 197, overapproximation of bitwiseOr at line 139. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_3 = 0.875; [L24] unsigned short int var_1_4 = 49926; [L25] unsigned short int var_1_5 = 500; [L26] unsigned short int var_1_6 = 10; [L27] unsigned char var_1_8 = 64; [L28] unsigned short int var_1_9 = 5; [L29] unsigned char var_1_11 = 10; [L30] float var_1_12 = 0.19999999999999996; [L31] float var_1_13 = 9.2; [L32] float var_1_14 = 5.8; [L33] float var_1_15 = 31.25; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 0; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned short int var_1_20 = 256; [L39] unsigned short int var_1_21 = 23544; [L40] unsigned long int var_1_22 = 64; [L41] double var_1_23 = 100.75; [L42] double var_1_30 = 10.3; [L43] signed long int var_1_31 = -16; [L44] unsigned char var_1_32 = 128; [L45] unsigned long int var_1_34 = 64; [L46] unsigned long int var_1_35 = 2280229334; [L47] unsigned short int var_1_36 = 4; [L48] double var_1_38 = 9.5; [L49] signed char var_1_39 = -5; [L50] signed char var_1_40 = 8; [L51] signed char var_1_41 = 8; [L52] signed char var_1_42 = -10; [L53] unsigned char var_1_43 = 1; [L54] unsigned char last_1_var_1_8 = 64; [L55] unsigned char last_1_var_1_19 = 1; [L56] unsigned short int last_1_var_1_20 = 256; [L57] unsigned long int last_1_var_1_22 = 64; VAL [isInitial=0, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_3=7/8, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L201] isInitial = 1 [L202] FCALL initially() [L203] COND TRUE 1 [L204] CALL updateLastVariables() [L191] last_1_var_1_8 = var_1_8 [L192] last_1_var_1_19 = var_1_19 [L193] last_1_var_1_20 = var_1_20 [L194] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_3=7/8, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L204] RET updateLastVariables() [L205] CALL updateVariables() [L144] var_1_3 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L145] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L146] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L146] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L147] var_1_4 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L148] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L149] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L149] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L150] var_1_5 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_6=10, var_1_8=64, var_1_9=5] [L151] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_6=10, var_1_8=64, var_1_9=5] [L152] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L152] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L153] var_1_6 = __VERIFIER_nondet_ushort() [L154] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_8=64, var_1_9=5] [L154] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_8=64, var_1_9=5] [L155] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=5] [L155] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=5] [L156] var_1_9 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64] [L157] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64] [L158] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L158] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L159] var_1_11 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L160] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L161] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L161] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L162] var_1_13 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && 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_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L163] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && 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_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L164] var_1_14 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L165] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L166] var_1_15 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L167] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L168] var_1_17 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L169] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L170] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L170] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L171] var_1_18 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L172] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L173] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L173] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L174] var_1_21 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L175] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L176] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L176] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L177] var_1_35 = __VERIFIER_nondet_ulong() [L178] CALL assume_abort_if_not(var_1_35 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L178] RET assume_abort_if_not(var_1_35 >= 2147483647) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L179] CALL assume_abort_if_not(var_1_35 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L179] RET assume_abort_if_not(var_1_35 <= 4294967294) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L180] var_1_40 = __VERIFIER_nondet_char() [L181] CALL assume_abort_if_not(var_1_40 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L181] RET assume_abort_if_not(var_1_40 >= -127) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L182] CALL assume_abort_if_not(var_1_40 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L182] RET assume_abort_if_not(var_1_40 <= 126) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L183] var_1_41 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_41 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L184] RET assume_abort_if_not(var_1_41 >= -127) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L185] CALL assume_abort_if_not(var_1_41 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L185] RET assume_abort_if_not(var_1_41 <= 126) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-10, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L186] var_1_42 = __VERIFIER_nondet_char() [L187] CALL assume_abort_if_not(var_1_42 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L187] RET assume_abort_if_not(var_1_42 >= -126) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L188] CALL assume_abort_if_not(var_1_42 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L188] RET assume_abort_if_not(var_1_42 <= 126) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L205] RET updateVariables() [L206] CALL step() [L61] COND FALSE !(var_1_13 <= var_1_3) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L68] var_1_30 = var_1_15 [L69] var_1_31 = var_1_9 [L70] var_1_32 = var_1_11 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=64, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L71] COND TRUE var_1_15 > 32.8 [L72] var_1_34 = (((((var_1_35 - var_1_8)) > (var_1_21)) ? ((var_1_35 - var_1_8)) : (var_1_21))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L74] EXPR var_1_8 & var_1_11 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L74] COND TRUE (var_1_8 & var_1_11) <= var_1_8 [L75] var_1_36 = 10 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L85] EXPR var_1_6 | (var_1_5 + var_1_8) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L85] COND FALSE !(var_1_11 == (var_1_6 | (var_1_5 + var_1_8))) [L88] COND TRUE var_1_14 >= var_1_3 [L89] var_1_39 = ((((var_1_40) < (var_1_41)) ? (var_1_40) : (var_1_41))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L93] COND FALSE !((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) / var_1_4) > (var_1_6 * 10)) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L100] COND TRUE (last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22) [L101] var_1_16 = (last_1_var_1_19 || var_1_17) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L105] unsigned short int stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_0=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L106] COND FALSE !(stepLocal_0 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L111] unsigned short int stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_2=114686, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L112] COND TRUE var_1_8 <= stepLocal_2 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L113] COND TRUE \read(var_1_16) [L114] var_1_20 = (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=32831, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L121] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=32831, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L122] COND FALSE !((var_1_8 * var_1_8) < var_1_11) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=32831, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L128] COND TRUE var_1_12 >= (1.3 / var_1_3) [L129] var_1_1 = ((var_1_4 - var_1_8) - var_1_8) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=32831, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L133] unsigned char stepLocal_1 = var_1_1 < 64; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=32831, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L134] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=32831, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L135] COND TRUE stepLocal_1 || var_1_16 [L136] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=32831, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L139] EXPR 2 ^ var_1_20 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=32831, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L139] EXPR (((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20)) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=32831, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L139] COND FALSE !(var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) [L206] RET step() [L207] CALL, EXPR property() [L197] EXPR (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=32831, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L197-L198] return (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) ; [L207] RET, EXPR property() [L207] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=32831, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=32831, var_1_21=16383, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=10737418175, var_1_35=10737418239, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=114686, var_1_5=0, var_1_6=64, var_1_8=64, var_1_9=-65472] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.3s, OverallIterations: 13, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5822 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5808 mSDsluCounter, 10262 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7535 mSDsCounter, 1147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6850 IncrementalHoareTripleChecker+Invalid, 7997 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1147 mSolverCounterUnsat, 2727 mSDtfsCounter, 6850 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1957 GetRequests, 1764 SyntacticMatches, 1 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2843 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=989occurred in iteration=12, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 2889 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 3381 NumberOfCodeBlocks, 3381 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3163 ConstructedInterpolants, 0 QuantifiedInterpolants, 16188 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1389 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 25228/25984 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 06:00:51,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-47.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 5fbcc6b61cdc6684a2bdeefe8da32daac5b250ade7f730c6a74b940b2fda0e8b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:00:53,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:00:53,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:00:54,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:00:54,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:00:54,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:00:54,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:00:54,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:00:54,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:00:54,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:00:54,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:00:54,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:00:54,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:00:54,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:00:54,031 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:00:54,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:00:54,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:00:54,032 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:00:54,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:00:54,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:00:54,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:00:54,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:00:54,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:00:54,036 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:00:54,036 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:00:54,036 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:00:54,036 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:00:54,036 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:00:54,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:00:54,038 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:00:54,039 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:00:54,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:00:54,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:00:54,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:00:54,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:00:54,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:00:54,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:00:54,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:00:54,040 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:00:54,041 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:00:54,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:00:54,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:00:54,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:00:54,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:00:54,041 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 -> 5fbcc6b61cdc6684a2bdeefe8da32daac5b250ade7f730c6a74b940b2fda0e8b [2024-11-10 06:00:54,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:00:54,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:00:54,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:00:54,455 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:00:54,456 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:00:54,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-47.i [2024-11-10 06:00:56,378 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:00:56,676 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:00:56,677 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-47.i [2024-11-10 06:00:56,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236ac6154/b705fbf13be741ed940d3abf03e0aca6/FLAGfd6a51b1f [2024-11-10 06:00:56,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236ac6154/b705fbf13be741ed940d3abf03e0aca6 [2024-11-10 06:00:56,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:00:56,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:00:56,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:00:56,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:00:56,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:00:56,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:00:56" (1/1) ... [2024-11-10 06:00:56,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@239b6252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:56, skipping insertion in model container [2024-11-10 06:00:56,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:00:56" (1/1) ... [2024-11-10 06:00:56,769 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:00:56,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-47.i[919,932] [2024-11-10 06:00:57,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:00:57,118 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:00:57,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-47.i[919,932] [2024-11-10 06:00:57,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:00:57,208 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:00:57,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:57 WrapperNode [2024-11-10 06:00:57,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:00:57,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:00:57,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:00:57,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:00:57,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:57" (1/1) ... [2024-11-10 06:00:57,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:57" (1/1) ... [2024-11-10 06:00:57,289 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-11-10 06:00:57,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:00:57,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:00:57,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:00:57,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:00:57,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:57" (1/1) ... [2024-11-10 06:00:57,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:57" (1/1) ... [2024-11-10 06:00:57,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:57" (1/1) ... [2024-11-10 06:00:57,349 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 06:00:57,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:57" (1/1) ... [2024-11-10 06:00:57,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:57" (1/1) ... [2024-11-10 06:00:57,358 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:57" (1/1) ... [2024-11-10 06:00:57,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:57" (1/1) ... [2024-11-10 06:00:57,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:57" (1/1) ... [2024-11-10 06:00:57,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:57" (1/1) ... [2024-11-10 06:00:57,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:00:57,380 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:00:57,384 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:00:57,384 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:00:57,386 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:57" (1/1) ... [2024-11-10 06:00:57,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:00:57,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:00:57,432 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 06:00:57,434 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 06:00:57,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:00:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:00:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:00:57,483 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:00:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:00:57,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:00:57,600 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:00:57,605 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:01:11,760 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 06:01:11,761 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:01:11,781 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:01:11,781 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:01:11,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:01:11 BoogieIcfgContainer [2024-11-10 06:01:11,783 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:01:11,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:01:11,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:01:11,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:01:11,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:00:56" (1/3) ... [2024-11-10 06:01:11,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf04e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:01:11, skipping insertion in model container [2024-11-10 06:01:11,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:57" (2/3) ... [2024-11-10 06:01:11,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf04e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:01:11, skipping insertion in model container [2024-11-10 06:01:11,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:01:11" (3/3) ... [2024-11-10 06:01:11,799 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-47.i [2024-11-10 06:01:11,818 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:01:11,818 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:01:11,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:01:11,913 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;@4f92fd4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:01:11,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:01:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 62 states have internal predecessors, (88), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 06:01:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 06:01:11,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:01:11,940 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:01:11,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:01:11,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:01:11,947 INFO L85 PathProgramCache]: Analyzing trace with hash 237185086, now seen corresponding path program 1 times [2024-11-10 06:01:11,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:01:11,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988532696] [2024-11-10 06:01:11,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:01:11,970 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 06:01:11,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:01:11,977 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 06:01:12,008 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 06:01:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:13,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:01:13,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:01:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2024-11-10 06:01:13,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:01:13,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:01:13,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988532696] [2024-11-10 06:01:13,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988532696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:01:13,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:01:13,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:01:13,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522200739] [2024-11-10 06:01:13,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:01:13,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:01:13,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:01:13,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:01:13,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:01:13,451 INFO L87 Difference]: Start difference. First operand has 93 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 62 states have internal predecessors, (88), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 06:01:13,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:01:13,480 INFO L93 Difference]: Finished difference Result 176 states and 310 transitions. [2024-11-10 06:01:13,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:01:13,483 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 189 [2024-11-10 06:01:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:01:13,490 INFO L225 Difference]: With dead ends: 176 [2024-11-10 06:01:13,491 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 06:01:13,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 188 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 06:01:13,499 INFO L432 NwaCegarLoop]: 133 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, 133 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 06:01:13,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:01:13,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 06:01:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-10 06:01:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 06:01:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2024-11-10 06:01:13,548 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 189 [2024-11-10 06:01:13,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:01:13,549 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2024-11-10 06:01:13,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 06:01:13,550 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2024-11-10 06:01:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 06:01:13,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:01:13,554 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:01:13,585 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 06:01:13,754 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 06:01:13,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:01:13,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:01:13,757 INFO L85 PathProgramCache]: Analyzing trace with hash 683846433, now seen corresponding path program 1 times [2024-11-10 06:01:13,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:01:13,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693391652] [2024-11-10 06:01:13,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:01:13,758 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 06:01:13,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:01:13,763 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 06:01:13,770 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 06:01:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:15,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 06:01:15,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:01:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-10 06:01:19,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:01:20,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:01:20,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693391652] [2024-11-10 06:01:20,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693391652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:01:20,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [747341444] [2024-11-10 06:01:20,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:01:20,442 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 06:01:20,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 06:01:20,445 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 06:01:20,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-10 06:01:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:01:23,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 06:01:23,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:01:28,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 06:01:28,746 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:01:28,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [747341444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:01:28,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 06:01:28,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-10 06:01:28,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239517349] [2024-11-10 06:01:28,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:01:28,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:01:28,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:01:28,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:01:28,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 06:01:28,751 INFO L87 Difference]: Start difference. First operand 86 states and 133 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29)