./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-84.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 2de9554d2db29c841908dc7706688d8dc299abb18d93013764f385fbb1a38056 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:55:05,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:55:05,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 13:55:05,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:55:05,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:55:05,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:55:05,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:55:05,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:55:05,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:55:05,578 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:55:05,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:55:05,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:55:05,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:55:05,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:55:05,580 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:55:05,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:55:05,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:55:05,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:55:05,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 13:55:05,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:55:05,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:55:05,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:55:05,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:55:05,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:55:05,586 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:55:05,586 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:55:05,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:55:05,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:55:05,589 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:55:05,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:55:05,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:55:05,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:55:05,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:55:05,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:55:05,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:55:05,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:55:05,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 13:55:05,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 13:55:05,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:55:05,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:55:05,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:55:05,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:55:05,593 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 -> 2de9554d2db29c841908dc7706688d8dc299abb18d93013764f385fbb1a38056 [2024-11-16 13:55:05,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:55:05,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:55:05,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:55:05,862 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:55:05,863 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:55:05,864 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-pe-ci_file-84.i [2024-11-16 13:55:07,373 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:55:07,568 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:55:07,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-84.i [2024-11-16 13:55:07,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b7b3ad4/3dbd86a9606047f0b4b119d0866ca1b2/FLAG8ac8539db [2024-11-16 13:55:07,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b7b3ad4/3dbd86a9606047f0b4b119d0866ca1b2 [2024-11-16 13:55:07,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:55:07,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:55:07,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:55:07,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:55:07,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:55:07,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:55:07" (1/1) ... [2024-11-16 13:55:07,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56e5e5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:55:07, skipping insertion in model container [2024-11-16 13:55:07,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:55:07" (1/1) ... [2024-11-16 13:55:07,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:55:08,161 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-pe-ci_file-84.i[919,932] [2024-11-16 13:55:08,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:55:08,265 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:55:08,275 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-pe-ci_file-84.i[919,932] [2024-11-16 13:55:08,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:55:08,349 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:55:08,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:55:08 WrapperNode [2024-11-16 13:55:08,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:55:08,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:55:08,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:55:08,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:55:08,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:55:08" (1/1) ... [2024-11-16 13:55:08,370 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:55:08" (1/1) ... [2024-11-16 13:55:08,434 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2024-11-16 13:55:08,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:55:08,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:55:08,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:55:08,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:55:08,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:55:08" (1/1) ... [2024-11-16 13:55:08,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:55:08" (1/1) ... [2024-11-16 13:55:08,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:55:08" (1/1) ... [2024-11-16 13:55:08,497 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 13:55:08,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:55:08" (1/1) ... [2024-11-16 13:55:08,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:55:08" (1/1) ... [2024-11-16 13:55:08,517 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:55:08" (1/1) ... [2024-11-16 13:55:08,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:55:08" (1/1) ... [2024-11-16 13:55:08,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:55:08" (1/1) ... [2024-11-16 13:55:08,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:55:08" (1/1) ... [2024-11-16 13:55:08,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:55:08,547 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:55:08,548 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:55:08,548 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:55:08,549 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:55:08" (1/1) ... [2024-11-16 13:55:08,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:55:08,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:55:08,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 13:55:08,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 13:55:08,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:55:08,628 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:55:08,629 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:55:08,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 13:55:08,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:55:08,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:55:08,729 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:55:08,734 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:55:09,306 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L189: havoc property_#t~bitwise22#1;havoc property_#t~short23#1;havoc property_#t~bitwise24#1;havoc property_#t~short25#1; [2024-11-16 13:55:09,350 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-16 13:55:09,350 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:55:09,378 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:55:09,380 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:55:09,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:55:09 BoogieIcfgContainer [2024-11-16 13:55:09,380 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:55:09,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:55:09,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:55:09,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:55:09,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:55:07" (1/3) ... [2024-11-16 13:55:09,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d1a3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:55:09, skipping insertion in model container [2024-11-16 13:55:09,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:55:08" (2/3) ... [2024-11-16 13:55:09,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d1a3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:55:09, skipping insertion in model container [2024-11-16 13:55:09,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:55:09" (3/3) ... [2024-11-16 13:55:09,391 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-84.i [2024-11-16 13:55:09,408 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:55:09,410 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:55:09,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:55:09,481 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;@231237a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:55:09,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:55:09,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 80 states have internal predecessors, (114), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 13:55:09,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-16 13:55:09,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:55:09,500 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:55:09,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:55:09,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:55:09,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1106559717, now seen corresponding path program 1 times [2024-11-16 13:55:09,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:55:09,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963085682] [2024-11-16 13:55:09,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:09,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:55:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:55:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:55:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:55:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:55:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:55:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:55:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:55:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:55:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:55:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:55:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:55:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 13:55:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:55:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 13:55:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:55:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 13:55:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-16 13:55:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 13:55:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 13:55:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 13:55:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 13:55:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 13:55:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 13:55:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 13:55:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 13:55:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-16 13:55:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 13:55:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 13:55:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 13:55:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-16 13:55:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-16 13:55:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:09,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-16 13:55:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 13:55:10,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:55:10,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963085682] [2024-11-16 13:55:10,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963085682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:55:10,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:55:10,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:55:10,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581692167] [2024-11-16 13:55:10,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:55:10,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:55:10,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:55:10,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:55:10,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:55:10,044 INFO L87 Difference]: Start difference. First operand has 114 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 80 states have internal predecessors, (114), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-16 13:55:10,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:55:10,088 INFO L93 Difference]: Finished difference Result 220 states and 381 transitions. [2024-11-16 13:55:10,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:55:10,092 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 212 [2024-11-16 13:55:10,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:55:10,104 INFO L225 Difference]: With dead ends: 220 [2024-11-16 13:55:10,104 INFO L226 Difference]: Without dead ends: 109 [2024-11-16 13:55:10,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:55:10,113 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:55:10,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:55:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-16 13:55:10,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-16 13:55:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 75 states have internal predecessors, (106), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 13:55:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 170 transitions. [2024-11-16 13:55:10,172 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 170 transitions. Word has length 212 [2024-11-16 13:55:10,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:55:10,174 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 170 transitions. [2024-11-16 13:55:10,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-16 13:55:10,175 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 170 transitions. [2024-11-16 13:55:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-16 13:55:10,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:55:10,180 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:55:10,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 13:55:10,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:55:10,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:55:10,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1709527293, now seen corresponding path program 1 times [2024-11-16 13:55:10,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:55:10,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056552442] [2024-11-16 13:55:10,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:10,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:55:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:55:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:55:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:55:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:55:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:55:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:55:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:55:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:55:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:55:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:55:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:55:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 13:55:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:55:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 13:55:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:55:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 13:55:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-16 13:55:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 13:55:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 13:55:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 13:55:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 13:55:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 13:55:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 13:55:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 13:55:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 13:55:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-16 13:55:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 13:55:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 13:55:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 13:55:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-16 13:55:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-16 13:55:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-16 13:55:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 13:55:10,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:55:10,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056552442] [2024-11-16 13:55:10,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056552442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:55:10,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:55:10,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:55:10,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961307860] [2024-11-16 13:55:10,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:55:10,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:55:10,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:55:10,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:55:10,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:55:10,668 INFO L87 Difference]: Start difference. First operand 109 states and 170 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:55:10,783 INFO L93 Difference]: Finished difference Result 315 states and 492 transitions. [2024-11-16 13:55:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:55:10,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2024-11-16 13:55:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:55:10,792 INFO L225 Difference]: With dead ends: 315 [2024-11-16 13:55:10,793 INFO L226 Difference]: Without dead ends: 209 [2024-11-16 13:55:10,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:55:10,798 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 150 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:55:10,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 425 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:55:10,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-16 13:55:10,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 121. [2024-11-16 13:55:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 87 states have internal predecessors, (123), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 13:55:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 187 transitions. [2024-11-16 13:55:10,826 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 187 transitions. Word has length 212 [2024-11-16 13:55:10,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:55:10,827 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 187 transitions. [2024-11-16 13:55:10,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:10,828 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 187 transitions. [2024-11-16 13:55:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-16 13:55:10,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:55:10,834 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:55:10,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 13:55:10,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:55:10,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:55:10,835 INFO L85 PathProgramCache]: Analyzing trace with hash 547383714, now seen corresponding path program 1 times [2024-11-16 13:55:10,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:55:10,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110772134] [2024-11-16 13:55:10,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:10,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:55:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:55:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:55:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:55:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:55:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:10,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:55:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:55:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:55:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:55:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:55:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:55:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:55:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 13:55:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:55:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 13:55:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:55:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 13:55:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-16 13:55:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 13:55:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 13:55:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 13:55:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 13:55:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 13:55:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 13:55:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 13:55:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 13:55:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-16 13:55:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 13:55:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 13:55:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 13:55:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-16 13:55:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-16 13:55:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-16 13:55:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 13:55:11,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:55:11,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110772134] [2024-11-16 13:55:11,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110772134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:55:11,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:55:11,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:55:11,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951564742] [2024-11-16 13:55:11,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:55:11,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:55:11,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:55:11,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:55:11,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:55:11,091 INFO L87 Difference]: Start difference. First operand 121 states and 187 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:11,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:55:11,130 INFO L93 Difference]: Finished difference Result 224 states and 348 transitions. [2024-11-16 13:55:11,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:55:11,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2024-11-16 13:55:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:55:11,133 INFO L225 Difference]: With dead ends: 224 [2024-11-16 13:55:11,133 INFO L226 Difference]: Without dead ends: 106 [2024-11-16 13:55:11,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:55:11,137 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 146 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:55:11,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 150 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:55:11,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-16 13:55:11,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-16 13:55:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 13:55:11,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 160 transitions. [2024-11-16 13:55:11,154 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 160 transitions. Word has length 212 [2024-11-16 13:55:11,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:55:11,154 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 160 transitions. [2024-11-16 13:55:11,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 160 transitions. [2024-11-16 13:55:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-16 13:55:11,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:55:11,158 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:55:11,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 13:55:11,158 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:55:11,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:55:11,159 INFO L85 PathProgramCache]: Analyzing trace with hash -63505066, now seen corresponding path program 1 times [2024-11-16 13:55:11,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:55:11,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114511310] [2024-11-16 13:55:11,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:11,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:55:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:55:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:55:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:55:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:55:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:55:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:55:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:55:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:55:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:55:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:55:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:55:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 13:55:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:55:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 13:55:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:55:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 13:55:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-16 13:55:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 13:55:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 13:55:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 13:55:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 13:55:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 13:55:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 13:55:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 13:55:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 13:55:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-16 13:55:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 13:55:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 13:55:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 13:55:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-16 13:55:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-16 13:55:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-16 13:55:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 13:55:15,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:55:15,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114511310] [2024-11-16 13:55:15,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114511310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:55:15,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:55:15,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 13:55:15,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204495816] [2024-11-16 13:55:15,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:55:15,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 13:55:15,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:55:15,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 13:55:15,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-16 13:55:15,444 INFO L87 Difference]: Start difference. First operand 106 states and 160 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:55:18,163 INFO L93 Difference]: Finished difference Result 449 states and 640 transitions. [2024-11-16 13:55:18,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 13:55:18,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-11-16 13:55:18,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:55:18,166 INFO L225 Difference]: With dead ends: 449 [2024-11-16 13:55:18,166 INFO L226 Difference]: Without dead ends: 346 [2024-11-16 13:55:18,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2024-11-16 13:55:18,168 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 502 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 13:55:18,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 790 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 13:55:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-16 13:55:18,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 181. [2024-11-16 13:55:18,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 144 states have (on average 1.4027777777777777) internal successors, (202), 145 states have internal predecessors, (202), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 13:55:18,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 270 transitions. [2024-11-16 13:55:18,188 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 270 transitions. Word has length 213 [2024-11-16 13:55:18,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:55:18,188 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 270 transitions. [2024-11-16 13:55:18,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:18,189 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 270 transitions. [2024-11-16 13:55:18,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-16 13:55:18,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:55:18,191 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:55:18,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 13:55:18,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:55:18,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:55:18,192 INFO L85 PathProgramCache]: Analyzing trace with hash 473717190, now seen corresponding path program 1 times [2024-11-16 13:55:18,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:55:18,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851583086] [2024-11-16 13:55:18,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:18,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:55:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:55:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:55:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:55:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:55:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:55:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:55:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:55:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:55:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:55:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:55:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:55:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 13:55:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:55:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 13:55:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:55:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 13:55:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-16 13:55:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 13:55:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 13:55:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 13:55:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 13:55:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 13:55:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 13:55:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 13:55:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 13:55:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-16 13:55:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 13:55:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 13:55:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 13:55:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-16 13:55:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-16 13:55:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-16 13:55:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 13:55:20,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:55:20,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851583086] [2024-11-16 13:55:20,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851583086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:55:20,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:55:20,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 13:55:20,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339211108] [2024-11-16 13:55:20,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:55:20,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 13:55:20,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:55:20,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 13:55:20,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 13:55:20,869 INFO L87 Difference]: Start difference. First operand 181 states and 270 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:21,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:55:21,692 INFO L93 Difference]: Finished difference Result 448 states and 659 transitions. [2024-11-16 13:55:21,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 13:55:21,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-11-16 13:55:21,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:55:21,698 INFO L225 Difference]: With dead ends: 448 [2024-11-16 13:55:21,698 INFO L226 Difference]: Without dead ends: 270 [2024-11-16 13:55:21,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:55:21,700 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 87 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 13:55:21,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 540 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 13:55:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-16 13:55:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 242. [2024-11-16 13:55:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 197 states have (on average 1.3756345177664975) internal successors, (271), 200 states have internal predecessors, (271), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 13:55:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 351 transitions. [2024-11-16 13:55:21,736 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 351 transitions. Word has length 214 [2024-11-16 13:55:21,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:55:21,739 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 351 transitions. [2024-11-16 13:55:21,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:21,739 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 351 transitions. [2024-11-16 13:55:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-16 13:55:21,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:55:21,743 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:55:21,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 13:55:21,743 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:55:21,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:55:21,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1485998860, now seen corresponding path program 1 times [2024-11-16 13:55:21,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:55:21,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691576167] [2024-11-16 13:55:21,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:21,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:55:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:55:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:55:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:55:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:55:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:55:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:55:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:55:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:55:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:55:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:55:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:55:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 13:55:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:55:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 13:55:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:55:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 13:55:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-16 13:55:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 13:55:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 13:55:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 13:55:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 13:55:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 13:55:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 13:55:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 13:55:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 13:55:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-16 13:55:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 13:55:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 13:55:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 13:55:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-16 13:55:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-16 13:55:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-16 13:55:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 13:55:25,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:55:25,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691576167] [2024-11-16 13:55:25,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691576167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:55:25,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:55:25,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 13:55:25,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369797396] [2024-11-16 13:55:25,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:55:25,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 13:55:25,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:55:25,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 13:55:25,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:55:25,164 INFO L87 Difference]: Start difference. First operand 242 states and 351 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:26,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:55:26,311 INFO L93 Difference]: Finished difference Result 567 states and 816 transitions. [2024-11-16 13:55:26,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 13:55:26,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-11-16 13:55:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:55:26,314 INFO L225 Difference]: With dead ends: 567 [2024-11-16 13:55:26,314 INFO L226 Difference]: Without dead ends: 328 [2024-11-16 13:55:26,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 13:55:26,316 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 43 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 13:55:26,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 880 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 13:55:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-16 13:55:26,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 260. [2024-11-16 13:55:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 215 states have (on average 1.3813953488372093) internal successors, (297), 218 states have internal predecessors, (297), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 13:55:26,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 377 transitions. [2024-11-16 13:55:26,338 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 377 transitions. Word has length 214 [2024-11-16 13:55:26,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:55:26,338 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 377 transitions. [2024-11-16 13:55:26,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 377 transitions. [2024-11-16 13:55:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-16 13:55:26,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:55:26,341 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:55:26,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 13:55:26,341 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:55:26,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:55:26,342 INFO L85 PathProgramCache]: Analyzing trace with hash -591210483, now seen corresponding path program 1 times [2024-11-16 13:55:26,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:55:26,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819969806] [2024-11-16 13:55:26,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:26,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:55:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:55:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:55:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:55:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:55:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:55:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:55:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:55:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:55:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:55:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:55:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:55:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 13:55:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:55:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 13:55:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:55:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 13:55:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-16 13:55:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 13:55:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 13:55:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 13:55:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 13:55:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 13:55:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 13:55:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 13:55:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 13:55:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-16 13:55:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 13:55:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 13:55:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 13:55:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-16 13:55:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-16 13:55:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-16 13:55:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 13:55:28,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:55:28,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819969806] [2024-11-16 13:55:28,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819969806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:55:28,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:55:28,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 13:55:28,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651961680] [2024-11-16 13:55:28,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:55:28,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 13:55:28,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:55:28,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 13:55:28,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:55:28,691 INFO L87 Difference]: Start difference. First operand 260 states and 377 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:29,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:55:29,613 INFO L93 Difference]: Finished difference Result 548 states and 787 transitions. [2024-11-16 13:55:29,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 13:55:29,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-11-16 13:55:29,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:55:29,619 INFO L225 Difference]: With dead ends: 548 [2024-11-16 13:55:29,620 INFO L226 Difference]: Without dead ends: 291 [2024-11-16 13:55:29,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 13:55:29,621 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 43 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 13:55:29,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 875 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 13:55:29,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-16 13:55:29,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 204. [2024-11-16 13:55:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 161 states have (on average 1.3540372670807452) internal successors, (218), 163 states have internal predecessors, (218), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 13:55:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 294 transitions. [2024-11-16 13:55:29,645 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 294 transitions. Word has length 214 [2024-11-16 13:55:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:55:29,646 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 294 transitions. [2024-11-16 13:55:29,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 294 transitions. [2024-11-16 13:55:29,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-16 13:55:29,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:55:29,650 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:55:29,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 13:55:29,650 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:55:29,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:55:29,650 INFO L85 PathProgramCache]: Analyzing trace with hash -198239848, now seen corresponding path program 1 times [2024-11-16 13:55:29,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:55:29,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549565813] [2024-11-16 13:55:29,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:29,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:55:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:55:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:55:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:55:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:55:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:55:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:55:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:55:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:55:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:55:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:55:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:55:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 13:55:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:55:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 13:55:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:55:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 13:55:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-16 13:55:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 13:55:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 13:55:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 13:55:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 13:55:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 13:55:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 13:55:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 13:55:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 13:55:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-16 13:55:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 13:55:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 13:55:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 13:55:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-16 13:55:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-16 13:55:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-16 13:55:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 13:55:33,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:55:33,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549565813] [2024-11-16 13:55:33,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549565813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:55:33,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:55:33,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 13:55:33,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687497837] [2024-11-16 13:55:33,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:55:33,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 13:55:33,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:55:33,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 13:55:33,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 13:55:33,785 INFO L87 Difference]: Start difference. First operand 204 states and 294 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:34,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:55:34,872 INFO L93 Difference]: Finished difference Result 553 states and 790 transitions. [2024-11-16 13:55:34,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 13:55:34,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 215 [2024-11-16 13:55:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:55:34,876 INFO L225 Difference]: With dead ends: 553 [2024-11-16 13:55:34,876 INFO L226 Difference]: Without dead ends: 352 [2024-11-16 13:55:34,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-16 13:55:34,877 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 130 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 13:55:34,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 817 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 13:55:34,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-16 13:55:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 256. [2024-11-16 13:55:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 213 states have (on average 1.375586854460094) internal successors, (293), 215 states have internal predecessors, (293), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 13:55:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 369 transitions. [2024-11-16 13:55:34,899 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 369 transitions. Word has length 215 [2024-11-16 13:55:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:55:34,900 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 369 transitions. [2024-11-16 13:55:34,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 369 transitions. [2024-11-16 13:55:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-16 13:55:34,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:55:34,903 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:55:34,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 13:55:34,903 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:55:34,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:55:34,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2058671159, now seen corresponding path program 1 times [2024-11-16 13:55:34,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:55:34,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613804339] [2024-11-16 13:55:34,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:34,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:55:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:55:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:55:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:55:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:55:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:55:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:55:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:55:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:55:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:55:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:55:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:55:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 13:55:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:55:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 13:55:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:55:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 13:55:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-16 13:55:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 13:55:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 13:55:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 13:55:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 13:55:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 13:55:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 13:55:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 13:55:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 13:55:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-16 13:55:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 13:55:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 13:55:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 13:55:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-16 13:55:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-16 13:55:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-16 13:55:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 13:55:38,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:55:38,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613804339] [2024-11-16 13:55:38,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613804339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:55:38,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:55:38,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 13:55:38,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730527148] [2024-11-16 13:55:38,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:55:38,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 13:55:38,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:55:38,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 13:55:38,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-16 13:55:38,749 INFO L87 Difference]: Start difference. First operand 256 states and 369 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:55:40,568 INFO L93 Difference]: Finished difference Result 609 states and 869 transitions. [2024-11-16 13:55:40,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 13:55:40,568 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 215 [2024-11-16 13:55:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:55:40,570 INFO L225 Difference]: With dead ends: 609 [2024-11-16 13:55:40,570 INFO L226 Difference]: Without dead ends: 356 [2024-11-16 13:55:40,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-16 13:55:40,572 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 185 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:55:40,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1125 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 13:55:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-16 13:55:40,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 256. [2024-11-16 13:55:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 213 states have (on average 1.375586854460094) internal successors, (293), 215 states have internal predecessors, (293), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 13:55:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 369 transitions. [2024-11-16 13:55:40,603 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 369 transitions. Word has length 215 [2024-11-16 13:55:40,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:55:40,605 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 369 transitions. [2024-11-16 13:55:40,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 369 transitions. [2024-11-16 13:55:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-16 13:55:40,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:55:40,607 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:55:40,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 13:55:40,608 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:55:40,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:55:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash 676272648, now seen corresponding path program 1 times [2024-11-16 13:55:40,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:55:40,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784891867] [2024-11-16 13:55:40,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:40,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:55:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:55:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:55:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:55:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:55:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:55:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:55:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:55:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:55:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:55:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:55:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:55:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 13:55:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:55:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 13:55:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:55:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 13:55:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-16 13:55:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 13:55:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 13:55:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 13:55:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 13:55:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 13:55:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 13:55:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 13:55:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 13:55:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-16 13:55:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 13:55:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 13:55:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 13:55:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-16 13:55:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-16 13:55:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-16 13:55:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:40,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 13:55:40,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:55:40,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784891867] [2024-11-16 13:55:40,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784891867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:55:40,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:55:40,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 13:55:40,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35445423] [2024-11-16 13:55:40,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:55:40,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:55:40,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:55:40,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:55:40,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:55:40,935 INFO L87 Difference]: Start difference. First operand 256 states and 369 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:55:41,165 INFO L93 Difference]: Finished difference Result 724 states and 1044 transitions. [2024-11-16 13:55:41,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 13:55:41,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 216 [2024-11-16 13:55:41,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:55:41,169 INFO L225 Difference]: With dead ends: 724 [2024-11-16 13:55:41,170 INFO L226 Difference]: Without dead ends: 471 [2024-11-16 13:55:41,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:55:41,171 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 114 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:55:41,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 526 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:55:41,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-16 13:55:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 321. [2024-11-16 13:55:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 243 states have (on average 1.3333333333333333) internal successors, (324), 245 states have internal predecessors, (324), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-16 13:55:41,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 464 transitions. [2024-11-16 13:55:41,213 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 464 transitions. Word has length 216 [2024-11-16 13:55:41,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:55:41,214 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 464 transitions. [2024-11-16 13:55:41,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:41,214 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 464 transitions. [2024-11-16 13:55:41,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-16 13:55:41,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:55:41,216 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:55:41,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 13:55:41,216 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:55:41,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:55:41,217 INFO L85 PathProgramCache]: Analyzing trace with hash 737830372, now seen corresponding path program 1 times [2024-11-16 13:55:41,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:55:41,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059291643] [2024-11-16 13:55:41,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:41,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:55:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:55:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:55:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:55:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:55:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:55:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:55:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:55:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:55:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:55:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:55:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:55:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 13:55:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:55:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 13:55:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:55:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 13:55:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-16 13:55:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 13:55:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 13:55:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 13:55:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 13:55:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 13:55:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 13:55:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 13:55:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 13:55:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-16 13:55:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 13:55:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 13:55:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 13:55:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-16 13:55:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-16 13:55:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-16 13:55:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 13:55:41,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:55:41,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059291643] [2024-11-16 13:55:41,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059291643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:55:41,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:55:41,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:55:41,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811180323] [2024-11-16 13:55:41,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:55:41,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:55:41,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:55:41,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:55:41,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:55:41,350 INFO L87 Difference]: Start difference. First operand 321 states and 464 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:41,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:55:41,480 INFO L93 Difference]: Finished difference Result 617 states and 886 transitions. [2024-11-16 13:55:41,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:55:41,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 216 [2024-11-16 13:55:41,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:55:41,483 INFO L225 Difference]: With dead ends: 617 [2024-11-16 13:55:41,483 INFO L226 Difference]: Without dead ends: 364 [2024-11-16 13:55:41,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:55:41,484 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 48 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:55:41,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 259 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:55:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-16 13:55:41,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 339. [2024-11-16 13:55:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 261 states have (on average 1.3295019157088122) internal successors, (347), 263 states have internal predecessors, (347), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-16 13:55:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 487 transitions. [2024-11-16 13:55:41,516 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 487 transitions. Word has length 216 [2024-11-16 13:55:41,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:55:41,517 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 487 transitions. [2024-11-16 13:55:41,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 487 transitions. [2024-11-16 13:55:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-16 13:55:41,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:55:41,519 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:55:41,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 13:55:41,520 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:55:41,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:55:41,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1812324931, now seen corresponding path program 1 times [2024-11-16 13:55:41,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:55:41,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238728450] [2024-11-16 13:55:41,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:41,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:55:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:55:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:55:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:55:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:55:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:55:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:55:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:55:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:55:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:55:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:55:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:55:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 13:55:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:55:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 13:55:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:55:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 13:55:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-16 13:55:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 13:55:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 13:55:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 13:55:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 13:55:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 13:55:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 13:55:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 13:55:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 13:55:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-16 13:55:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 13:55:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 13:55:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 13:55:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-16 13:55:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-16 13:55:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-16 13:55:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 13:55:41,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:55:41,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238728450] [2024-11-16 13:55:41,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238728450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:55:41,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:55:41,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:55:41,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981605596] [2024-11-16 13:55:41,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:55:41,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:55:41,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:55:41,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:55:41,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:55:41,648 INFO L87 Difference]: Start difference. First operand 339 states and 487 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:55:41,757 INFO L93 Difference]: Finished difference Result 639 states and 908 transitions. [2024-11-16 13:55:41,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:55:41,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 216 [2024-11-16 13:55:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:55:41,761 INFO L225 Difference]: With dead ends: 639 [2024-11-16 13:55:41,761 INFO L226 Difference]: Without dead ends: 368 [2024-11-16 13:55:41,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:55:41,762 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 55 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:55:41,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 293 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:55:41,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-16 13:55:41,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 323. [2024-11-16 13:55:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 247 states have (on average 1.3238866396761133) internal successors, (327), 248 states have internal predecessors, (327), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-16 13:55:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 463 transitions. [2024-11-16 13:55:41,791 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 463 transitions. Word has length 216 [2024-11-16 13:55:41,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:55:41,791 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 463 transitions. [2024-11-16 13:55:41,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:55:41,791 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 463 transitions. [2024-11-16 13:55:41,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-16 13:55:41,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:55:41,793 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:55:41,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 13:55:41,793 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:55:41,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:55:41,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1378510118, now seen corresponding path program 1 times [2024-11-16 13:55:41,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:55:41,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987151317] [2024-11-16 13:55:41,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:41,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:55:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:55:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:55:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:55:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:55:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:55:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:55:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:55:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:55:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 13:55:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:55:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 13:55:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 13:55:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 13:55:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 13:55:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 13:55:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 13:55:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-16 13:55:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 13:55:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 13:55:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 13:55:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 13:55:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 13:55:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 13:55:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 13:55:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 13:55:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-16 13:55:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 13:55:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-16 13:55:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 13:55:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-16 13:55:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-16 13:55:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-16 13:55:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 66 proven. 114 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2024-11-16 13:55:43,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:55:43,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987151317] [2024-11-16 13:55:43,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987151317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:55:43,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216081180] [2024-11-16 13:55:43,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:43,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:55:43,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:55:43,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 13:55:43,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 13:55:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:43,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 13:55:43,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:55:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1080 proven. 147 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-11-16 13:55:44,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:55:45,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216081180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:55:45,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 13:55:45,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2024-11-16 13:55:45,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118821118] [2024-11-16 13:55:45,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 13:55:45,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-16 13:55:45,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:55:45,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-16 13:55:45,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2024-11-16 13:55:45,311 INFO L87 Difference]: Start difference. First operand 323 states and 463 transitions. Second operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 6 states have call successors, (55), 4 states have call predecessors, (55), 6 states have return successors, (56), 6 states have call predecessors, (56), 6 states have call successors, (56) [2024-11-16 13:55:48,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:55:48,293 INFO L93 Difference]: Finished difference Result 1438 states and 1951 transitions. [2024-11-16 13:55:48,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-16 13:55:48,295 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 6 states have call successors, (55), 4 states have call predecessors, (55), 6 states have return successors, (56), 6 states have call predecessors, (56), 6 states have call successors, (56) Word has length 217 [2024-11-16 13:55:48,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:55:48,301 INFO L225 Difference]: With dead ends: 1438 [2024-11-16 13:55:48,301 INFO L226 Difference]: Without dead ends: 1183 [2024-11-16 13:55:48,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1667 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1445, Invalid=4255, Unknown=0, NotChecked=0, Total=5700 [2024-11-16 13:55:48,304 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 1422 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1429 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 13:55:48,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1429 Valid, 647 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 13:55:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2024-11-16 13:55:48,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 982. [2024-11-16 13:55:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 846 states have (on average 1.3274231678486998) internal successors, (1123), 853 states have internal predecessors, (1123), 104 states have call successors, (104), 31 states have call predecessors, (104), 31 states have return successors, (104), 97 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-16 13:55:48,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1331 transitions. [2024-11-16 13:55:48,405 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1331 transitions. Word has length 217 [2024-11-16 13:55:48,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:55:48,406 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1331 transitions. [2024-11-16 13:55:48,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 6 states have call successors, (55), 4 states have call predecessors, (55), 6 states have return successors, (56), 6 states have call predecessors, (56), 6 states have call successors, (56) [2024-11-16 13:55:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1331 transitions. [2024-11-16 13:55:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-16 13:55:48,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:55:48,409 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:55:48,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 13:55:48,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-16 13:55:48,614 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:55:48,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:55:48,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1884068743, now seen corresponding path program 1 times [2024-11-16 13:55:48,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:55:48,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540434442] [2024-11-16 13:55:48,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:48,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:55:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:55:48,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621555481] [2024-11-16 13:55:48,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:48,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:55:48,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:55:48,732 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 13:55:48,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 13:55:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:48,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 13:55:48,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:55:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 783 proven. 69 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2024-11-16 13:55:49,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:55:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 24 proven. 69 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-16 13:55:49,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:55:49,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540434442] [2024-11-16 13:55:49,738 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 13:55:49,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621555481] [2024-11-16 13:55:49,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621555481] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:55:49,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 13:55:49,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-16 13:55:49,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619659996] [2024-11-16 13:55:49,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 13:55:49,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 13:55:49,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:55:49,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 13:55:49,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-16 13:55:49,741 INFO L87 Difference]: Start difference. First operand 982 states and 1331 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-16 13:55:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:55:52,642 INFO L93 Difference]: Finished difference Result 3680 states and 4745 transitions. [2024-11-16 13:55:52,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-16 13:55:52,643 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 217 [2024-11-16 13:55:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:55:52,656 INFO L225 Difference]: With dead ends: 3680 [2024-11-16 13:55:52,656 INFO L226 Difference]: Without dead ends: 2790 [2024-11-16 13:55:52,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=866, Invalid=2916, Unknown=0, NotChecked=0, Total=3782 [2024-11-16 13:55:52,663 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 1267 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 13:55:52,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 575 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 13:55:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2024-11-16 13:55:52,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 920. [2024-11-16 13:55:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 797 states have (on average 1.3174404015056462) internal successors, (1050), 802 states have internal predecessors, (1050), 90 states have call successors, (90), 32 states have call predecessors, (90), 32 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-16 13:55:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1230 transitions. [2024-11-16 13:55:52,779 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1230 transitions. Word has length 217 [2024-11-16 13:55:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:55:52,780 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1230 transitions. [2024-11-16 13:55:52,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-16 13:55:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1230 transitions. [2024-11-16 13:55:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-16 13:55:52,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:55:52,782 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:55:52,802 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-16 13:55:52,983 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,SelfDestructingSolverStorable13 [2024-11-16 13:55:52,984 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:55:52,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:55:52,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1551827400, now seen corresponding path program 1 times [2024-11-16 13:55:52,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:55:52,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731733118] [2024-11-16 13:55:52,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:52,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:55:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:55:53,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [993448612] [2024-11-16 13:55:53,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:53,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:55:53,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:55:53,117 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 13:55:53,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 13:55:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:55:53,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 13:55:53,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:55:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1158 proven. 117 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2024-11-16 13:55:53,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:55:58,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:55:58,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731733118] [2024-11-16 13:55:58,131 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 13:55:58,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993448612] [2024-11-16 13:55:58,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993448612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:55:58,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 13:55:58,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-11-16 13:55:58,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258254871] [2024-11-16 13:55:58,131 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 13:55:58,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 13:55:58,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:55:58,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 13:55:58,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=119, Unknown=1, NotChecked=0, Total=156 [2024-11-16 13:55:58,133 INFO L87 Difference]: Start difference. First operand 920 states and 1230 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-16 13:55:58,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:55:58,928 INFO L93 Difference]: Finished difference Result 2118 states and 2806 transitions. [2024-11-16 13:55:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 13:55:58,928 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 217 [2024-11-16 13:55:58,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:55:58,937 INFO L225 Difference]: With dead ends: 2118 [2024-11-16 13:55:58,937 INFO L226 Difference]: Without dead ends: 1210 [2024-11-16 13:55:58,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=126, Invalid=335, Unknown=1, NotChecked=0, Total=462 [2024-11-16 13:55:58,941 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 237 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 13:55:58,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 452 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 13:55:58,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2024-11-16 13:55:59,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 768. [2024-11-16 13:55:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 671 states have (on average 1.3323397913561847) internal successors, (894), 673 states have internal predecessors, (894), 71 states have call successors, (71), 25 states have call predecessors, (71), 25 states have return successors, (71), 69 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-16 13:55:59,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1036 transitions. [2024-11-16 13:55:59,023 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1036 transitions. Word has length 217 [2024-11-16 13:55:59,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:55:59,023 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1036 transitions. [2024-11-16 13:55:59,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-16 13:55:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1036 transitions. [2024-11-16 13:55:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-16 13:55:59,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:55:59,026 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:55:59,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 13:55:59,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:55:59,227 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:55:59,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:55:59,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1566426682, now seen corresponding path program 1 times [2024-11-16 13:55:59,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:55:59,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505516129] [2024-11-16 13:55:59,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:59,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:55:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:55:59,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1241668148] [2024-11-16 13:55:59,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:55:59,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:55:59,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:55:59,330 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 13:55:59,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 13:55:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:55:59,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 13:55:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:55:59,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 13:55:59,804 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 13:55:59,805 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 13:55:59,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-16 13:56:00,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-16 13:56:00,010 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:56:00,162 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 13:56:00,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 01:56:00 BoogieIcfgContainer [2024-11-16 13:56:00,165 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 13:56:00,165 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 13:56:00,165 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 13:56:00,166 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 13:56:00,166 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:55:09" (3/4) ... [2024-11-16 13:56:00,168 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 13:56:00,169 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 13:56:00,170 INFO L158 Benchmark]: Toolchain (without parser) took 52226.12ms. Allocated memory was 167.8MB in the beginning and 448.8MB in the end (delta: 281.0MB). Free memory was 112.4MB in the beginning and 151.7MB in the end (delta: -39.3MB). Peak memory consumption was 244.8MB. Max. memory is 16.1GB. [2024-11-16 13:56:00,170 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 167.8MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:56:00,171 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.13ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 94.0MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 13:56:00,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.13ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 88.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 13:56:00,172 INFO L158 Benchmark]: Boogie Preprocessor took 110.05ms. Allocated memory is still 167.8MB. Free memory was 88.7MB in the beginning and 82.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 13:56:00,172 INFO L158 Benchmark]: IcfgBuilder took 833.36ms. Allocated memory is still 167.8MB. Free memory was 82.5MB in the beginning and 115.1MB in the end (delta: -32.6MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-11-16 13:56:00,172 INFO L158 Benchmark]: TraceAbstraction took 50781.35ms. Allocated memory was 167.8MB in the beginning and 448.8MB in the end (delta: 281.0MB). Free memory was 114.2MB in the beginning and 152.8MB in the end (delta: -38.6MB). Peak memory consumption was 244.2MB. Max. memory is 16.1GB. [2024-11-16 13:56:00,172 INFO L158 Benchmark]: Witness Printer took 4.11ms. Allocated memory is still 448.8MB. Free memory was 152.8MB in the beginning and 151.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 13:56:00,176 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.12ms. Allocated memory is still 167.8MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.13ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 94.0MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.13ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 88.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.05ms. Allocated memory is still 167.8MB. Free memory was 88.7MB in the beginning and 82.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 833.36ms. Allocated memory is still 167.8MB. Free memory was 82.5MB in the beginning and 115.1MB in the end (delta: -32.6MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * TraceAbstraction took 50781.35ms. Allocated memory was 167.8MB in the beginning and 448.8MB in the end (delta: 281.0MB). Free memory was 114.2MB in the beginning and 152.8MB in the end (delta: -38.6MB). Peak memory consumption was 244.2MB. Max. memory is 16.1GB. * Witness Printer took 4.11ms. Allocated memory is still 448.8MB. Free memory was 152.8MB in the beginning and 151.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 189, overapproximation of someUnaryDOUBLEoperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] signed long int var_1_22 = 0; [L42] signed long int var_1_24 = 2; [L43] unsigned char var_1_27 = 0; [L44] unsigned char var_1_29 = 0; [L45] unsigned char var_1_30 = 0; [L46] unsigned char var_1_31 = 0; [L47] unsigned char var_1_32 = 1; [L48] unsigned char var_1_33 = 0; [L49] signed short int var_1_35 = 8; [L50] signed short int var_1_37 = -4; [L51] float var_1_38 = 15.875; [L52] double var_1_39 = 0.125; [L53] double var_1_40 = 3.8; [L54] signed char var_1_43 = -8; [L55] unsigned short int last_1_var_1_15 = 128; VAL [isInitial=0, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-16, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L186] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-16, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L196] RET updateLastVariables() [L197] CALL updateVariables() [L136] var_1_3 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L137] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L138] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L138] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L139] var_1_4 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L140] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L141] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L141] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L142] var_1_5 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L143] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L144] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L144] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L145] var_1_7 = __VERIFIER_nondet_long() [L146] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=-4, var_1_9=50] [L146] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=-4, var_1_9=50] [L147] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=-4, var_1_9=50] [L147] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=-4, var_1_9=50] [L148] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=-4, var_1_9=50] [L148] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=-4, var_1_9=50] [L149] var_1_8 = __VERIFIER_nondet_long() [L150] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L150] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L151] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L151] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L152] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L152] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L153] var_1_10 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L154] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L155] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L155] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L156] var_1_11 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L157] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L158] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L158] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L159] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L159] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L160] var_1_16 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L161] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L162] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L162] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L163] var_1_17 = __VERIFIER_nondet_ushort() [L164] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L164] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L165] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L165] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L166] var_1_21 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L167] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L168] var_1_29 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L169] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L170] CALL assume_abort_if_not(var_1_29 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L170] RET assume_abort_if_not(var_1_29 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L171] var_1_30 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L172] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L173] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L173] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L174] var_1_31 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L175] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L176] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L176] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L177] var_1_32 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L178] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L179] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L179] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L180] var_1_39 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L181] RET assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L182] var_1_40 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L183] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L197] RET updateVariables() [L198] CALL step() [L59] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=50] [L59] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L64] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L66] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L66] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L67] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L68] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L72] signed long int stepLocal_1 = -4; [L73] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L74] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L79] var_1_18 = var_1_17 [L80] var_1_19 = 0 [L81] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L82] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L85] COND TRUE var_1_3 <= var_1_1 [L86] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L90] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=32768, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L91] COND TRUE (~ var_1_3) < stepLocal_2 [L92] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L94] var_1_22 = var_1_10 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L95] COND FALSE !(var_1_19 && var_1_19) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L100] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L111] COND TRUE var_1_10 != ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) [L112] var_1_33 = (5 + var_1_11) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L114] COND FALSE !((~ var_1_4) > (var_1_4 / var_1_11)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L117] var_1_37 = ((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) < (var_1_4)) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L118] COND TRUE var_1_7 == var_1_11 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=127/8, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L119] COND TRUE (var_1_39 - var_1_40) < var_1_21 [L120] var_1_38 = ((((((((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) < 0 ) ? -((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) : ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) < 0 ) ? -(((((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) < 0 ) ? -((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) : ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : (((((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) < 0 ) ? -((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) : ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L127] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L128] COND FALSE !(((var_1_11 + -128) % var_1_10) >= var_1_15) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L198] RET step() [L199] CALL, EXPR property() [L189] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L189] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L189] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L189] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L189] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L189] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L189-L190] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=383, var_1_11=-255, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-62, var_1_43=-8, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=1, var_1_8=27, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.6s, OverallIterations: 16, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4453 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4429 mSDsluCounter, 8520 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6224 mSDsCounter, 639 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5674 IncrementalHoareTripleChecker+Invalid, 6313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 639 mSolverCounterUnsat, 2296 mSDtfsCounter, 5674 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2142 GetRequests, 1922 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2890 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=982occurred in iteration=13, InterpolantAutomatonStates: 203, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 3365 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 30.7s InterpolantComputationTime, 4305 NumberOfCodeBlocks, 4305 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3637 ConstructedInterpolants, 2 QuantifiedInterpolants, 29848 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1474 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 33212/33728 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 13:56:00,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-84.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 2de9554d2db29c841908dc7706688d8dc299abb18d93013764f385fbb1a38056 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:56:02,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:56:02,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 13:56:02,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:56:02,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:56:02,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:56:02,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:56:02,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:56:02,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:56:02,491 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:56:02,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:56:02,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:56:02,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:56:02,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:56:02,492 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:56:02,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:56:02,493 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:56:02,493 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:56:02,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:56:02,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:56:02,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:56:02,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:56:02,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:56:02,497 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 13:56:02,498 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 13:56:02,498 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:56:02,498 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 13:56:02,498 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:56:02,499 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:56:02,499 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:56:02,499 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:56:02,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:56:02,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:56:02,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:56:02,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:56:02,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:56:02,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:56:02,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:56:02,502 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 13:56:02,502 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 13:56:02,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:56:02,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:56:02,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:56:02,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:56:02,503 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 -> 2de9554d2db29c841908dc7706688d8dc299abb18d93013764f385fbb1a38056 [2024-11-16 13:56:02,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:56:02,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:56:02,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:56:02,880 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:56:02,884 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:56:02,886 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-pe-ci_file-84.i [2024-11-16 13:56:04,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:56:04,616 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:56:04,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-84.i [2024-11-16 13:56:04,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4876a03/2d7b3e16614b47d48e7950f78ef07de5/FLAG8bfee442e [2024-11-16 13:56:04,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4876a03/2d7b3e16614b47d48e7950f78ef07de5 [2024-11-16 13:56:04,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:56:04,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:56:04,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:56:04,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:56:04,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:56:04,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:56:04" (1/1) ... [2024-11-16 13:56:04,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@781320f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:04, skipping insertion in model container [2024-11-16 13:56:04,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:56:04" (1/1) ... [2024-11-16 13:56:04,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:56:05,158 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-pe-ci_file-84.i[919,932] [2024-11-16 13:56:05,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:56:05,255 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:56:05,266 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-pe-ci_file-84.i[919,932] [2024-11-16 13:56:05,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:56:05,343 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:56:05,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:05 WrapperNode [2024-11-16 13:56:05,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:56:05,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:56:05,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:56:05,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:56:05,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:05" (1/1) ... [2024-11-16 13:56:05,370 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:05" (1/1) ... [2024-11-16 13:56:05,415 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-11-16 13:56:05,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:56:05,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:56:05,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:56:05,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:56:05,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:05" (1/1) ... [2024-11-16 13:56:05,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:05" (1/1) ... [2024-11-16 13:56:05,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:05" (1/1) ... [2024-11-16 13:56:05,461 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 13:56:05,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:05" (1/1) ... [2024-11-16 13:56:05,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:05" (1/1) ... [2024-11-16 13:56:05,474 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:05" (1/1) ... [2024-11-16 13:56:05,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:05" (1/1) ... [2024-11-16 13:56:05,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:05" (1/1) ... [2024-11-16 13:56:05,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:05" (1/1) ... [2024-11-16 13:56:05,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:56:05,485 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:56:05,485 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:56:05,485 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:56:05,486 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:05" (1/1) ... [2024-11-16 13:56:05,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:56:05,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:56:05,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 13:56:05,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 13:56:05,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:56:05,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 13:56:05,592 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:56:05,592 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:56:05,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:56:05,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:56:05,716 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:56:05,720 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:56:07,115 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 13:56:07,115 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:56:07,134 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:56:07,134 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:56:07,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:56:07 BoogieIcfgContainer [2024-11-16 13:56:07,135 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:56:07,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:56:07,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:56:07,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:56:07,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:56:04" (1/3) ... [2024-11-16 13:56:07,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0312a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:56:07, skipping insertion in model container [2024-11-16 13:56:07,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:56:05" (2/3) ... [2024-11-16 13:56:07,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0312a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:56:07, skipping insertion in model container [2024-11-16 13:56:07,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:56:07" (3/3) ... [2024-11-16 13:56:07,142 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-84.i [2024-11-16 13:56:07,160 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:56:07,160 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:56:07,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:56:07,226 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;@2ef62292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:56:07,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:56:07,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 13:56:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-16 13:56:07,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:07,250 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:56:07,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:07,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:07,256 INFO L85 PathProgramCache]: Analyzing trace with hash 543469878, now seen corresponding path program 1 times [2024-11-16 13:56:07,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:56:07,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778580682] [2024-11-16 13:56:07,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:07,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:56:07,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:56:07,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:56:07,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 13:56:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:07,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 13:56:07,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:56:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2024-11-16 13:56:07,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:56:07,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:56:07,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778580682] [2024-11-16 13:56:07,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778580682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:56:07,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:56:07,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:56:07,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905160723] [2024-11-16 13:56:07,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:56:07,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:56:07,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:56:07,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:56:07,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:56:07,801 INFO L87 Difference]: Start difference. First operand has 96 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) 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, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-16 13:56:07,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:56:07,841 INFO L93 Difference]: Finished difference Result 184 states and 325 transitions. [2024-11-16 13:56:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:56:07,843 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, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 206 [2024-11-16 13:56:07,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:56:07,849 INFO L225 Difference]: With dead ends: 184 [2024-11-16 13:56:07,850 INFO L226 Difference]: Without dead ends: 91 [2024-11-16 13:56:07,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:56:07,861 INFO L432 NwaCegarLoop]: 142 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, 142 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:56:07,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:56:07,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-16 13:56:07,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-16 13:56:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 13:56:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2024-11-16 13:56:07,908 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 206 [2024-11-16 13:56:07,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:56:07,908 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2024-11-16 13:56:07,909 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, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-16 13:56:07,909 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2024-11-16 13:56:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-16 13:56:07,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:07,916 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:56:07,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 13:56:08,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:56:08,118 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:08,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:08,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1442679764, now seen corresponding path program 1 times [2024-11-16 13:56:08,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:56:08,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898664404] [2024-11-16 13:56:08,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:08,120 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:56:08,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:56:08,122 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:56:08,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 13:56:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:08,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 13:56:08,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:56:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 13:56:08,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:56:08,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:56:08,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898664404] [2024-11-16 13:56:08,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898664404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:56:08,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:56:08,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:56:08,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805701051] [2024-11-16 13:56:08,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:56:08,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:56:08,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:56:08,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:56:08,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:56:08,562 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:56:08,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:56:08,711 INFO L93 Difference]: Finished difference Result 261 states and 408 transitions. [2024-11-16 13:56:08,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:56:08,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2024-11-16 13:56:08,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:56:08,719 INFO L225 Difference]: With dead ends: 261 [2024-11-16 13:56:08,720 INFO L226 Difference]: Without dead ends: 173 [2024-11-16 13:56:08,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:56:08,724 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 122 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:56:08,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 371 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:56:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-16 13:56:08,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 103. [2024-11-16 13:56:08,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 69 states have internal predecessors, (95), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 13:56:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 159 transitions. [2024-11-16 13:56:08,758 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 159 transitions. Word has length 206 [2024-11-16 13:56:08,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:56:08,760 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 159 transitions. [2024-11-16 13:56:08,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:56:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 159 transitions. [2024-11-16 13:56:08,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-16 13:56:08,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:08,767 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:56:08,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 13:56:08,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:56:08,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:08,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:08,971 INFO L85 PathProgramCache]: Analyzing trace with hash 445607411, now seen corresponding path program 1 times [2024-11-16 13:56:08,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:56:08,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284648304] [2024-11-16 13:56:08,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:08,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:56:08,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:56:08,976 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:56:08,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 13:56:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:09,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 13:56:09,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:56:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1068 proven. 135 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-11-16 13:56:10,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:56:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-16 13:56:11,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:56:11,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284648304] [2024-11-16 13:56:11,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284648304] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:56:11,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 13:56:11,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2024-11-16 13:56:11,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511762569] [2024-11-16 13:56:11,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 13:56:11,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 13:56:11,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:56:11,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 13:56:11,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 13:56:11,585 INFO L87 Difference]: Start difference. First operand 103 states and 159 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-11-16 13:56:12,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:56:12,378 INFO L93 Difference]: Finished difference Result 215 states and 325 transitions. [2024-11-16 13:56:12,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 13:56:12,381 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) Word has length 206 [2024-11-16 13:56:12,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:56:12,383 INFO L225 Difference]: With dead ends: 215 [2024-11-16 13:56:12,383 INFO L226 Difference]: Without dead ends: 115 [2024-11-16 13:56:12,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2024-11-16 13:56:12,385 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 44 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 13:56:12,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 189 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 13:56:12,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-16 13:56:12,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2024-11-16 13:56:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 75 states have (on average 1.32) internal successors, (99), 75 states have internal predecessors, (99), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 13:56:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-11-16 13:56:12,405 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 206 [2024-11-16 13:56:12,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:56:12,406 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-11-16 13:56:12,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-11-16 13:56:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-11-16 13:56:12,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-16 13:56:12,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:12,412 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:56:12,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 13:56:12,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:56:12,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:12,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:12,613 INFO L85 PathProgramCache]: Analyzing trace with hash 249093906, now seen corresponding path program 1 times [2024-11-16 13:56:12,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:56:12,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766665724] [2024-11-16 13:56:12,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:12,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:56:12,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:56:12,618 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:56:12,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 13:56:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:12,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 13:56:12,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:56:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-16 13:56:12,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:56:12,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:56:12,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766665724] [2024-11-16 13:56:12,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766665724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:56:12,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:56:12,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:56:12,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121668825] [2024-11-16 13:56:12,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:56:12,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:56:12,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:56:12,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:56:12,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:56:12,999 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:56:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:56:13,089 INFO L93 Difference]: Finished difference Result 204 states and 301 transitions. [2024-11-16 13:56:13,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:56:13,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2024-11-16 13:56:13,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:56:13,103 INFO L225 Difference]: With dead ends: 204 [2024-11-16 13:56:13,104 INFO L226 Difference]: Without dead ends: 96 [2024-11-16 13:56:13,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:56:13,105 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:56:13,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 126 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:56:13,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-16 13:56:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-16 13:56:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 13:56:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 137 transitions. [2024-11-16 13:56:13,127 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 137 transitions. Word has length 206 [2024-11-16 13:56:13,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:56:13,128 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 137 transitions. [2024-11-16 13:56:13,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-16 13:56:13,129 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 137 transitions. [2024-11-16 13:56:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-16 13:56:13,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:56:13,131 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:56:13,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-16 13:56:13,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:56:13,336 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:56:13,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:56:13,336 INFO L85 PathProgramCache]: Analyzing trace with hash 50016949, now seen corresponding path program 1 times [2024-11-16 13:56:13,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:56:13,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522356757] [2024-11-16 13:56:13,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:56:13,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:56:13,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:56:13,341 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:56:13,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 13:56:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:56:13,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 13:56:13,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:56:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1080 proven. 147 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-11-16 13:56:14,713 INFO L311 TraceCheckSpWp]: Computing backward predicates...