/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:46:38,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:46:38,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:46:38,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:46:39,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:46:39,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:46:39,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:46:39,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:46:39,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:46:39,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:46:39,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:46:39,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:46:39,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:46:39,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:46:39,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:46:39,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:46:39,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:46:39,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:46:39,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:46:39,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:46:39,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:46:39,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:46:39,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:46:39,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:46:39,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:46:39,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:46:39,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:46:39,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:46:39,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:46:39,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:46:39,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:46:39,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:46:39,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:46:39,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:46:39,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:46:39,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:46:39,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:46:39,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:46:39,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:46:39,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:46:39,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:46:39,059 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-02 23:46:39,074 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:46:39,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:46:39,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:46:39,078 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:46:39,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:46:39,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:46:39,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:46:39,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:46:39,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:46:39,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:46:39,079 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:46:39,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:46:39,079 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:46:39,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:46:39,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:46:39,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:46:39,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:46:39,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:46:39,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:46:39,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:46:39,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:46:39,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:46:39,081 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:46:39,081 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 23:46:39,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:46:39,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:46:39,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:46:39,421 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:46:39,422 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:46:39,423 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c [2021-05-02 23:46:39,485 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c09a496/0c492e71d34e4315904863dedf4dd1bc/FLAG4b78335ee [2021-05-02 23:46:40,030 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:46:40,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c [2021-05-02 23:46:40,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c09a496/0c492e71d34e4315904863dedf4dd1bc/FLAG4b78335ee [2021-05-02 23:46:40,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c09a496/0c492e71d34e4315904863dedf4dd1bc [2021-05-02 23:46:40,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:46:40,374 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:46:40,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:46:40,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:46:40,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:46:40,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:46:40" (1/1) ... [2021-05-02 23:46:40,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3163ddb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:46:40, skipping insertion in model container [2021-05-02 23:46:40,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:46:40" (1/1) ... [2021-05-02 23:46:40,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:46:40,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:46:40,621 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c[15516,15529] [2021-05-02 23:46:40,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:46:40,642 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:46:40,785 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c[15516,15529] [2021-05-02 23:46:40,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:46:40,813 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:46:40,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:46:40 WrapperNode [2021-05-02 23:46:40,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:46:40,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:46:40,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:46:40,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:46:40,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:46:40" (1/1) ... [2021-05-02 23:46:40,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:46:40" (1/1) ... [2021-05-02 23:46:40,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:46:40" (1/1) ... [2021-05-02 23:46:40,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:46:40" (1/1) ... [2021-05-02 23:46:40,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:46:40" (1/1) ... [2021-05-02 23:46:40,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:46:40" (1/1) ... [2021-05-02 23:46:40,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:46:40" (1/1) ... [2021-05-02 23:46:40,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:46:40,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:46:40,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:46:40,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:46:40,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:46:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:46:41,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:46:41,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:46:41,016 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:46:41,016 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:46:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:46:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:46:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:46:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:46:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_89 [2021-05-02 23:46:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2021-05-02 23:46:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:46:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:46:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:46:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-05-02 23:46:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:46:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:46:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:46:41,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:46:41,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:46:41,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-05-02 23:46:41,770 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:46:41,770 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-02 23:46:41,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:46:41 BoogieIcfgContainer [2021-05-02 23:46:41,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:46:41,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:46:41,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:46:41,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:46:41,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:46:40" (1/3) ... [2021-05-02 23:46:41,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158468f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:46:41, skipping insertion in model container [2021-05-02 23:46:41,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:46:40" (2/3) ... [2021-05-02 23:46:41,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158468f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:46:41, skipping insertion in model container [2021-05-02 23:46:41,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:46:41" (3/3) ... [2021-05-02 23:46:41,780 INFO L111 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+lhb-reducer.c [2021-05-02 23:46:41,785 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:46:41,788 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:46:41,801 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:46:41,826 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:46:41,826 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:46:41,826 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:46:41,826 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:46:41,826 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:46:41,826 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:46:41,826 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:46:41,826 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:46:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:46:41,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-05-02 23:46:41,855 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:46:41,856 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:46:41,856 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:46:41,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:46:41,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1054632774, now seen corresponding path program 1 times [2021-05-02 23:46:41,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:46:41,867 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1122756381] [2021-05-02 23:46:41,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:46:41,918 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:46:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:42,814 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-05-02 23:46:42,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:46:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:46:42,831 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:46:42,831 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1122756381] [2021-05-02 23:46:42,833 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1122756381] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:46:42,833 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:46:42,833 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-02 23:46:42,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473266372] [2021-05-02 23:46:42,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-02 23:46:42,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:46:42,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-02 23:46:42,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-05-02 23:46:42,853 INFO L87 Difference]: Start difference. First operand has 55 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:43,229 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2021-05-02 23:46:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:46:43,999 INFO L93 Difference]: Finished difference Result 92 states and 136 transitions. [2021-05-02 23:46:43,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 23:46:44,000 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2021-05-02 23:46:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:46:44,006 INFO L225 Difference]: With dead ends: 92 [2021-05-02 23:46:44,006 INFO L226 Difference]: Without dead ends: 57 [2021-05-02 23:46:44,009 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 725.7ms TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:46:44,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-05-02 23:46:44,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2021-05-02 23:46:44,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2021-05-02 23:46:44,041 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2021-05-02 23:46:44,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:46:44,041 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2021-05-02 23:46:44,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2021-05-02 23:46:44,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-02 23:46:44,043 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:46:44,043 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:46:44,043 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:46:44,043 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:46:44,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:46:44,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1470519801, now seen corresponding path program 1 times [2021-05-02 23:46:44,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:46:44,044 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1184978525] [2021-05-02 23:46:44,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:46:44,062 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:46:44,064 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:46:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:44,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:46:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:46:44,522 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:46:44,523 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1184978525] [2021-05-02 23:46:44,523 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1184978525] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:46:44,523 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:46:44,523 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-02 23:46:44,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831561087] [2021-05-02 23:46:44,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-02 23:46:44,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:46:44,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-02 23:46:44,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-05-02 23:46:44,526 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:45,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:46:45,394 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2021-05-02 23:46:45,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 23:46:45,395 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2021-05-02 23:46:45,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:46:45,396 INFO L225 Difference]: With dead ends: 65 [2021-05-02 23:46:45,396 INFO L226 Difference]: Without dead ends: 62 [2021-05-02 23:46:45,397 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 542.5ms TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:46:45,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-05-02 23:46:45,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2021-05-02 23:46:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2021-05-02 23:46:45,406 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 53 [2021-05-02 23:46:45,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:46:45,406 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2021-05-02 23:46:45,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:45,406 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2021-05-02 23:46:45,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-02 23:46:45,407 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:46:45,407 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:46:45,407 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:46:45,408 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:46:45,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:46:45,408 INFO L82 PathProgramCache]: Analyzing trace with hash 412615706, now seen corresponding path program 2 times [2021-05-02 23:46:45,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:46:45,408 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1796915771] [2021-05-02 23:46:45,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:46:45,417 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:46:45,419 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:46:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:45,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:46:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:46:45,888 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:46:45,888 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1796915771] [2021-05-02 23:46:45,888 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1796915771] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:46:45,889 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:46:45,889 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-02 23:46:45,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617351901] [2021-05-02 23:46:45,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-02 23:46:45,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:46:45,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-02 23:46:45,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2021-05-02 23:46:45,890 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:46,142 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2021-05-02 23:46:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:46:46,858 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2021-05-02 23:46:46,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-02 23:46:46,859 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2021-05-02 23:46:46,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:46:46,860 INFO L225 Difference]: With dead ends: 70 [2021-05-02 23:46:46,860 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 23:46:46,861 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 547.1ms TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:46:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 23:46:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2021-05-02 23:46:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2021-05-02 23:46:46,868 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 58 [2021-05-02 23:46:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:46:46,868 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2021-05-02 23:46:46,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:46,869 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2021-05-02 23:46:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-02 23:46:46,870 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:46:46,870 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:46:46,870 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:46:46,870 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:46:46,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:46:46,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1771010407, now seen corresponding path program 3 times [2021-05-02 23:46:46,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:46:46,871 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1923825382] [2021-05-02 23:46:46,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:46:46,883 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:46:46,885 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:46:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:47,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:46:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:46:47,400 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:46:47,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1923825382] [2021-05-02 23:46:47,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1923825382] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:46:47,401 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:46:47,401 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-02 23:46:47,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803967791] [2021-05-02 23:46:47,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-02 23:46:47,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:46:47,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-02 23:46:47,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2021-05-02 23:46:47,402 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:47,661 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2021-05-02 23:46:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:46:48,584 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2021-05-02 23:46:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-02 23:46:48,585 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2021-05-02 23:46:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:46:48,586 INFO L225 Difference]: With dead ends: 75 [2021-05-02 23:46:48,586 INFO L226 Difference]: Without dead ends: 72 [2021-05-02 23:46:48,587 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 617.7ms TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2021-05-02 23:46:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-02 23:46:48,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2021-05-02 23:46:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2021-05-02 23:46:48,595 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 63 [2021-05-02 23:46:48,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:46:48,596 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2021-05-02 23:46:48,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2021-05-02 23:46:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-02 23:46:48,597 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:46:48,597 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:46:48,597 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:46:48,597 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:46:48,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:46:48,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1370440838, now seen corresponding path program 4 times [2021-05-02 23:46:48,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:46:48,598 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1277505821] [2021-05-02 23:46:48,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:46:48,607 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:46:48,609 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:46:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:49,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:46:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:46:49,034 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:46:49,034 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1277505821] [2021-05-02 23:46:49,034 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1277505821] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:46:49,034 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:46:49,034 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-02 23:46:49,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988188788] [2021-05-02 23:46:49,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-02 23:46:49,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:46:49,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-02 23:46:49,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:46:49,036 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 21 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:46:50,077 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2021-05-02 23:46:50,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-02 23:46:50,078 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 21 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-05-02 23:46:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:46:50,079 INFO L225 Difference]: With dead ends: 80 [2021-05-02 23:46:50,079 INFO L226 Difference]: Without dead ends: 77 [2021-05-02 23:46:50,080 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 584.1ms TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 23:46:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-02 23:46:50,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2021-05-02 23:46:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2021-05-02 23:46:50,087 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 68 [2021-05-02 23:46:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:46:50,088 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2021-05-02 23:46:50,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 21 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2021-05-02 23:46:50,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-02 23:46:50,089 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:46:50,089 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:46:50,089 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:46:50,089 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:46:50,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:46:50,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1100780743, now seen corresponding path program 5 times [2021-05-02 23:46:50,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:46:50,090 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1395296478] [2021-05-02 23:46:50,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:46:50,097 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:46:50,099 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:46:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:50,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:46:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:46:50,651 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:46:50,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1395296478] [2021-05-02 23:46:50,651 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1395296478] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:46:50,651 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:46:50,652 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-02 23:46:50,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89606399] [2021-05-02 23:46:50,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-02 23:46:50,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:46:50,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-02 23:46:50,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2021-05-02 23:46:50,653 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:51,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:46:51,796 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2021-05-02 23:46:51,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-02 23:46:51,797 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2021-05-02 23:46:51,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:46:51,798 INFO L225 Difference]: With dead ends: 85 [2021-05-02 23:46:51,798 INFO L226 Difference]: Without dead ends: 82 [2021-05-02 23:46:51,805 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 723.0ms TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2021-05-02 23:46:51,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-05-02 23:46:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2021-05-02 23:46:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2021-05-02 23:46:51,813 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 73 [2021-05-02 23:46:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:46:51,814 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2021-05-02 23:46:51,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:51,814 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2021-05-02 23:46:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-02 23:46:51,814 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:46:51,815 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:46:51,815 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 23:46:51,815 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:46:51,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:46:51,815 INFO L82 PathProgramCache]: Analyzing trace with hash -812401958, now seen corresponding path program 6 times [2021-05-02 23:46:51,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:46:51,815 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1465001147] [2021-05-02 23:46:51,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:46:51,836 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:46:51,837 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:46:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:52,378 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-05-02 23:46:52,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:46:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:46:52,419 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:46:52,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1465001147] [2021-05-02 23:46:52,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1465001147] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:46:52,419 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:46:52,419 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-02 23:46:52,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065773559] [2021-05-02 23:46:52,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 23:46:52,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:46:52,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 23:46:52,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2021-05-02 23:46:52,421 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand has 24 states, 24 states have (on average 3.125) internal successors, (75), 23 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:46:53,691 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2021-05-02 23:46:53,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-02 23:46:53,693 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 23 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-05-02 23:46:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:46:53,694 INFO L225 Difference]: With dead ends: 90 [2021-05-02 23:46:53,694 INFO L226 Difference]: Without dead ends: 87 [2021-05-02 23:46:53,695 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 757.2ms TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:46:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-05-02 23:46:53,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2021-05-02 23:46:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:53,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2021-05-02 23:46:53,702 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 78 [2021-05-02 23:46:53,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:46:53,702 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2021-05-02 23:46:53,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 23 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:53,703 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2021-05-02 23:46:53,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-02 23:46:53,703 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:46:53,704 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:46:53,704 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 23:46:53,704 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:46:53,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:46:53,704 INFO L82 PathProgramCache]: Analyzing trace with hash -570882087, now seen corresponding path program 7 times [2021-05-02 23:46:53,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:46:53,705 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1763317942] [2021-05-02 23:46:53,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:46:53,716 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:46:53,717 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:46:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:54,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:46:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:46:54,245 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:46:54,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1763317942] [2021-05-02 23:46:54,246 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1763317942] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:46:54,246 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:46:54,246 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-02 23:46:54,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268637723] [2021-05-02 23:46:54,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-02 23:46:54,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:46:54,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-02 23:46:54,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:46:54,247 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand has 25 states, 25 states have (on average 3.2) internal successors, (80), 24 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:46:55,513 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2021-05-02 23:46:55,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-02 23:46:55,513 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.2) internal successors, (80), 24 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2021-05-02 23:46:55,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:46:55,514 INFO L225 Difference]: With dead ends: 95 [2021-05-02 23:46:55,514 INFO L226 Difference]: Without dead ends: 92 [2021-05-02 23:46:55,515 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 742.2ms TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:46:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-05-02 23:46:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2021-05-02 23:46:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2021-05-02 23:46:55,522 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 83 [2021-05-02 23:46:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:46:55,522 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2021-05-02 23:46:55,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 3.2) internal successors, (80), 24 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2021-05-02 23:46:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-05-02 23:46:55,523 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:46:55,524 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:46:55,524 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 23:46:55,524 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:46:55,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:46:55,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1780941370, now seen corresponding path program 8 times [2021-05-02 23:46:55,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:46:55,524 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [811346004] [2021-05-02 23:46:55,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:46:55,534 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:46:55,536 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:46:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:56,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:46:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:46:56,110 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:46:56,110 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [811346004] [2021-05-02 23:46:56,110 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [811346004] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:46:56,110 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:46:56,111 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-02 23:46:56,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566479439] [2021-05-02 23:46:56,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 23:46:56,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:46:56,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 23:46:56,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2021-05-02 23:46:56,112 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 25 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:57,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:46:57,509 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2021-05-02 23:46:57,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-02 23:46:57,511 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 25 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2021-05-02 23:46:57,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:46:57,511 INFO L225 Difference]: With dead ends: 100 [2021-05-02 23:46:57,511 INFO L226 Difference]: Without dead ends: 97 [2021-05-02 23:46:57,512 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 832.3ms TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 23:46:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-02 23:46:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2021-05-02 23:46:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2021-05-02 23:46:57,520 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 88 [2021-05-02 23:46:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:46:57,520 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2021-05-02 23:46:57,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 25 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2021-05-02 23:46:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-02 23:46:57,521 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:46:57,522 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:46:57,522 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 23:46:57,522 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:46:57,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:46:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1289003911, now seen corresponding path program 9 times [2021-05-02 23:46:57,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:46:57,522 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1210779457] [2021-05-02 23:46:57,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:46:57,529 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:46:57,531 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:46:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:58,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:46:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:46:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:46:58,084 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:46:58,085 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1210779457] [2021-05-02 23:46:58,085 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1210779457] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:46:58,085 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:46:58,085 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-02 23:46:58,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421477547] [2021-05-02 23:46:58,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-02 23:46:58,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:46:58,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-02 23:46:58,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=643, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:46:58,086 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 26 states have internal predecessors, (90), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:46:59,502 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2021-05-02 23:46:59,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-02 23:46:59,504 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 26 states have internal predecessors, (90), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2021-05-02 23:46:59,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:46:59,505 INFO L225 Difference]: With dead ends: 105 [2021-05-02 23:46:59,505 INFO L226 Difference]: Without dead ends: 102 [2021-05-02 23:46:59,506 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 804.7ms TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 23:46:59,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-05-02 23:46:59,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2021-05-02 23:46:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2021-05-02 23:46:59,514 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 93 [2021-05-02 23:46:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:46:59,514 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2021-05-02 23:46:59,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 26 states have internal predecessors, (90), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:46:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2021-05-02 23:46:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-05-02 23:46:59,515 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:46:59,515 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:46:59,516 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 23:46:59,516 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:46:59,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:46:59,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1817219482, now seen corresponding path program 10 times [2021-05-02 23:46:59,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:46:59,516 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [918444752] [2021-05-02 23:46:59,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:46:59,527 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:46:59,528 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:46:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:00,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:47:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:00,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:47:00,110 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:47:00,110 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [918444752] [2021-05-02 23:47:00,110 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [918444752] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:47:00,110 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:47:00,110 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-02 23:47:00,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928845153] [2021-05-02 23:47:00,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-02 23:47:00,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:47:00,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-02 23:47:00,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=695, Unknown=0, NotChecked=0, Total=756 [2021-05-02 23:47:00,111 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 27 states have internal predecessors, (95), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:47:01,665 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2021-05-02 23:47:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-02 23:47:01,665 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 27 states have internal predecessors, (95), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2021-05-02 23:47:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:47:01,666 INFO L225 Difference]: With dead ends: 110 [2021-05-02 23:47:01,666 INFO L226 Difference]: Without dead ends: 107 [2021-05-02 23:47:01,667 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 887.0ms TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2021-05-02 23:47:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-05-02 23:47:01,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2021-05-02 23:47:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2021-05-02 23:47:01,676 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 98 [2021-05-02 23:47:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:47:01,676 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2021-05-02 23:47:01,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 27 states have internal predecessors, (95), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2021-05-02 23:47:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-05-02 23:47:01,677 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:47:01,677 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:47:01,677 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 23:47:01,678 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:47:01,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:47:01,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1265920281, now seen corresponding path program 11 times [2021-05-02 23:47:01,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:47:01,678 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [639547935] [2021-05-02 23:47:01,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:47:01,685 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:47:01,686 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:47:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:02,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:47:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:47:02,277 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:47:02,278 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [639547935] [2021-05-02 23:47:02,278 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [639547935] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:47:02,278 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:47:02,278 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-02 23:47:02,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331802646] [2021-05-02 23:47:02,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-02 23:47:02,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:47:02,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-02 23:47:02,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:47:02,281 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand has 29 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 28 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:47:04,040 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2021-05-02 23:47:04,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-02 23:47:04,041 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 28 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2021-05-02 23:47:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:47:04,042 INFO L225 Difference]: With dead ends: 115 [2021-05-02 23:47:04,042 INFO L226 Difference]: Without dead ends: 112 [2021-05-02 23:47:04,043 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 955.8ms TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:47:04,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-05-02 23:47:04,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2021-05-02 23:47:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 105 states have (on average 1.0095238095238095) internal successors, (106), 105 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2021-05-02 23:47:04,050 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 103 [2021-05-02 23:47:04,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:47:04,050 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2021-05-02 23:47:04,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 28 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2021-05-02 23:47:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-05-02 23:47:04,057 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:47:04,057 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:47:04,057 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-02 23:47:04,057 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:47:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:47:04,058 INFO L82 PathProgramCache]: Analyzing trace with hash 618031354, now seen corresponding path program 12 times [2021-05-02 23:47:04,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:47:04,059 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [371922702] [2021-05-02 23:47:04,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:47:04,069 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:47:04,072 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:47:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:04,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:47:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:47:04,742 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:47:04,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [371922702] [2021-05-02 23:47:04,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [371922702] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:47:04,742 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:47:04,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-02 23:47:04,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409379718] [2021-05-02 23:47:04,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-02 23:47:04,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:47:04,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-02 23:47:04,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=805, Unknown=0, NotChecked=0, Total=870 [2021-05-02 23:47:04,743 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand has 30 states, 30 states have (on average 3.5) internal successors, (105), 29 states have internal predecessors, (105), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:06,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:47:06,556 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2021-05-02 23:47:06,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-02 23:47:06,557 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.5) internal successors, (105), 29 states have internal predecessors, (105), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2021-05-02 23:47:06,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:47:06,558 INFO L225 Difference]: With dead ends: 120 [2021-05-02 23:47:06,558 INFO L226 Difference]: Without dead ends: 117 [2021-05-02 23:47:06,559 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1010.0ms TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:47:06,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-05-02 23:47:06,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2021-05-02 23:47:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 110 states have (on average 1.009090909090909) internal successors, (111), 110 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2021-05-02 23:47:06,565 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 108 [2021-05-02 23:47:06,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:47:06,565 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2021-05-02 23:47:06,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 3.5) internal successors, (105), 29 states have internal predecessors, (105), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2021-05-02 23:47:06,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-05-02 23:47:06,566 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:47:06,566 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:47:06,566 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 23:47:06,566 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:47:06,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:47:06,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1546768967, now seen corresponding path program 13 times [2021-05-02 23:47:06,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:47:06,567 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1403377144] [2021-05-02 23:47:06,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:47:06,575 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:47:06,576 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:47:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:07,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:47:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:47:07,244 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:47:07,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1403377144] [2021-05-02 23:47:07,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1403377144] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:47:07,244 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:47:07,244 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-02 23:47:07,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825587519] [2021-05-02 23:47:07,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-02 23:47:07,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:47:07,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-02 23:47:07,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=863, Unknown=0, NotChecked=0, Total=930 [2021-05-02 23:47:07,245 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand has 31 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 30 states have internal predecessors, (110), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:47:09,206 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2021-05-02 23:47:09,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-02 23:47:09,206 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 30 states have internal predecessors, (110), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2021-05-02 23:47:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:47:09,207 INFO L225 Difference]: With dead ends: 125 [2021-05-02 23:47:09,207 INFO L226 Difference]: Without dead ends: 122 [2021-05-02 23:47:09,208 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1083.8ms TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2021-05-02 23:47:09,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-05-02 23:47:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2021-05-02 23:47:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 115 states have (on average 1.008695652173913) internal successors, (116), 115 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2021-05-02 23:47:09,226 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 113 [2021-05-02 23:47:09,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:47:09,226 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2021-05-02 23:47:09,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 30 states have internal predecessors, (110), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2021-05-02 23:47:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-05-02 23:47:09,227 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:47:09,227 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:47:09,227 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-02 23:47:09,227 INFO L428 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:47:09,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:47:09,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1560377254, now seen corresponding path program 14 times [2021-05-02 23:47:09,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:47:09,228 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [427920121] [2021-05-02 23:47:09,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:47:09,236 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:47:09,237 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:47:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:09,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:47:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:47:09,947 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:47:09,947 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [427920121] [2021-05-02 23:47:09,948 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [427920121] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:47:09,948 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:47:09,948 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-02 23:47:09,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773356063] [2021-05-02 23:47:09,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-02 23:47:09,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:47:09,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-02 23:47:09,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=923, Unknown=0, NotChecked=0, Total=992 [2021-05-02 23:47:09,949 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand has 32 states, 32 states have (on average 3.59375) internal successors, (115), 31 states have internal predecessors, (115), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:12,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:47:12,066 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2021-05-02 23:47:12,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-02 23:47:12,067 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.59375) internal successors, (115), 31 states have internal predecessors, (115), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2021-05-02 23:47:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:47:12,068 INFO L225 Difference]: With dead ends: 130 [2021-05-02 23:47:12,068 INFO L226 Difference]: Without dead ends: 127 [2021-05-02 23:47:12,068 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1112.8ms TimeCoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2021-05-02 23:47:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-05-02 23:47:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2021-05-02 23:47:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 120 states have (on average 1.0083333333333333) internal successors, (121), 120 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2021-05-02 23:47:12,075 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 118 [2021-05-02 23:47:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:47:12,076 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2021-05-02 23:47:12,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 3.59375) internal successors, (115), 31 states have internal predecessors, (115), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2021-05-02 23:47:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-02 23:47:12,076 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:47:12,076 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:47:12,076 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 23:47:12,077 INFO L428 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:47:12,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:47:12,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1219668569, now seen corresponding path program 15 times [2021-05-02 23:47:12,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:47:12,077 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [812206490] [2021-05-02 23:47:12,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:47:12,095 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:47:12,096 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:47:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:12,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:47:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:47:12,818 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:47:12,818 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [812206490] [2021-05-02 23:47:12,818 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [812206490] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:47:12,818 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:47:12,818 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-02 23:47:12,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410034500] [2021-05-02 23:47:12,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-02 23:47:12,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:47:12,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-02 23:47:12,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=985, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 23:47:12,819 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 32 states have internal predecessors, (120), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:13,160 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2021-05-02 23:47:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:47:15,066 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2021-05-02 23:47:15,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-02 23:47:15,066 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 32 states have internal predecessors, (120), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2021-05-02 23:47:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:47:15,067 INFO L225 Difference]: With dead ends: 135 [2021-05-02 23:47:15,067 INFO L226 Difference]: Without dead ends: 132 [2021-05-02 23:47:15,068 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1165.7ms TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:47:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-05-02 23:47:15,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2021-05-02 23:47:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 125 states have (on average 1.008) internal successors, (126), 125 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2021-05-02 23:47:15,075 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 123 [2021-05-02 23:47:15,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:47:15,075 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2021-05-02 23:47:15,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 32 states have internal predecessors, (120), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2021-05-02 23:47:15,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-05-02 23:47:15,076 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:47:15,076 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:47:15,076 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-02 23:47:15,076 INFO L428 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:47:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:47:15,077 INFO L82 PathProgramCache]: Analyzing trace with hash 378466234, now seen corresponding path program 16 times [2021-05-02 23:47:15,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:47:15,077 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1107569102] [2021-05-02 23:47:15,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:47:15,085 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:47:15,086 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:47:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:15,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:47:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:47:15,857 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:47:15,858 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1107569102] [2021-05-02 23:47:15,858 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1107569102] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:47:15,858 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:47:15,858 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-02 23:47:15,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694277612] [2021-05-02 23:47:15,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-02 23:47:15,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:47:15,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-02 23:47:15,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1049, Unknown=0, NotChecked=0, Total=1122 [2021-05-02 23:47:15,859 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand has 34 states, 34 states have (on average 3.676470588235294) internal successors, (125), 33 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:18,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:47:18,256 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2021-05-02 23:47:18,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-02 23:47:18,258 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.676470588235294) internal successors, (125), 33 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 128 [2021-05-02 23:47:18,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:47:18,258 INFO L225 Difference]: With dead ends: 140 [2021-05-02 23:47:18,258 INFO L226 Difference]: Without dead ends: 137 [2021-05-02 23:47:18,259 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1259.0ms TimeCoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2021-05-02 23:47:18,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-05-02 23:47:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2021-05-02 23:47:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 130 states have (on average 1.0076923076923077) internal successors, (131), 130 states have internal predecessors, (131), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2021-05-02 23:47:18,267 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 128 [2021-05-02 23:47:18,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:47:18,267 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2021-05-02 23:47:18,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 3.676470588235294) internal successors, (125), 33 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2021-05-02 23:47:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-05-02 23:47:18,268 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:47:18,268 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:47:18,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 23:47:18,268 INFO L428 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:47:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:47:18,268 INFO L82 PathProgramCache]: Analyzing trace with hash -165945607, now seen corresponding path program 17 times [2021-05-02 23:47:18,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:47:18,269 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [310700506] [2021-05-02 23:47:18,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:47:18,277 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:47:18,278 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:47:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:19,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:47:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:47:19,179 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:47:19,179 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [310700506] [2021-05-02 23:47:19,179 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [310700506] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:47:19,179 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:47:19,179 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-02 23:47:19,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069219385] [2021-05-02 23:47:19,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-02 23:47:19,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:47:19,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-02 23:47:19,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1115, Unknown=0, NotChecked=0, Total=1190 [2021-05-02 23:47:19,180 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 34 states have internal predecessors, (130), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:19,566 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2021-05-02 23:47:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:47:21,828 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2021-05-02 23:47:21,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-02 23:47:21,829 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 34 states have internal predecessors, (130), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2021-05-02 23:47:21,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:47:21,830 INFO L225 Difference]: With dead ends: 145 [2021-05-02 23:47:21,830 INFO L226 Difference]: Without dead ends: 142 [2021-05-02 23:47:21,831 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1442.7ms TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2021-05-02 23:47:21,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-05-02 23:47:21,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2021-05-02 23:47:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 135 states have (on average 1.0074074074074073) internal successors, (136), 135 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2021-05-02 23:47:21,839 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 133 [2021-05-02 23:47:21,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:47:21,839 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2021-05-02 23:47:21,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 34 states have internal predecessors, (130), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2021-05-02 23:47:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-05-02 23:47:21,840 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:47:21,840 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:47:21,840 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-02 23:47:21,840 INFO L428 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:47:21,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:47:21,840 INFO L82 PathProgramCache]: Analyzing trace with hash 802004762, now seen corresponding path program 18 times [2021-05-02 23:47:21,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:47:21,840 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [698776261] [2021-05-02 23:47:21,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:47:21,852 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:47:21,856 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:47:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:22,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:47:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:47:22,746 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:47:22,746 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [698776261] [2021-05-02 23:47:22,746 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [698776261] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:47:22,747 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:47:22,747 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-02 23:47:22,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146556111] [2021-05-02 23:47:22,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-02 23:47:22,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:47:22,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-02 23:47:22,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1183, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 23:47:22,748 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand has 36 states, 36 states have (on average 3.75) internal successors, (135), 35 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:47:25,477 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2021-05-02 23:47:25,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-02 23:47:25,481 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.75) internal successors, (135), 35 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 138 [2021-05-02 23:47:25,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:47:25,482 INFO L225 Difference]: With dead ends: 150 [2021-05-02 23:47:25,482 INFO L226 Difference]: Without dead ends: 147 [2021-05-02 23:47:25,483 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1462.3ms TimeCoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2021-05-02 23:47:25,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-05-02 23:47:25,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2021-05-02 23:47:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 140 states have (on average 1.0071428571428571) internal successors, (141), 140 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:25,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2021-05-02 23:47:25,491 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 138 [2021-05-02 23:47:25,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:47:25,491 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2021-05-02 23:47:25,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 3.75) internal successors, (135), 35 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:25,492 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2021-05-02 23:47:25,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-05-02 23:47:25,492 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:47:25,492 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:47:25,492 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 23:47:25,493 INFO L428 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:47:25,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:47:25,493 INFO L82 PathProgramCache]: Analyzing trace with hash 931384217, now seen corresponding path program 19 times [2021-05-02 23:47:25,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:47:25,493 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2105426614] [2021-05-02 23:47:25,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:47:25,502 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:47:25,504 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:47:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:26,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:47:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:47:26,397 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:47:26,397 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2105426614] [2021-05-02 23:47:26,397 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2105426614] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:47:26,397 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:47:26,397 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-02 23:47:26,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372806298] [2021-05-02 23:47:26,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-02 23:47:26,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:47:26,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-02 23:47:26,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1253, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:47:26,399 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand has 37 states, 37 states have (on average 3.7837837837837838) internal successors, (140), 36 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:47:29,336 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2021-05-02 23:47:29,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-02 23:47:29,337 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.7837837837837838) internal successors, (140), 36 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2021-05-02 23:47:29,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:47:29,338 INFO L225 Difference]: With dead ends: 155 [2021-05-02 23:47:29,338 INFO L226 Difference]: Without dead ends: 152 [2021-05-02 23:47:29,339 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1510.7ms TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2021-05-02 23:47:29,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-05-02 23:47:29,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2021-05-02 23:47:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 145 states have (on average 1.006896551724138) internal successors, (146), 145 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2021-05-02 23:47:29,356 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 143 [2021-05-02 23:47:29,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:47:29,357 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2021-05-02 23:47:29,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 3.7837837837837838) internal successors, (140), 36 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:29,357 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2021-05-02 23:47:29,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-05-02 23:47:29,357 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:47:29,358 INFO L523 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:47:29,358 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-02 23:47:29,358 INFO L428 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:47:29,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:47:29,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2139133562, now seen corresponding path program 20 times [2021-05-02 23:47:29,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:47:29,358 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1927021695] [2021-05-02 23:47:29,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:47:29,366 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:47:29,367 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:47:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:30,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:47:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:47:30,263 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:47:30,264 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1927021695] [2021-05-02 23:47:30,264 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1927021695] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:47:30,264 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:47:30,264 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-02 23:47:30,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116038075] [2021-05-02 23:47:30,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-02 23:47:30,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:47:30,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-02 23:47:30,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1325, Unknown=0, NotChecked=0, Total=1406 [2021-05-02 23:47:30,265 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand has 38 states, 38 states have (on average 3.8157894736842106) internal successors, (145), 37 states have internal predecessors, (145), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:47:33,405 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2021-05-02 23:47:33,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-02 23:47:33,406 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.8157894736842106) internal successors, (145), 37 states have internal predecessors, (145), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 148 [2021-05-02 23:47:33,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:47:33,407 INFO L225 Difference]: With dead ends: 160 [2021-05-02 23:47:33,407 INFO L226 Difference]: Without dead ends: 157 [2021-05-02 23:47:33,408 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1565.2ms TimeCoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2021-05-02 23:47:33,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-05-02 23:47:33,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2021-05-02 23:47:33,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 150 states have (on average 1.0066666666666666) internal successors, (151), 150 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:33,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2021-05-02 23:47:33,418 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 148 [2021-05-02 23:47:33,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:47:33,418 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2021-05-02 23:47:33,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 3.8157894736842106) internal successors, (145), 37 states have internal predecessors, (145), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2021-05-02 23:47:33,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-05-02 23:47:33,424 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:47:33,424 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:47:33,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-02 23:47:33,424 INFO L428 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:47:33,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:47:33,425 INFO L82 PathProgramCache]: Analyzing trace with hash 132411449, now seen corresponding path program 21 times [2021-05-02 23:47:33,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:47:33,425 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1399699975] [2021-05-02 23:47:33,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:47:33,434 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:47:33,435 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:47:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:34,462 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-05-02 23:47:34,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:47:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:47:34,474 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:47:34,474 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1399699975] [2021-05-02 23:47:34,474 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1399699975] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:47:34,474 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:47:34,474 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-02 23:47:34,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398804058] [2021-05-02 23:47:34,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-02 23:47:34,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:47:34,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-02 23:47:34,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1399, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:47:34,475 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand has 39 states, 39 states have (on average 3.8461538461538463) internal successors, (150), 38 states have internal predecessors, (150), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:34,887 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2021-05-02 23:47:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:47:37,963 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2021-05-02 23:47:37,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-02 23:47:37,966 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.8461538461538463) internal successors, (150), 38 states have internal predecessors, (150), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2021-05-02 23:47:37,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:47:37,967 INFO L225 Difference]: With dead ends: 165 [2021-05-02 23:47:37,967 INFO L226 Difference]: Without dead ends: 162 [2021-05-02 23:47:37,967 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1744.5ms TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2021-05-02 23:47:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-05-02 23:47:37,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2021-05-02 23:47:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.0064516129032257) internal successors, (156), 155 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2021-05-02 23:47:37,976 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 153 [2021-05-02 23:47:37,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:47:37,977 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2021-05-02 23:47:37,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 3.8461538461538463) internal successors, (150), 38 states have internal predecessors, (150), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2021-05-02 23:47:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-05-02 23:47:37,978 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:47:37,978 INFO L523 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:47:37,978 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-02 23:47:37,978 INFO L428 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:47:37,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:47:37,978 INFO L82 PathProgramCache]: Analyzing trace with hash -689056294, now seen corresponding path program 22 times [2021-05-02 23:47:37,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:47:37,978 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [460821059] [2021-05-02 23:47:37,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:47:37,987 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:47:37,988 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:47:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:38,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:47:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:47:39,006 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:47:39,006 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [460821059] [2021-05-02 23:47:39,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [460821059] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:47:39,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:47:39,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-02 23:47:39,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524445903] [2021-05-02 23:47:39,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-02 23:47:39,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:47:39,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-02 23:47:39,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1475, Unknown=0, NotChecked=0, Total=1560 [2021-05-02 23:47:39,007 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand has 40 states, 40 states have (on average 3.875) internal successors, (155), 39 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:42,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:47:42,669 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2021-05-02 23:47:42,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-02 23:47:42,670 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.875) internal successors, (155), 39 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 158 [2021-05-02 23:47:42,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:47:42,670 INFO L225 Difference]: With dead ends: 170 [2021-05-02 23:47:42,670 INFO L226 Difference]: Without dead ends: 167 [2021-05-02 23:47:42,671 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 1828.0ms TimeCoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2021-05-02 23:47:42,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-05-02 23:47:42,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2021-05-02 23:47:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 160 states have (on average 1.00625) internal successors, (161), 160 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2021-05-02 23:47:42,680 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 158 [2021-05-02 23:47:42,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:47:42,681 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2021-05-02 23:47:42,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 3.875) internal successors, (155), 39 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2021-05-02 23:47:42,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-05-02 23:47:42,681 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:47:42,681 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:47:42,682 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-02 23:47:42,682 INFO L428 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:47:42,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:47:42,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1907870937, now seen corresponding path program 23 times [2021-05-02 23:47:42,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:47:42,682 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [605164762] [2021-05-02 23:47:42,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:47:42,691 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:47:42,693 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:47:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:43,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:47:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:43,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:47:43,804 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:47:43,805 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [605164762] [2021-05-02 23:47:43,805 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [605164762] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:47:43,805 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:47:43,805 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-02 23:47:43,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132423098] [2021-05-02 23:47:43,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-02 23:47:43,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:47:43,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-02 23:47:43,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1553, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 23:47:43,806 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand has 41 states, 41 states have (on average 3.902439024390244) internal successors, (160), 40 states have internal predecessors, (160), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:44,244 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2021-05-02 23:47:47,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:47:47,776 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2021-05-02 23:47:47,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-02 23:47:47,777 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.902439024390244) internal successors, (160), 40 states have internal predecessors, (160), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 163 [2021-05-02 23:47:47,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:47:47,778 INFO L225 Difference]: With dead ends: 175 [2021-05-02 23:47:47,778 INFO L226 Difference]: Without dead ends: 172 [2021-05-02 23:47:47,779 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1988.3ms TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2021-05-02 23:47:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-05-02 23:47:47,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2021-05-02 23:47:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 165 states have (on average 1.006060606060606) internal successors, (166), 165 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:47,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2021-05-02 23:47:47,790 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 163 [2021-05-02 23:47:47,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:47:47,790 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2021-05-02 23:47:47,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 3.902439024390244) internal successors, (160), 40 states have internal predecessors, (160), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:47,790 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2021-05-02 23:47:47,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-05-02 23:47:47,791 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:47:47,791 INFO L523 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:47:47,791 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-02 23:47:47,791 INFO L428 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:47:47,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:47:47,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1478795974, now seen corresponding path program 24 times [2021-05-02 23:47:47,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:47:47,792 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [877940734] [2021-05-02 23:47:47,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:47:47,801 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:47:47,802 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:47:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:49,008 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-05-02 23:47:49,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:47:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:47:49,016 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:47:49,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [877940734] [2021-05-02 23:47:49,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [877940734] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:47:49,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:47:49,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-02 23:47:49,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778824216] [2021-05-02 23:47:49,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-02 23:47:49,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:47:49,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-02 23:47:49,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1633, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 23:47:49,018 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand has 42 states, 42 states have (on average 3.9285714285714284) internal successors, (165), 41 states have internal predecessors, (165), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:49,468 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2021-05-02 23:47:53,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:47:53,224 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2021-05-02 23:47:53,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-02 23:47:53,224 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.9285714285714284) internal successors, (165), 41 states have internal predecessors, (165), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 168 [2021-05-02 23:47:53,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:47:53,225 INFO L225 Difference]: With dead ends: 180 [2021-05-02 23:47:53,225 INFO L226 Difference]: Without dead ends: 177 [2021-05-02 23:47:53,226 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 2112.9ms TimeCoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2021-05-02 23:47:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-05-02 23:47:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2021-05-02 23:47:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 170 states have (on average 1.0058823529411764) internal successors, (171), 170 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2021-05-02 23:47:53,247 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 168 [2021-05-02 23:47:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:47:53,247 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2021-05-02 23:47:53,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 3.9285714285714284) internal successors, (165), 41 states have internal predecessors, (165), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2021-05-02 23:47:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-05-02 23:47:53,248 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:47:53,248 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:47:53,248 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-02 23:47:53,248 INFO L428 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:47:53,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:47:53,249 INFO L82 PathProgramCache]: Analyzing trace with hash 787997049, now seen corresponding path program 25 times [2021-05-02 23:47:53,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:47:53,249 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1906064972] [2021-05-02 23:47:53,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:47:53,257 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:47:53,258 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:47:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:54,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:47:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:47:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:47:54,474 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:47:54,474 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1906064972] [2021-05-02 23:47:54,474 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1906064972] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:47:54,474 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:47:54,474 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-02 23:47:54,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019905506] [2021-05-02 23:47:54,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-02 23:47:54,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:47:54,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-02 23:47:54,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1715, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 23:47:54,477 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand has 43 states, 43 states have (on average 3.953488372093023) internal successors, (170), 42 states have internal predecessors, (170), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:54,925 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2021-05-02 23:47:58,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:47:58,897 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2021-05-02 23:47:58,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-02 23:47:58,897 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.953488372093023) internal successors, (170), 42 states have internal predecessors, (170), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 173 [2021-05-02 23:47:58,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:47:58,898 INFO L225 Difference]: With dead ends: 185 [2021-05-02 23:47:58,898 INFO L226 Difference]: Without dead ends: 182 [2021-05-02 23:47:58,899 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2175.1ms TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2021-05-02 23:47:58,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-05-02 23:47:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2021-05-02 23:47:58,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 175 states have (on average 1.0057142857142858) internal successors, (176), 175 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:58,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2021-05-02 23:47:58,910 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 173 [2021-05-02 23:47:58,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:47:58,910 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2021-05-02 23:47:58,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 43 states have (on average 3.953488372093023) internal successors, (170), 42 states have internal predecessors, (170), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:47:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2021-05-02 23:47:58,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-05-02 23:47:58,911 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:47:58,911 INFO L523 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:47:58,911 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-02 23:47:58,911 INFO L428 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:47:58,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:47:58,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1687104666, now seen corresponding path program 26 times [2021-05-02 23:47:58,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:47:58,912 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1277320545] [2021-05-02 23:47:58,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:47:58,920 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:47:58,922 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:47:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:48:00,298 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-05-02 23:48:00,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:48:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:48:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:48:00,305 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:48:00,305 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1277320545] [2021-05-02 23:48:00,305 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1277320545] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:48:00,305 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:48:00,305 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-02 23:48:00,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153470751] [2021-05-02 23:48:00,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-02 23:48:00,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:48:00,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-02 23:48:00,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1799, Unknown=0, NotChecked=0, Total=1892 [2021-05-02 23:48:00,306 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand has 44 states, 44 states have (on average 3.977272727272727) internal successors, (175), 43 states have internal predecessors, (175), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:00,774 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2021-05-02 23:48:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:48:05,166 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2021-05-02 23:48:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-02 23:48:05,167 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.977272727272727) internal successors, (175), 43 states have internal predecessors, (175), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 178 [2021-05-02 23:48:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:48:05,168 INFO L225 Difference]: With dead ends: 190 [2021-05-02 23:48:05,168 INFO L226 Difference]: Without dead ends: 187 [2021-05-02 23:48:05,169 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 2431.2ms TimeCoverageRelationStatistics Valid=225, Invalid=5627, Unknown=0, NotChecked=0, Total=5852 [2021-05-02 23:48:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-05-02 23:48:05,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2021-05-02 23:48:05,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 180 states have (on average 1.0055555555555555) internal successors, (181), 180 states have internal predecessors, (181), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2021-05-02 23:48:05,180 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 178 [2021-05-02 23:48:05,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:48:05,180 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2021-05-02 23:48:05,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 3.977272727272727) internal successors, (175), 43 states have internal predecessors, (175), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2021-05-02 23:48:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-05-02 23:48:05,180 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:48:05,181 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:48:05,181 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-02 23:48:05,181 INFO L428 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:48:05,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:48:05,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1226747417, now seen corresponding path program 27 times [2021-05-02 23:48:05,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:48:05,181 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [768485837] [2021-05-02 23:48:05,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:48:05,189 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:48:05,191 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:48:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:48:05,614 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2021-05-02 23:48:06,733 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-05-02 23:48:06,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:48:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:48:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:48:06,740 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:48:06,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [768485837] [2021-05-02 23:48:06,740 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [768485837] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:48:06,740 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:48:06,741 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-02 23:48:06,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463144891] [2021-05-02 23:48:06,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-02 23:48:06,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:48:06,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-02 23:48:06,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1885, Unknown=0, NotChecked=0, Total=1980 [2021-05-02 23:48:06,742 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand has 45 states, 45 states have (on average 4.0) internal successors, (180), 44 states have internal predecessors, (180), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:07,215 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2021-05-02 23:48:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:48:11,954 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2021-05-02 23:48:11,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-02 23:48:11,954 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 4.0) internal successors, (180), 44 states have internal predecessors, (180), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 183 [2021-05-02 23:48:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:48:11,955 INFO L225 Difference]: With dead ends: 195 [2021-05-02 23:48:11,955 INFO L226 Difference]: Without dead ends: 192 [2021-05-02 23:48:11,956 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 2711.0ms TimeCoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2021-05-02 23:48:11,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-05-02 23:48:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2021-05-02 23:48:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 185 states have (on average 1.0054054054054054) internal successors, (186), 185 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2021-05-02 23:48:11,967 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 183 [2021-05-02 23:48:11,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:48:11,967 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2021-05-02 23:48:11,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 4.0) internal successors, (180), 44 states have internal predecessors, (180), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2021-05-02 23:48:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-05-02 23:48:11,968 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:48:11,968 INFO L523 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:48:11,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-02 23:48:11,968 INFO L428 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:48:11,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:48:11,969 INFO L82 PathProgramCache]: Analyzing trace with hash -540064774, now seen corresponding path program 28 times [2021-05-02 23:48:11,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:48:11,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2091009443] [2021-05-02 23:48:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:48:11,977 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:48:11,979 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:48:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:48:13,481 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-05-02 23:48:13,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:48:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:48:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:48:13,494 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:48:13,494 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2091009443] [2021-05-02 23:48:13,494 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2091009443] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:48:13,494 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:48:13,494 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-02 23:48:13,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518862694] [2021-05-02 23:48:13,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-02 23:48:13,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:48:13,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-02 23:48:13,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1973, Unknown=0, NotChecked=0, Total=2070 [2021-05-02 23:48:13,495 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand has 46 states, 46 states have (on average 4.021739130434782) internal successors, (185), 45 states have internal predecessors, (185), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:13,959 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2021-05-02 23:48:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:48:19,030 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2021-05-02 23:48:19,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-02 23:48:19,031 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.021739130434782) internal successors, (185), 45 states have internal predecessors, (185), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 188 [2021-05-02 23:48:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:48:19,032 INFO L225 Difference]: With dead ends: 200 [2021-05-02 23:48:19,032 INFO L226 Difference]: Without dead ends: 197 [2021-05-02 23:48:19,033 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 2749.9ms TimeCoverageRelationStatistics Valid=237, Invalid=6243, Unknown=0, NotChecked=0, Total=6480 [2021-05-02 23:48:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-05-02 23:48:19,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2021-05-02 23:48:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 190 states have (on average 1.0052631578947369) internal successors, (191), 190 states have internal predecessors, (191), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2021-05-02 23:48:19,045 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 188 [2021-05-02 23:48:19,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:48:19,045 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2021-05-02 23:48:19,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 4.021739130434782) internal successors, (185), 45 states have internal predecessors, (185), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:19,045 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2021-05-02 23:48:19,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-05-02 23:48:19,046 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:48:19,046 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:48:19,046 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-02 23:48:19,046 INFO L428 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:48:19,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:48:19,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1188678983, now seen corresponding path program 29 times [2021-05-02 23:48:19,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:48:19,047 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1913523303] [2021-05-02 23:48:19,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:48:19,056 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:48:19,057 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:48:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:48:20,647 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-05-02 23:48:20,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:48:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:48:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:48:20,665 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:48:20,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1913523303] [2021-05-02 23:48:20,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1913523303] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:48:20,665 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:48:20,665 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-05-02 23:48:20,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639884010] [2021-05-02 23:48:20,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-05-02 23:48:20,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:48:20,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-05-02 23:48:20,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2063, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:48:20,666 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand has 47 states, 47 states have (on average 4.042553191489362) internal successors, (190), 46 states have internal predecessors, (190), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:21,143 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2021-05-02 23:48:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:48:26,537 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2021-05-02 23:48:26,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-02 23:48:26,540 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 4.042553191489362) internal successors, (190), 46 states have internal predecessors, (190), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 193 [2021-05-02 23:48:26,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:48:26,541 INFO L225 Difference]: With dead ends: 205 [2021-05-02 23:48:26,541 INFO L226 Difference]: Without dead ends: 202 [2021-05-02 23:48:26,542 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 2887.4ms TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2021-05-02 23:48:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-05-02 23:48:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2021-05-02 23:48:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 195 states have (on average 1.005128205128205) internal successors, (196), 195 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2021-05-02 23:48:26,554 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 193 [2021-05-02 23:48:26,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:48:26,554 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2021-05-02 23:48:26,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 47 states, 47 states have (on average 4.042553191489362) internal successors, (190), 46 states have internal predecessors, (190), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2021-05-02 23:48:26,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-05-02 23:48:26,555 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:48:26,555 INFO L523 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:48:26,556 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-02 23:48:26,556 INFO L428 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:48:26,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:48:26,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1394498726, now seen corresponding path program 30 times [2021-05-02 23:48:26,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:48:26,556 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2007774938] [2021-05-02 23:48:26,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:48:26,565 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:48:26,567 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:48:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:48:28,211 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-05-02 23:48:28,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:48:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:48:28,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:48:28,220 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:48:28,220 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2007774938] [2021-05-02 23:48:28,220 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2007774938] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:48:28,220 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:48:28,220 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-05-02 23:48:28,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776050187] [2021-05-02 23:48:28,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-05-02 23:48:28,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:48:28,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-05-02 23:48:28,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2155, Unknown=0, NotChecked=0, Total=2256 [2021-05-02 23:48:28,221 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand has 48 states, 48 states have (on average 4.0625) internal successors, (195), 47 states have internal predecessors, (195), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:28,880 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2021-05-02 23:48:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:48:35,352 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2021-05-02 23:48:35,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-02 23:48:35,353 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.0625) internal successors, (195), 47 states have internal predecessors, (195), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 198 [2021-05-02 23:48:35,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:48:35,354 INFO L225 Difference]: With dead ends: 210 [2021-05-02 23:48:35,354 INFO L226 Difference]: Without dead ends: 207 [2021-05-02 23:48:35,354 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 3210.5ms TimeCoverageRelationStatistics Valid=249, Invalid=6891, Unknown=0, NotChecked=0, Total=7140 [2021-05-02 23:48:35,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-05-02 23:48:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2021-05-02 23:48:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 200 states have (on average 1.005) internal successors, (201), 200 states have internal predecessors, (201), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2021-05-02 23:48:35,384 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 198 [2021-05-02 23:48:35,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:48:35,384 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2021-05-02 23:48:35,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 48 states, 48 states have (on average 4.0625) internal successors, (195), 47 states have internal predecessors, (195), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:35,397 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2021-05-02 23:48:35,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-05-02 23:48:35,398 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:48:35,398 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:48:35,398 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-02 23:48:35,398 INFO L428 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:48:35,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:48:35,399 INFO L82 PathProgramCache]: Analyzing trace with hash 126381913, now seen corresponding path program 31 times [2021-05-02 23:48:35,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:48:35,399 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2068288500] [2021-05-02 23:48:35,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:48:35,460 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:48:35,461 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:48:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:48:37,227 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-05-02 23:48:37,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:48:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:48:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:48:37,235 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:48:37,235 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2068288500] [2021-05-02 23:48:37,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2068288500] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:48:37,235 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:48:37,235 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-02 23:48:37,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217367426] [2021-05-02 23:48:37,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-02 23:48:37,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:48:37,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-02 23:48:37,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2249, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:48:37,237 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand has 49 states, 49 states have (on average 4.081632653061225) internal successors, (200), 48 states have internal predecessors, (200), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:37,850 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2021-05-02 23:48:44,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:48:44,275 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2021-05-02 23:48:44,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-02 23:48:44,277 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 4.081632653061225) internal successors, (200), 48 states have internal predecessors, (200), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 203 [2021-05-02 23:48:44,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:48:44,278 INFO L225 Difference]: With dead ends: 215 [2021-05-02 23:48:44,278 INFO L226 Difference]: Without dead ends: 212 [2021-05-02 23:48:44,278 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 3300.0ms TimeCoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2021-05-02 23:48:44,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-05-02 23:48:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2021-05-02 23:48:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 205 states have (on average 1.0048780487804878) internal successors, (206), 205 states have internal predecessors, (206), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2021-05-02 23:48:44,291 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 203 [2021-05-02 23:48:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:48:44,291 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2021-05-02 23:48:44,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 49 states have (on average 4.081632653061225) internal successors, (200), 48 states have internal predecessors, (200), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:44,291 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2021-05-02 23:48:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-05-02 23:48:44,292 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:48:44,292 INFO L523 BasicCegarLoop]: trace histogram [33, 33, 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] [2021-05-02 23:48:44,292 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-02 23:48:44,292 INFO L428 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:48:44,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:48:44,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2139900602, now seen corresponding path program 32 times [2021-05-02 23:48:44,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:48:44,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1804292775] [2021-05-02 23:48:44,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:48:44,301 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:48:44,302 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:48:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:48:46,245 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-05-02 23:48:46,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:48:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:48:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:48:46,253 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:48:46,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1804292775] [2021-05-02 23:48:46,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1804292775] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:48:46,254 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:48:46,254 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-02 23:48:46,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458676248] [2021-05-02 23:48:46,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-02 23:48:46,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:48:46,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-02 23:48:46,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2345, Unknown=0, NotChecked=0, Total=2450 [2021-05-02 23:48:46,255 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand has 50 states, 50 states have (on average 4.1) internal successors, (205), 49 states have internal predecessors, (205), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:46,908 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2021-05-02 23:48:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:48:54,509 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2021-05-02 23:48:54,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-02 23:48:54,510 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.1) internal successors, (205), 49 states have internal predecessors, (205), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 208 [2021-05-02 23:48:54,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:48:54,511 INFO L225 Difference]: With dead ends: 220 [2021-05-02 23:48:54,511 INFO L226 Difference]: Without dead ends: 217 [2021-05-02 23:48:54,512 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 3727.4ms TimeCoverageRelationStatistics Valid=261, Invalid=7571, Unknown=0, NotChecked=0, Total=7832 [2021-05-02 23:48:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-05-02 23:48:54,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2021-05-02 23:48:54,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 210 states have (on average 1.0047619047619047) internal successors, (211), 210 states have internal predecessors, (211), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2021-05-02 23:48:54,525 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 208 [2021-05-02 23:48:54,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:48:54,525 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2021-05-02 23:48:54,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 50 states, 50 states have (on average 4.1) internal successors, (205), 49 states have internal predecessors, (205), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:48:54,526 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2021-05-02 23:48:54,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-05-02 23:48:54,526 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:48:54,526 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:48:54,526 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-02 23:48:54,526 INFO L428 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:48:54,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:48:54,527 INFO L82 PathProgramCache]: Analyzing trace with hash -331389959, now seen corresponding path program 33 times [2021-05-02 23:48:54,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:48:54,527 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1497421688] [2021-05-02 23:48:54,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:48:54,536 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:48:54,537 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:48:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:48:58,086 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-05-02 23:48:58,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:48:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:48:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:48:58,097 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:48:58,097 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1497421688] [2021-05-02 23:48:58,097 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1497421688] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:48:58,097 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:48:58,098 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-05-02 23:48:58,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063546110] [2021-05-02 23:48:58,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-02 23:48:58,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:48:58,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-02 23:48:58,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=2546, Unknown=0, NotChecked=0, Total=2652 [2021-05-02 23:48:58,099 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand has 52 states, 52 states have (on average 4.038461538461538) internal successors, (210), 51 states have internal predecessors, (210), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:49:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:49:04,091 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2021-05-02 23:49:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-02 23:49:04,092 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.038461538461538) internal successors, (210), 51 states have internal predecessors, (210), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 213 [2021-05-02 23:49:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:49:04,092 INFO L225 Difference]: With dead ends: 216 [2021-05-02 23:49:04,092 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 23:49:04,093 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2817.6ms TimeCoverageRelationStatistics Valid=118, Invalid=2744, Unknown=0, NotChecked=0, Total=2862 [2021-05-02 23:49:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 23:49:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 23:49:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-02 23:49:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 23:49:04,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2021-05-02 23:49:04,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:49:04,094 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 23:49:04,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 52 states have (on average 4.038461538461538) internal successors, (210), 51 states have internal predecessors, (210), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:49:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 23:49:04,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 23:49:04,094 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-02 23:49:04,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 23:49:04,749 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 28 [2021-05-02 23:49:05,016 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 30 [2021-05-02 23:49:05,174 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 18 [2021-05-02 23:49:05,286 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 27 [2021-05-02 23:49:05,399 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 27 [2021-05-02 23:49:05,575 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 29 [2021-05-02 23:49:05,757 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 27 [2021-05-02 23:49:05,948 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 27 [2021-05-02 23:49:06,128 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 30 [2021-05-02 23:49:06,243 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-05-02 23:49:06,356 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 27 [2021-05-02 23:49:06,474 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 27 [2021-05-02 23:49:06,649 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 30 [2021-05-02 23:49:07,109 WARN L205 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 30 [2021-05-02 23:49:07,256 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 10 [2021-05-02 23:49:07,664 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 30 [2021-05-02 23:49:07,854 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 27 [2021-05-02 23:49:10,340 WARN L205 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 256 DAG size of output: 192 [2021-05-02 23:49:10,535 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 30 [2021-05-02 23:49:10,870 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 28 [2021-05-02 23:49:13,118 WARN L205 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 257 DAG size of output: 193 [2021-05-02 23:49:13,557 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 33 [2021-05-02 23:49:15,849 WARN L205 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 255 DAG size of output: 191 [2021-05-02 23:49:16,018 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 28 [2021-05-02 23:49:16,189 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 29 [2021-05-02 23:49:16,455 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 28 [2021-05-02 23:49:18,921 WARN L205 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 253 DAG size of output: 189 [2021-05-02 23:49:19,094 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 29 [2021-05-02 23:49:19,287 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 30 [2021-05-02 23:49:19,467 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 30 [2021-05-02 23:49:19,642 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 29 [2021-05-02 23:49:19,818 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 30 [2021-05-02 23:49:19,985 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 30 [2021-05-02 23:49:22,478 WARN L205 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 256 DAG size of output: 192 [2021-05-02 23:49:22,716 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 30 [2021-05-02 23:49:22,930 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 30 [2021-05-02 23:49:23,031 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-05-02 23:49:23,031 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-05-02 23:49:23,031 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-05-02 23:49:23,032 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9)) [2021-05-02 23:49:23,032 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string67.offset| |old(#t~string67.offset)|) (= |#t~string65.base| |old(#t~string65.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= ~__tmp_1075_0~0 |old(~__tmp_1075_0~0)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#t~string57.offset| |old(#t~string57.offset)|) (= |old(#valid)| |#valid|) (= |#t~string57.base| |old(#t~string57.base)|) (= |#t~string61.base| |old(#t~string61.base)|) (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string61.offset| |old(#t~string61.offset)|) (= ~Id_MCDC_93~0 |old(~Id_MCDC_93~0)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#t~string8.base| |old(#t~string8.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string69.base| |old(#t~string69.base)|) (= ~__tmp_1075_2~0.base |old(~__tmp_1075_2~0.base)|) (= |#t~string7.base| |old(#t~string7.base)|) (= |#t~string55.base| |old(#t~string55.base)|) (= |#t~string69.offset| |old(#t~string69.offset)|) (= |#t~string63.offset| |old(#t~string63.offset)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string8.offset| |old(#t~string8.offset)|) (= |#t~string65.offset| |old(#t~string65.offset)|) (= |#t~string67.base| |old(#t~string67.base)|) (= |#t~string7.offset| |old(#t~string7.offset)|) (= |#t~string53.base| |old(#t~string53.base)|) (= |#t~string51.base| |old(#t~string51.base)|) (= |#t~string63.base| |old(#t~string63.base)|) (= ~__tmp_1075_2~0.offset |old(~__tmp_1075_2~0.offset)|) (= |#t~string59.base| |old(#t~string59.base)|) (= |#t~string51.offset| |old(#t~string51.offset)|) (= |#t~string55.offset| |old(#t~string55.offset)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |#t~string53.offset| |old(#t~string53.offset)|) (= |#t~string59.offset| |old(#t~string59.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~__tmp_1075_1~0 |old(~__tmp_1075_1~0)|)) [2021-05-02 23:49:23,032 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9)) [2021-05-02 23:49:23,032 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:49:23,032 INFO L194 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: (and (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9)) [2021-05-02 23:49:23,032 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 23:49:23,032 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:49:23,032 INFO L194 CegarLoopUtils]: At program point L225(lines 225 604) the Hoare annotation is: (or (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 1) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= 1 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 9) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,032 INFO L194 CegarLoopUtils]: At program point L192(lines 192 622) the Hoare annotation is: (or (and (= main_~Id_MCDC_89__Id_MCDC_96~0 0) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,033 INFO L194 CegarLoopUtils]: At program point L448(lines 408 481) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1))) (.cse1 (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0))) (or (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 23) (<= 23 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 (<= ~Id_MCDC_93~0 23) .cse1) (and .cse0 (<= 29 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 29) .cse1 (<= ~Id_MCDC_93~0 29)) (and (<= 39 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 39) (<= ~Id_MCDC_93~0 39) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 37) (<= main_~Id_MCDC_89__Id_MCDC_96~0 37) (<= 37 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 11) (<= main_~Id_MCDC_89__Id_MCDC_96~0 11) (<= 11 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 16) (<= ~Id_MCDC_93~0 16) .cse0 (<= 16 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 20) (<= 20 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 20) .cse0 .cse1) (and (<= 38 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 38) .cse0 (<= main_~Id_MCDC_89__Id_MCDC_96~0 38) .cse1) (and (<= 41 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 41) (<= ~Id_MCDC_93~0 41) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 13) (<= main_~Id_MCDC_89__Id_MCDC_96~0 13) .cse0 (<= 13 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= ~Id_MCDC_93~0 32) .cse0 (<= main_~Id_MCDC_89__Id_MCDC_96~0 32) (<= 32 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 19) (<= 19 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 19) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 40) (<= 40 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 40) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 14) (<= main_~Id_MCDC_89__Id_MCDC_96~0 14) .cse0 .cse1 (<= 14 main_~Id_MCDC_89__Id_MCDC_96~0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 15) (<= ~Id_MCDC_93~0 15) .cse0 (<= 15 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 18) (<= ~Id_MCDC_93~0 18) .cse0 .cse1 (<= 18 main_~Id_MCDC_89__Id_MCDC_96~0)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 22) .cse0 (<= ~Id_MCDC_93~0 22) .cse1 (<= 22 main_~Id_MCDC_89__Id_MCDC_96~0)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 10) .cse0 (<= ~Id_MCDC_93~0 10) (<= 10 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= 31 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 31) (<= main_~Id_MCDC_89__Id_MCDC_96~0 31) .cse0 .cse1) (and (<= 36 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 36) .cse0 .cse1 (<= main_~Id_MCDC_89__Id_MCDC_96~0 36)) (and .cse0 (<= ~Id_MCDC_93~0 34) (<= 34 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1 (<= main_~Id_MCDC_89__Id_MCDC_96~0 34)) (and (<= ~Id_MCDC_93~0 24) (<= main_~Id_MCDC_89__Id_MCDC_96~0 24) .cse0 (<= 24 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= ~Id_MCDC_93~0 12) .cse0 (<= 12 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 12) .cse1) (and (<= ~Id_MCDC_93~0 27) (<= main_~Id_MCDC_89__Id_MCDC_96~0 27) .cse0 (<= 27 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= ~Id_MCDC_93~0 26) (<= 26 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 26) .cse0 .cse1) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 33) .cse0 (<= ~Id_MCDC_93~0 33) (<= 33 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= 30 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1 (<= main_~Id_MCDC_89__Id_MCDC_96~0 30) (<= ~Id_MCDC_93~0 30)) (and (<= 17 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 17) (<= main_~Id_MCDC_89__Id_MCDC_96~0 17) .cse0 .cse1) (and (<= 21 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 21) .cse0 .cse1 (<= ~Id_MCDC_93~0 21)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 28) .cse0 (<= 28 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 28) .cse1) (and (<= 9 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 9) .cse0 (<= ~Id_MCDC_93~0 9) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 35) (<= ~Id_MCDC_93~0 35) .cse0 (<= 35 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 25) (<= 25 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 25) .cse0 .cse1))) [2021-05-02 23:49:23,033 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 136 636) the Hoare annotation is: true [2021-05-02 23:49:23,033 INFO L194 CegarLoopUtils]: At program point L184(lines 184 628) the Hoare annotation is: (or (and (= main_~Id_MCDC_89__Id_MCDC_96~0 0) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,033 INFO L194 CegarLoopUtils]: At program point L440(lines 440 453) the Hoare annotation is: (let ((.cse2 (div ~Id_MCDC_93~0 4294967296))) (let ((.cse0 (< 0 (+ .cse2 1))) (.cse1 (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0))) (or (and (<= ~Id_MCDC_93~0 31) (<= 30 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1 (<= main_~Id_MCDC_89__Id_MCDC_96~0 30)) (and .cse0 (<= 29 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 29) .cse1 (<= ~Id_MCDC_93~0 30)) (and (<= 31 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 32) (<= main_~Id_MCDC_89__Id_MCDC_96~0 31) .cse0 .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 15) (<= ~Id_MCDC_93~0 16) .cse0 (<= 15 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= ~Id_MCDC_93~0 35) .cse0 (<= 34 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1 (<= main_~Id_MCDC_89__Id_MCDC_96~0 34)) (and (<= 38 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 39) .cse0 (<= main_~Id_MCDC_89__Id_MCDC_96~0 38) .cse1) (and .cse0 (<= ~Id_MCDC_93~0 33) (<= main_~Id_MCDC_89__Id_MCDC_96~0 32) (<= 32 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= 17 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 18) (<= main_~Id_MCDC_89__Id_MCDC_96~0 17) .cse0 .cse1) (and (<= 41 main_~Id_MCDC_89__Id_MCDC_96~0) (= ~Id_MCDC_93~0 (+ (* .cse2 4294967296) 41)) (<= main_~Id_MCDC_89__Id_MCDC_96~0 41) (= |main_#t~mem70| 0) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 20) (<= 20 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1 (<= ~Id_MCDC_93~0 21)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 16) (<= ~Id_MCDC_93~0 17) .cse0 (<= 16 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (not (<= |old(~Id_MCDC_93~0)| 9)) (and (<= ~Id_MCDC_93~0 37) (<= 36 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1 (<= main_~Id_MCDC_89__Id_MCDC_96~0 36)) (and (<= 39 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 39) (<= ~Id_MCDC_93~0 40) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 15) (<= main_~Id_MCDC_89__Id_MCDC_96~0 14) .cse0 .cse1 (<= 14 main_~Id_MCDC_89__Id_MCDC_96~0)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 25) (<= ~Id_MCDC_93~0 26) (<= 25 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 35) (<= ~Id_MCDC_93~0 36) .cse0 (<= 35 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= ~Id_MCDC_93~0 13) .cse0 (<= 12 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 12) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 19) (<= 19 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 20) .cse0 .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 24) (<= ~Id_MCDC_93~0 25) .cse0 (<= 24 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 11) (<= ~Id_MCDC_93~0 12) (<= 11 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 27) (<= 26 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 26) .cse0 .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 22) .cse0 (<= ~Id_MCDC_93~0 23) .cse1 (<= 22 main_~Id_MCDC_89__Id_MCDC_96~0)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 28) .cse0 (<= 28 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1 (<= ~Id_MCDC_93~0 29)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 23) (<= ~Id_MCDC_93~0 24) (<= 23 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 14) (<= main_~Id_MCDC_89__Id_MCDC_96~0 13) .cse0 (<= 13 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 37) (<= ~Id_MCDC_93~0 38) (<= 37 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 18) (<= ~Id_MCDC_93~0 19) .cse0 .cse1 (<= 18 main_~Id_MCDC_89__Id_MCDC_96~0)) (and (<= 21 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 21) .cse0 (<= ~Id_MCDC_93~0 22) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 33) .cse0 (<= ~Id_MCDC_93~0 34) (<= 33 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= 40 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 41) (<= main_~Id_MCDC_89__Id_MCDC_96~0 40) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 11) (<= main_~Id_MCDC_89__Id_MCDC_96~0 10) .cse0 (<= 10 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 27) .cse0 (<= 27 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 28) .cse1) (and (<= 9 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 9) .cse0 (<= ~Id_MCDC_93~0 10) .cse1)))) [2021-05-02 23:49:23,033 INFO L194 CegarLoopUtils]: At program point L407(lines 407 485) the Hoare annotation is: (or (and (<= ~Id_MCDC_93~0 8) (= ~Id_MCDC_93~0 main_~Id_MCDC_89__Id_MCDC_96~0) (<= 8 ~Id_MCDC_93~0) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,033 INFO L194 CegarLoopUtils]: At program point L374(lines 374 503) the Hoare annotation is: (or (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 7) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9) (<= 7 main_~Id_MCDC_89__Id_MCDC_96~0) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,033 INFO L194 CegarLoopUtils]: At program point L465(lines 465 473) the Hoare annotation is: (or (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,033 INFO L194 CegarLoopUtils]: At program point L366(lines 366 509) the Hoare annotation is: (or (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 7) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9) (<= 7 main_~Id_MCDC_89__Id_MCDC_96~0) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,034 INFO L194 CegarLoopUtils]: At program point L234(lines 234 599) the Hoare annotation is: (or (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (<= 2 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 2) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0))) [2021-05-02 23:49:23,034 INFO L194 CegarLoopUtils]: At program point L251(lines 251 587) the Hoare annotation is: (or (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (<= 2 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 2) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0))) [2021-05-02 23:49:23,034 INFO L194 CegarLoopUtils]: At program point L218(lines 218 605) the Hoare annotation is: (or (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 1) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= 1 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 9) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,034 INFO L194 CegarLoopUtils]: At program point L210(lines 210 611) the Hoare annotation is: (or (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 1) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= 1 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 9) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,034 INFO L194 CegarLoopUtils]: At program point L433(lines 433 454) the Hoare annotation is: (let ((.cse2 (div ~Id_MCDC_93~0 4294967296))) (let ((.cse0 (< 0 (+ .cse2 1))) (.cse1 (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0))) (or (and (<= ~Id_MCDC_93~0 31) (<= 30 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1 (<= main_~Id_MCDC_89__Id_MCDC_96~0 30)) (and .cse0 (<= 29 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 29) .cse1 (<= ~Id_MCDC_93~0 30)) (and (<= 31 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 32) (<= main_~Id_MCDC_89__Id_MCDC_96~0 31) .cse0 .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 15) (<= ~Id_MCDC_93~0 16) .cse0 (<= 15 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= ~Id_MCDC_93~0 35) .cse0 (<= 34 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1 (<= main_~Id_MCDC_89__Id_MCDC_96~0 34)) (and (<= 38 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 39) .cse0 (<= main_~Id_MCDC_89__Id_MCDC_96~0 38) .cse1) (and .cse0 (<= ~Id_MCDC_93~0 33) (<= main_~Id_MCDC_89__Id_MCDC_96~0 32) (<= 32 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= 17 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 18) (<= main_~Id_MCDC_89__Id_MCDC_96~0 17) .cse0 .cse1) (and (<= 41 main_~Id_MCDC_89__Id_MCDC_96~0) (= ~Id_MCDC_93~0 (+ (* .cse2 4294967296) 41)) (<= main_~Id_MCDC_89__Id_MCDC_96~0 41) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 20) (<= 20 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1 (<= ~Id_MCDC_93~0 21)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 16) (<= ~Id_MCDC_93~0 17) .cse0 (<= 16 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (not (<= |old(~Id_MCDC_93~0)| 9)) (and (<= ~Id_MCDC_93~0 37) (<= 36 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1 (<= main_~Id_MCDC_89__Id_MCDC_96~0 36)) (and (<= 39 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 39) (<= ~Id_MCDC_93~0 40) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 15) (<= main_~Id_MCDC_89__Id_MCDC_96~0 14) .cse0 .cse1 (<= 14 main_~Id_MCDC_89__Id_MCDC_96~0)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 25) (<= ~Id_MCDC_93~0 26) (<= 25 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 35) (<= ~Id_MCDC_93~0 36) .cse0 (<= 35 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= ~Id_MCDC_93~0 13) .cse0 (<= 12 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 12) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 19) (<= 19 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 20) .cse0 .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 24) (<= ~Id_MCDC_93~0 25) .cse0 (<= 24 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 11) (<= ~Id_MCDC_93~0 12) (<= 11 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 27) (<= 26 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 26) .cse0 .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 22) .cse0 (<= ~Id_MCDC_93~0 23) .cse1 (<= 22 main_~Id_MCDC_89__Id_MCDC_96~0)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 28) .cse0 (<= 28 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1 (<= ~Id_MCDC_93~0 29)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 23) (<= ~Id_MCDC_93~0 24) (<= 23 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 14) (<= main_~Id_MCDC_89__Id_MCDC_96~0 13) .cse0 (<= 13 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 37) (<= ~Id_MCDC_93~0 38) (<= 37 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 18) (<= ~Id_MCDC_93~0 19) .cse0 .cse1 (<= 18 main_~Id_MCDC_89__Id_MCDC_96~0)) (and (<= 21 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 21) .cse0 (<= ~Id_MCDC_93~0 22) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 33) .cse0 (<= ~Id_MCDC_93~0 34) (<= 33 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= 40 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 41) (<= main_~Id_MCDC_89__Id_MCDC_96~0 40) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 11) (<= main_~Id_MCDC_89__Id_MCDC_96~0 10) .cse0 (<= 10 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 27) .cse0 (<= 27 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 28) .cse1) (and (<= 9 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 9) .cse0 (<= ~Id_MCDC_93~0 10) .cse1)))) [2021-05-02 23:49:23,034 INFO L194 CegarLoopUtils]: At program point L400(lines 400 486) the Hoare annotation is: (or (and (<= ~Id_MCDC_93~0 8) (= ~Id_MCDC_93~0 main_~Id_MCDC_89__Id_MCDC_96~0) (<= 8 ~Id_MCDC_93~0) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,034 INFO L194 CegarLoopUtils]: At program point L425(lines 425 475) the Hoare annotation is: (let ((.cse2 (div ~Id_MCDC_93~0 4294967296))) (let ((.cse0 (< 0 (+ .cse2 1))) (.cse1 (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0))) (or (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 23) (<= 23 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 (<= ~Id_MCDC_93~0 23) .cse1) (and .cse0 (<= 29 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 29) .cse1 (<= ~Id_MCDC_93~0 29)) (and (<= 39 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 39) (<= ~Id_MCDC_93~0 39) .cse0 .cse1) (and (<= 41 main_~Id_MCDC_89__Id_MCDC_96~0) (= ~Id_MCDC_93~0 (+ (* .cse2 4294967296) 41)) (<= main_~Id_MCDC_89__Id_MCDC_96~0 41) (<= ~Id_MCDC_93~0 41) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 37) (<= main_~Id_MCDC_89__Id_MCDC_96~0 37) (<= 37 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 11) (<= main_~Id_MCDC_89__Id_MCDC_96~0 11) (<= 11 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 16) (<= ~Id_MCDC_93~0 16) .cse0 (<= 16 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 20) (<= 20 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 20) .cse0 .cse1) (and (<= 38 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 38) .cse0 (<= main_~Id_MCDC_89__Id_MCDC_96~0 38) .cse1) (and (<= ~Id_MCDC_93~0 13) (<= main_~Id_MCDC_89__Id_MCDC_96~0 13) .cse0 (<= 13 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= ~Id_MCDC_93~0 32) .cse0 (<= main_~Id_MCDC_89__Id_MCDC_96~0 32) (<= 32 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 19) (<= 19 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 19) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 40) (<= 40 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 40) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 14) (<= main_~Id_MCDC_89__Id_MCDC_96~0 14) .cse0 .cse1 (<= 14 main_~Id_MCDC_89__Id_MCDC_96~0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 15) (<= ~Id_MCDC_93~0 15) .cse0 (<= 15 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 18) (<= ~Id_MCDC_93~0 18) .cse0 .cse1 (<= 18 main_~Id_MCDC_89__Id_MCDC_96~0)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 22) .cse0 (<= ~Id_MCDC_93~0 22) .cse1 (<= 22 main_~Id_MCDC_89__Id_MCDC_96~0)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 10) .cse0 (<= ~Id_MCDC_93~0 10) (<= 10 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= 31 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 31) (<= main_~Id_MCDC_89__Id_MCDC_96~0 31) .cse0 .cse1) (and (<= 36 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 36) .cse0 .cse1 (<= main_~Id_MCDC_89__Id_MCDC_96~0 36)) (and .cse0 (<= ~Id_MCDC_93~0 34) (<= 34 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1 (<= main_~Id_MCDC_89__Id_MCDC_96~0 34)) (and (<= ~Id_MCDC_93~0 24) (<= main_~Id_MCDC_89__Id_MCDC_96~0 24) .cse0 (<= 24 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= ~Id_MCDC_93~0 12) .cse0 (<= 12 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 12) .cse1) (and (<= ~Id_MCDC_93~0 27) (<= main_~Id_MCDC_89__Id_MCDC_96~0 27) .cse0 (<= 27 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= ~Id_MCDC_93~0 26) (<= 26 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 26) .cse0 .cse1) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 33) .cse0 (<= ~Id_MCDC_93~0 33) (<= 33 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= 30 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1 (<= main_~Id_MCDC_89__Id_MCDC_96~0 30) (<= ~Id_MCDC_93~0 30)) (and (<= 17 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 17) (<= main_~Id_MCDC_89__Id_MCDC_96~0 17) .cse0 .cse1) (and (<= 21 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 21) .cse0 .cse1 (<= ~Id_MCDC_93~0 21)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 28) .cse0 (<= 28 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 28) .cse1) (and (<= 9 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 9) .cse0 (<= ~Id_MCDC_93~0 9) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 35) (<= ~Id_MCDC_93~0 35) .cse0 (<= 35 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 25) (<= 25 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 25) .cse0 .cse1)))) [2021-05-02 23:49:23,035 INFO L194 CegarLoopUtils]: At program point L392(lines 392 492) the Hoare annotation is: (or (and (<= ~Id_MCDC_93~0 8) (= ~Id_MCDC_93~0 main_~Id_MCDC_89__Id_MCDC_96~0) (<= 8 ~Id_MCDC_93~0) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,035 INFO L194 CegarLoopUtils]: At program point L260(lines 260 582) the Hoare annotation is: (or (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 3) (<= 3 main_~Id_MCDC_89__Id_MCDC_96~0) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,035 INFO L194 CegarLoopUtils]: At program point L277(lines 277 570) the Hoare annotation is: (or (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 3) (<= 3 main_~Id_MCDC_89__Id_MCDC_96~0) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,035 INFO L194 CegarLoopUtils]: At program point L244(lines 244 588) the Hoare annotation is: (or (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (<= 2 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 2) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0))) [2021-05-02 23:49:23,035 INFO L194 CegarLoopUtils]: At program point L467(line 467) the Hoare annotation is: (or (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,035 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 136 636) the Hoare annotation is: true [2021-05-02 23:49:23,035 INFO L194 CegarLoopUtils]: At program point L236(lines 236 594) the Hoare annotation is: (or (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (<= 2 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 2) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0))) [2021-05-02 23:49:23,035 INFO L194 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 467) the Hoare annotation is: (or (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,035 INFO L194 CegarLoopUtils]: At program point L286(lines 286 565) the Hoare annotation is: (or (and (<= ~Id_MCDC_93~0 4) (= ~Id_MCDC_93~0 main_~Id_MCDC_89__Id_MCDC_96~0) (<= 4 ~Id_MCDC_93~0) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,035 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 136 636) the Hoare annotation is: (or (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (= ~__tmp_1075_2~0.offset |old(~__tmp_1075_2~0.offset)|) (= ~Id_MCDC_93~0 |old(~Id_MCDC_93~0)|) (= |old(#length)| |#length|) (= ~__tmp_1075_0~0 |old(~__tmp_1075_0~0)|) (= |old(~__tmp_1075_2~0.base)| ~__tmp_1075_2~0.base) (= |old(#valid)| |#valid|) (= ~__tmp_1075_1~0 |old(~__tmp_1075_1~0)|))) [2021-05-02 23:49:23,035 INFO L194 CegarLoopUtils]: At program point L303(lines 303 553) the Hoare annotation is: (or (and (<= ~Id_MCDC_93~0 4) (= ~Id_MCDC_93~0 main_~Id_MCDC_89__Id_MCDC_96~0) (<= 4 ~Id_MCDC_93~0) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,035 INFO L194 CegarLoopUtils]: At program point L270(lines 270 571) the Hoare annotation is: (or (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 3) (<= 3 main_~Id_MCDC_89__Id_MCDC_96~0) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,035 INFO L194 CegarLoopUtils]: At program point L262(lines 262 577) the Hoare annotation is: (or (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 3) (<= 3 main_~Id_MCDC_89__Id_MCDC_96~0) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,036 INFO L194 CegarLoopUtils]: At program point L312(lines 312 548) the Hoare annotation is: (or (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (= ~Id_MCDC_93~0 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 5) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0) (<= 5 ~Id_MCDC_93~0))) [2021-05-02 23:49:23,036 INFO L194 CegarLoopUtils]: At program point L329(lines 329 536) the Hoare annotation is: (or (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (= ~Id_MCDC_93~0 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 5) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0) (<= 5 ~Id_MCDC_93~0))) [2021-05-02 23:49:23,036 INFO L194 CegarLoopUtils]: At program point L296(lines 296 554) the Hoare annotation is: (or (and (<= ~Id_MCDC_93~0 4) (= ~Id_MCDC_93~0 main_~Id_MCDC_89__Id_MCDC_96~0) (<= 4 ~Id_MCDC_93~0) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,036 INFO L194 CegarLoopUtils]: At program point L164(lines 164 635) the Hoare annotation is: (or (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9))) [2021-05-02 23:49:23,036 INFO L194 CegarLoopUtils]: At program point L288(lines 288 560) the Hoare annotation is: (or (and (<= ~Id_MCDC_93~0 4) (= ~Id_MCDC_93~0 main_~Id_MCDC_89__Id_MCDC_96~0) (<= 4 ~Id_MCDC_93~0) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,036 INFO L194 CegarLoopUtils]: At program point L338(lines 338 531) the Hoare annotation is: (or (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (<= ~Id_MCDC_93~0 6) (= ~Id_MCDC_93~0 main_~Id_MCDC_89__Id_MCDC_96~0) (<= 6 ~Id_MCDC_93~0) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0))) [2021-05-02 23:49:23,036 INFO L194 CegarLoopUtils]: At program point L355(lines 355 519) the Hoare annotation is: (or (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (<= ~Id_MCDC_93~0 6) (= ~Id_MCDC_93~0 main_~Id_MCDC_89__Id_MCDC_96~0) (<= 6 ~Id_MCDC_93~0) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0))) [2021-05-02 23:49:23,036 INFO L194 CegarLoopUtils]: At program point L322(lines 322 537) the Hoare annotation is: (or (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (= ~Id_MCDC_93~0 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 5) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0) (<= 5 ~Id_MCDC_93~0))) [2021-05-02 23:49:23,036 INFO L194 CegarLoopUtils]: At program point L314(lines 314 543) the Hoare annotation is: (or (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (= ~Id_MCDC_93~0 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 5) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0) (<= 5 ~Id_MCDC_93~0))) [2021-05-02 23:49:23,036 INFO L194 CegarLoopUtils]: At program point L182(lines 182 633) the Hoare annotation is: (or (and (= main_~Id_MCDC_89__Id_MCDC_96~0 0) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,036 INFO L194 CegarLoopUtils]: At program point L364(lines 364 514) the Hoare annotation is: (or (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 7) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9) (<= 7 main_~Id_MCDC_89__Id_MCDC_96~0) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,036 INFO L194 CegarLoopUtils]: At program point L199(lines 199 621) the Hoare annotation is: (or (and (= main_~Id_MCDC_89__Id_MCDC_96~0 0) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,036 INFO L194 CegarLoopUtils]: At program point L381(lines 381 502) the Hoare annotation is: (or (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 7) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= ~Id_MCDC_93~0 9) (<= 7 main_~Id_MCDC_89__Id_MCDC_96~0) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,036 INFO L194 CegarLoopUtils]: At program point L348(lines 348 520) the Hoare annotation is: (or (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (<= ~Id_MCDC_93~0 6) (= ~Id_MCDC_93~0 main_~Id_MCDC_89__Id_MCDC_96~0) (<= 6 ~Id_MCDC_93~0) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0))) [2021-05-02 23:49:23,037 INFO L194 CegarLoopUtils]: At program point L340(lines 340 526) the Hoare annotation is: (or (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (<= ~Id_MCDC_93~0 6) (= ~Id_MCDC_93~0 main_~Id_MCDC_89__Id_MCDC_96~0) (<= 6 ~Id_MCDC_93~0) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0))) [2021-05-02 23:49:23,037 INFO L194 CegarLoopUtils]: At program point L208(lines 208 616) the Hoare annotation is: (or (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 1) (< 0 (+ (div ~Id_MCDC_93~0 4294967296) 1)) (<= 1 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 9) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,037 INFO L194 CegarLoopUtils]: At program point L423(lines 423 480) the Hoare annotation is: (let ((.cse2 (div ~Id_MCDC_93~0 4294967296))) (let ((.cse0 (< 0 (+ .cse2 1))) (.cse1 (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0))) (or (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 23) (<= 23 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 (<= ~Id_MCDC_93~0 23) .cse1) (and .cse0 (<= 29 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 29) .cse1 (<= ~Id_MCDC_93~0 29)) (and (<= 39 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 39) (<= ~Id_MCDC_93~0 39) .cse0 .cse1) (and (<= 41 main_~Id_MCDC_89__Id_MCDC_96~0) (= ~Id_MCDC_93~0 (+ (* .cse2 4294967296) 41)) (<= main_~Id_MCDC_89__Id_MCDC_96~0 41) (<= ~Id_MCDC_93~0 41) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 37) (<= main_~Id_MCDC_89__Id_MCDC_96~0 37) (<= 37 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 11) (<= main_~Id_MCDC_89__Id_MCDC_96~0 11) (<= 11 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 16) (<= ~Id_MCDC_93~0 16) .cse0 (<= 16 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 20) (<= 20 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 20) .cse0 .cse1) (and (<= 38 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 38) .cse0 (<= main_~Id_MCDC_89__Id_MCDC_96~0 38) .cse1) (and (<= ~Id_MCDC_93~0 13) (<= main_~Id_MCDC_89__Id_MCDC_96~0 13) .cse0 (<= 13 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= ~Id_MCDC_93~0 32) .cse0 (<= main_~Id_MCDC_89__Id_MCDC_96~0 32) (<= 32 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 19) (<= 19 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 19) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 40) (<= 40 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 40) .cse0 .cse1) (and (<= ~Id_MCDC_93~0 14) (<= main_~Id_MCDC_89__Id_MCDC_96~0 14) .cse0 .cse1 (<= 14 main_~Id_MCDC_89__Id_MCDC_96~0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 15) (<= ~Id_MCDC_93~0 15) .cse0 (<= 15 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 18) (<= ~Id_MCDC_93~0 18) .cse0 .cse1 (<= 18 main_~Id_MCDC_89__Id_MCDC_96~0)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 22) .cse0 (<= ~Id_MCDC_93~0 22) .cse1 (<= 22 main_~Id_MCDC_89__Id_MCDC_96~0)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 10) .cse0 (<= ~Id_MCDC_93~0 10) (<= 10 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= 31 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 31) (<= main_~Id_MCDC_89__Id_MCDC_96~0 31) .cse0 .cse1) (and (<= 36 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 36) .cse0 .cse1 (<= main_~Id_MCDC_89__Id_MCDC_96~0 36)) (and .cse0 (<= ~Id_MCDC_93~0 34) (<= 34 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1 (<= main_~Id_MCDC_89__Id_MCDC_96~0 34)) (and (<= ~Id_MCDC_93~0 24) (<= main_~Id_MCDC_89__Id_MCDC_96~0 24) .cse0 (<= 24 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= ~Id_MCDC_93~0 12) .cse0 (<= 12 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 12) .cse1) (and (<= ~Id_MCDC_93~0 27) (<= main_~Id_MCDC_89__Id_MCDC_96~0 27) .cse0 (<= 27 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= ~Id_MCDC_93~0 26) (<= 26 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 26) .cse0 .cse1) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1))) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 33) .cse0 (<= ~Id_MCDC_93~0 33) (<= 33 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= 30 main_~Id_MCDC_89__Id_MCDC_96~0) .cse0 .cse1 (<= main_~Id_MCDC_89__Id_MCDC_96~0 30) (<= ~Id_MCDC_93~0 30)) (and (<= 17 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 17) (<= main_~Id_MCDC_89__Id_MCDC_96~0 17) .cse0 .cse1) (and (<= 21 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 21) .cse0 .cse1 (<= ~Id_MCDC_93~0 21)) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 28) .cse0 (<= 28 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 28) .cse1) (and (<= 9 main_~Id_MCDC_89__Id_MCDC_96~0) (<= main_~Id_MCDC_89__Id_MCDC_96~0 9) .cse0 (<= ~Id_MCDC_93~0 9) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 35) (<= ~Id_MCDC_93~0 35) .cse0 (<= 35 main_~Id_MCDC_89__Id_MCDC_96~0) .cse1) (and (<= main_~Id_MCDC_89__Id_MCDC_96~0 25) (<= 25 main_~Id_MCDC_89__Id_MCDC_96~0) (<= ~Id_MCDC_93~0 25) .cse0 .cse1)))) [2021-05-02 23:49:23,037 INFO L194 CegarLoopUtils]: At program point L390(lines 390 497) the Hoare annotation is: (or (and (<= ~Id_MCDC_93~0 8) (= ~Id_MCDC_93~0 main_~Id_MCDC_89__Id_MCDC_96~0) (<= 8 ~Id_MCDC_93~0) (= (select (select |#memory_int| |main_~#Id_MCDC_89__Id_MCDC_95~0.base|) (+ |main_~#Id_MCDC_89__Id_MCDC_95~0.offset| 492)) 0)) (not (<= |old(~Id_MCDC_93~0)| 9)) (not (< 0 (+ (div |old(~Id_MCDC_93~0)| 4294967296) 1)))) [2021-05-02 23:49:23,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 11:49:23 BoogieIcfgContainer [2021-05-02 23:49:23,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 23:49:23,076 INFO L168 Benchmark]: Toolchain (without parser) took 162701.97 ms. Allocated memory was 191.9 MB in the beginning and 431.0 MB in the end (delta: 239.1 MB). Free memory was 157.0 MB in the beginning and 234.1 MB in the end (delta: -77.1 MB). Peak memory consumption was 249.5 MB. Max. memory is 8.0 GB. [2021-05-02 23:49:23,076 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 191.9 MB. Free memory was 174.8 MB in the beginning and 174.7 MB in the end (delta: 106.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 23:49:23,076 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.29 ms. Allocated memory is still 191.9 MB. Free memory was 156.7 MB in the beginning and 171.0 MB in the end (delta: -14.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 8.0 GB. [2021-05-02 23:49:23,076 INFO L168 Benchmark]: Boogie Preprocessor took 107.81 ms. Allocated memory is still 191.9 MB. Free memory was 171.0 MB in the beginning and 166.3 MB in the end (delta: 4.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2021-05-02 23:49:23,076 INFO L168 Benchmark]: RCFGBuilder took 848.26 ms. Allocated memory is still 191.9 MB. Free memory was 166.3 MB in the beginning and 140.7 MB in the end (delta: 25.6 MB). Peak memory consumption was 71.7 MB. Max. memory is 8.0 GB. [2021-05-02 23:49:23,076 INFO L168 Benchmark]: TraceAbstraction took 161300.08 ms. Allocated memory was 191.9 MB in the beginning and 431.0 MB in the end (delta: 239.1 MB). Free memory was 140.2 MB in the beginning and 234.1 MB in the end (delta: -93.9 MB). Peak memory consumption was 232.2 MB. Max. memory is 8.0 GB. [2021-05-02 23:49:23,077 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 191.9 MB. Free memory was 174.8 MB in the beginning and 174.7 MB in the end (delta: 106.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 439.29 ms. Allocated memory is still 191.9 MB. Free memory was 156.7 MB in the beginning and 171.0 MB in the end (delta: -14.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 107.81 ms. Allocated memory is still 191.9 MB. Free memory was 171.0 MB in the beginning and 166.3 MB in the end (delta: 4.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 848.26 ms. Allocated memory is still 191.9 MB. Free memory was 166.3 MB in the beginning and 140.7 MB in the end (delta: 25.6 MB). Peak memory consumption was 71.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 161300.08 ms. Allocated memory was 191.9 MB in the beginning and 431.0 MB in the end (delta: 239.1 MB). Free memory was 140.2 MB in the beginning and 234.1 MB in the end (delta: -93.9 MB). Peak memory consumption was 232.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 467]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 142270.8ms, OverallIterations: 34, TraceHistogramMax: 34, EmptinessCheckTime: 48.2ms, AutomataDifference: 106765.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 18936.1ms, InitialAbstractionConstructionTime: 12.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1251 SDtfs, 2594 SDslu, 38519 SDs, 0 SdLazy, 119511 SolverSat, 1698 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55451.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1969 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1867 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12914 ImplicationChecksByTransitivity, 54017.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=33, InterpolantAutomatonStates: 1070, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 355.6ms AutomataMinimizationTime, 34 MinimizatonAttempts, 99 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 55 LocationsWithAnnotation, 55 PreInvPairs, 248 NumberOfFragments, 5911 HoareAnnotationTreeSize, 55 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 477.7ms HoareSimplificationTime, 55 FomulaSimplificationsInter, 16125 FormulaSimplificationTreeSizeReductionInter, 18417.7ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((Id_MCDC_89__Id_MCDC_96 <= 23 && 23 <= Id_MCDC_89__Id_MCDC_96) && 0 < Id_MCDC_93 / 4294967296 + 1) && Id_MCDC_93 <= 23) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0) || ((((0 < Id_MCDC_93 / 4294967296 + 1 && 29 <= Id_MCDC_89__Id_MCDC_96) && Id_MCDC_89__Id_MCDC_96 <= 29) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0) && Id_MCDC_93 <= 29)) || ((((39 <= Id_MCDC_89__Id_MCDC_96 && Id_MCDC_89__Id_MCDC_96 <= 39) && Id_MCDC_93 <= 39) && 0 < Id_MCDC_93 / 4294967296 + 1) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((Id_MCDC_93 <= 37 && Id_MCDC_89__Id_MCDC_96 <= 37) && 37 <= Id_MCDC_89__Id_MCDC_96) && 0 < Id_MCDC_93 / 4294967296 + 1) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((Id_MCDC_93 <= 11 && Id_MCDC_89__Id_MCDC_96 <= 11) && 11 <= Id_MCDC_89__Id_MCDC_96) && 0 < Id_MCDC_93 / 4294967296 + 1) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((Id_MCDC_89__Id_MCDC_96 <= 16 && Id_MCDC_93 <= 16) && 0 < Id_MCDC_93 / 4294967296 + 1) && 16 <= Id_MCDC_89__Id_MCDC_96) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((Id_MCDC_89__Id_MCDC_96 <= 20 && 20 <= Id_MCDC_89__Id_MCDC_96) && Id_MCDC_93 <= 20) && 0 < Id_MCDC_93 / 4294967296 + 1) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((38 <= Id_MCDC_89__Id_MCDC_96 && Id_MCDC_93 <= 38) && 0 < Id_MCDC_93 / 4294967296 + 1) && Id_MCDC_89__Id_MCDC_96 <= 38) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((41 <= Id_MCDC_89__Id_MCDC_96 && Id_MCDC_89__Id_MCDC_96 <= 41) && Id_MCDC_93 <= 41) && 0 < Id_MCDC_93 / 4294967296 + 1) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((Id_MCDC_93 <= 13 && Id_MCDC_89__Id_MCDC_96 <= 13) && 0 < Id_MCDC_93 / 4294967296 + 1) && 13 <= Id_MCDC_89__Id_MCDC_96) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((Id_MCDC_93 <= 32 && 0 < Id_MCDC_93 / 4294967296 + 1) && Id_MCDC_89__Id_MCDC_96 <= 32) && 32 <= Id_MCDC_89__Id_MCDC_96) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((Id_MCDC_89__Id_MCDC_96 <= 19 && 19 <= Id_MCDC_89__Id_MCDC_96) && Id_MCDC_93 <= 19) && 0 < Id_MCDC_93 / 4294967296 + 1) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((Id_MCDC_93 <= 40 && 40 <= Id_MCDC_89__Id_MCDC_96) && Id_MCDC_89__Id_MCDC_96 <= 40) && 0 < Id_MCDC_93 / 4294967296 + 1) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((Id_MCDC_93 <= 14 && Id_MCDC_89__Id_MCDC_96 <= 14) && 0 < Id_MCDC_93 / 4294967296 + 1) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0) && 14 <= Id_MCDC_89__Id_MCDC_96)) || !(\old(Id_MCDC_93) <= 9)) || ((((Id_MCDC_89__Id_MCDC_96 <= 15 && Id_MCDC_93 <= 15) && 0 < Id_MCDC_93 / 4294967296 + 1) && 15 <= Id_MCDC_89__Id_MCDC_96) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((Id_MCDC_89__Id_MCDC_96 <= 18 && Id_MCDC_93 <= 18) && 0 < Id_MCDC_93 / 4294967296 + 1) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0) && 18 <= Id_MCDC_89__Id_MCDC_96)) || ((((Id_MCDC_89__Id_MCDC_96 <= 22 && 0 < Id_MCDC_93 / 4294967296 + 1) && Id_MCDC_93 <= 22) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0) && 22 <= Id_MCDC_89__Id_MCDC_96)) || ((((Id_MCDC_89__Id_MCDC_96 <= 10 && 0 < Id_MCDC_93 / 4294967296 + 1) && Id_MCDC_93 <= 10) && 10 <= Id_MCDC_89__Id_MCDC_96) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((31 <= Id_MCDC_89__Id_MCDC_96 && Id_MCDC_93 <= 31) && Id_MCDC_89__Id_MCDC_96 <= 31) && 0 < Id_MCDC_93 / 4294967296 + 1) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((36 <= Id_MCDC_89__Id_MCDC_96 && Id_MCDC_93 <= 36) && 0 < Id_MCDC_93 / 4294967296 + 1) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0) && Id_MCDC_89__Id_MCDC_96 <= 36)) || ((((0 < Id_MCDC_93 / 4294967296 + 1 && Id_MCDC_93 <= 34) && 34 <= Id_MCDC_89__Id_MCDC_96) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0) && Id_MCDC_89__Id_MCDC_96 <= 34)) || ((((Id_MCDC_93 <= 24 && Id_MCDC_89__Id_MCDC_96 <= 24) && 0 < Id_MCDC_93 / 4294967296 + 1) && 24 <= Id_MCDC_89__Id_MCDC_96) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((Id_MCDC_93 <= 12 && 0 < Id_MCDC_93 / 4294967296 + 1) && 12 <= Id_MCDC_89__Id_MCDC_96) && Id_MCDC_89__Id_MCDC_96 <= 12) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((Id_MCDC_93 <= 27 && Id_MCDC_89__Id_MCDC_96 <= 27) && 0 < Id_MCDC_93 / 4294967296 + 1) && 27 <= Id_MCDC_89__Id_MCDC_96) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((Id_MCDC_93 <= 26 && 26 <= Id_MCDC_89__Id_MCDC_96) && Id_MCDC_89__Id_MCDC_96 <= 26) && 0 < Id_MCDC_93 / 4294967296 + 1) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || !(0 < \old(Id_MCDC_93) / 4294967296 + 1)) || ((((Id_MCDC_89__Id_MCDC_96 <= 33 && 0 < Id_MCDC_93 / 4294967296 + 1) && Id_MCDC_93 <= 33) && 33 <= Id_MCDC_89__Id_MCDC_96) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((30 <= Id_MCDC_89__Id_MCDC_96 && 0 < Id_MCDC_93 / 4294967296 + 1) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0) && Id_MCDC_89__Id_MCDC_96 <= 30) && Id_MCDC_93 <= 30)) || ((((17 <= Id_MCDC_89__Id_MCDC_96 && Id_MCDC_93 <= 17) && Id_MCDC_89__Id_MCDC_96 <= 17) && 0 < Id_MCDC_93 / 4294967296 + 1) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((21 <= Id_MCDC_89__Id_MCDC_96 && Id_MCDC_89__Id_MCDC_96 <= 21) && 0 < Id_MCDC_93 / 4294967296 + 1) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0) && Id_MCDC_93 <= 21)) || ((((Id_MCDC_89__Id_MCDC_96 <= 28 && 0 < Id_MCDC_93 / 4294967296 + 1) && 28 <= Id_MCDC_89__Id_MCDC_96) && Id_MCDC_93 <= 28) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((9 <= Id_MCDC_89__Id_MCDC_96 && Id_MCDC_89__Id_MCDC_96 <= 9) && 0 < Id_MCDC_93 / 4294967296 + 1) && Id_MCDC_93 <= 9) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((Id_MCDC_89__Id_MCDC_96 <= 35 && Id_MCDC_93 <= 35) && 0 < Id_MCDC_93 / 4294967296 + 1) && 35 <= Id_MCDC_89__Id_MCDC_96) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0)) || ((((Id_MCDC_89__Id_MCDC_96 <= 25 && 25 <= Id_MCDC_89__Id_MCDC_96) && Id_MCDC_93 <= 25) && 0 < Id_MCDC_93 / 4294967296 + 1) && unknown-#memory_int-unknown[Id_MCDC_89__Id_MCDC_95][Id_MCDC_89__Id_MCDC_95 + 492] == 0) - ProcedureContractResult [Line: 136]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! Received shutdown request...