/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationWernerOverapprox_32.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-b7b32d2 [2021-02-22 01:51:34,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-22 01:51:34,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-22 01:51:34,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-22 01:51:34,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-22 01:51:34,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-22 01:51:34,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-22 01:51:34,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-22 01:51:34,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-22 01:51:34,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-22 01:51:34,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-22 01:51:34,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-22 01:51:34,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-22 01:51:34,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-22 01:51:34,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-22 01:51:34,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-22 01:51:34,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-22 01:51:34,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-22 01:51:34,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-22 01:51:34,886 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-22 01:51:34,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-22 01:51:34,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-22 01:51:34,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-22 01:51:34,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-22 01:51:34,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-22 01:51:34,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-22 01:51:34,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-22 01:51:34,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-22 01:51:34,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-22 01:51:34,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-22 01:51:34,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-22 01:51:34,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-22 01:51:34,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-22 01:51:34,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-22 01:51:34,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-22 01:51:34,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-22 01:51:34,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-22 01:51:34,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-22 01:51:34,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-22 01:51:34,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-22 01:51:34,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-22 01:51:34,924 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationWernerOverapprox_32.epf [2021-02-22 01:51:34,954 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-22 01:51:34,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-22 01:51:34,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-22 01:51:34,957 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-22 01:51:34,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-22 01:51:34,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-22 01:51:34,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-22 01:51:34,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-22 01:51:34,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-22 01:51:34,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-22 01:51:34,958 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-22 01:51:34,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-22 01:51:34,958 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-22 01:51:34,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-22 01:51:34,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-22 01:51:34,959 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-22 01:51:34,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-22 01:51:34,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-22 01:51:34,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-22 01:51:34,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-22 01:51:34,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-22 01:51:34,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-22 01:51:34,960 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=WERNER_OVERAPPROX [2021-02-22 01:51:34,961 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 [2021-02-22 01:51:35,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-22 01:51:35,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-22 01:51:35,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-22 01:51:35,355 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-22 01:51:35,358 INFO L275 PluginConnector]: CDTParser initialized [2021-02-22 01:51:35,359 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2021-02-22 01:51:35,457 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8c96f2e3/4f7bcb3d09ee4a0ab53092bae061d4db/FLAG03ba86183 [2021-02-22 01:51:36,049 INFO L306 CDTParser]: Found 1 translation units. [2021-02-22 01:51:36,050 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2021-02-22 01:51:36,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8c96f2e3/4f7bcb3d09ee4a0ab53092bae061d4db/FLAG03ba86183 [2021-02-22 01:51:36,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8c96f2e3/4f7bcb3d09ee4a0ab53092bae061d4db [2021-02-22 01:51:36,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-22 01:51:36,433 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-22 01:51:36,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-22 01:51:36,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-22 01:51:36,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-22 01:51:36,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.02 01:51:36" (1/1) ... [2021-02-22 01:51:36,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1abf4163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:36, skipping insertion in model container [2021-02-22 01:51:36,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.02 01:51:36" (1/1) ... [2021-02-22 01:51:36,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-22 01:51:36,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-22 01:51:36,731 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c[502,515] [2021-02-22 01:51:36,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-22 01:51:36,769 INFO L203 MainTranslator]: Completed pre-run [2021-02-22 01:51:36,783 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c[502,515] [2021-02-22 01:51:36,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-22 01:51:36,814 INFO L208 MainTranslator]: Completed translation [2021-02-22 01:51:36,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:36 WrapperNode [2021-02-22 01:51:36,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-22 01:51:36,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-22 01:51:36,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-22 01:51:36,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-22 01:51:36,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:36" (1/1) ... [2021-02-22 01:51:36,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:36" (1/1) ... [2021-02-22 01:51:36,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:36" (1/1) ... [2021-02-22 01:51:36,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:36" (1/1) ... [2021-02-22 01:51:36,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:36" (1/1) ... [2021-02-22 01:51:36,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:36" (1/1) ... [2021-02-22 01:51:36,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:36" (1/1) ... [2021-02-22 01:51:36,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-22 01:51:36,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-22 01:51:36,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-22 01:51:36,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-22 01:51:36,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:36" (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-02-22 01:51:36,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-22 01:51:36,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-22 01:51:36,952 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-22 01:51:36,952 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-02-22 01:51:36,953 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-02-22 01:51:36,953 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2021-02-22 01:51:36,953 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-22 01:51:36,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-02-22 01:51:36,953 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-02-22 01:51:36,954 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-02-22 01:51:36,954 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-22 01:51:36,954 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-22 01:51:36,954 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-22 01:51:36,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-22 01:51:36,954 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-02-22 01:51:36,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-02-22 01:51:36,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-22 01:51:36,955 INFO L130 BoogieDeclarations]: Found specification of procedure check [2021-02-22 01:51:36,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-22 01:51:36,955 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-22 01:51:36,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-02-22 01:51:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-02-22 01:51:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-22 01:51:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-22 01:51:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-22 01:51:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-22 01:51:36,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-22 01:51:37,512 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-22 01:51:37,514 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-02-22 01:51:37,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.02 01:51:37 BoogieIcfgContainer [2021-02-22 01:51:37,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-22 01:51:37,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-22 01:51:37,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-22 01:51:37,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-22 01:51:37,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.02 01:51:36" (1/3) ... [2021-02-22 01:51:37,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f24f623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.02 01:51:37, skipping insertion in model container [2021-02-22 01:51:37,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:51:36" (2/3) ... [2021-02-22 01:51:37,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f24f623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.02 01:51:37, skipping insertion in model container [2021-02-22 01:51:37,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.02 01:51:37" (3/3) ... [2021-02-22 01:51:37,531 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2021-02-22 01:51:37,542 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-22 01:51:37,547 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-22 01:51:37,569 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-22 01:51:37,607 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-22 01:51:37,607 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-22 01:51:37,607 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-22 01:51:37,608 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-22 01:51:37,608 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-22 01:51:37,608 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-22 01:51:37,608 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-22 01:51:37,608 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-22 01:51:37,637 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2021-02-22 01:51:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-02-22 01:51:37,649 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:51:37,650 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-02-22 01:51:37,651 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:51:37,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:51:37,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1226469690, now seen corresponding path program 1 times [2021-02-22 01:51:37,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:51:37,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1324057775] [2021-02-22 01:51:37,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:51:37,771 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:51:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:38,051 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:38,052 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:38,061 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:38,062 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:38,090 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:38,091 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:38,129 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:38,130 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:38,143 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:38,144 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:38,155 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:38,156 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:38,166 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:38,167 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:38,177 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:38,178 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:38,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:51:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:38,230 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:38,231 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:38,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:51:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:38,238 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:38,239 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:38,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-22 01:51:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:38,247 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:38,250 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:38,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-22 01:51:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:38,281 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:38,282 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-02-22 01:51:38,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1324057775] [2021-02-22 01:51:38,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:51:38,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-22 01:51:38,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801263821] [2021-02-22 01:51:38,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-22 01:51:38,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:51:38,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-22 01:51:38,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-02-22 01:51:38,335 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 10 states. [2021-02-22 01:51:39,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:51:39,438 INFO L93 Difference]: Finished difference Result 227 states and 263 transitions. [2021-02-22 01:51:39,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-02-22 01:51:39,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2021-02-22 01:51:39,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:51:39,452 INFO L225 Difference]: With dead ends: 227 [2021-02-22 01:51:39,453 INFO L226 Difference]: Without dead ends: 143 [2021-02-22 01:51:39,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-02-22 01:51:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-02-22 01:51:39,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 127. [2021-02-22 01:51:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2021-02-22 01:51:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2021-02-22 01:51:39,542 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 45 [2021-02-22 01:51:39,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:51:39,543 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2021-02-22 01:51:39,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-22 01:51:39,543 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2021-02-22 01:51:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-02-22 01:51:39,560 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:51:39,561 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2021-02-22 01:51:39,563 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-22 01:51:39,563 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:51:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:51:39,564 INFO L82 PathProgramCache]: Analyzing trace with hash 41918952, now seen corresponding path program 1 times [2021-02-22 01:51:39,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:51:39,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [298969441] [2021-02-22 01:51:39,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:51:39,575 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:51:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:39,770 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,775 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:39,779 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,779 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:51:39,785 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,785 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-02-22 01:51:39,800 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,802 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-22 01:51:39,818 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,819 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-22 01:51:39,830 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,831 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-22 01:51:39,844 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,851 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:51:39,869 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,870 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:51:39,883 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,884 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:39,895 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,896 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:39,909 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,910 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:39,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:51:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:39,983 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,983 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:39,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:51:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:39,989 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:39,990 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:39,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-22 01:51:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:39,999 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:40,000 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:40,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-22 01:51:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:40,033 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:40,034 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:51:40,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-02-22 01:51:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:40,064 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:40,066 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-02-22 01:51:40,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [298969441] [2021-02-22 01:51:40,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:51:40,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-02-22 01:51:40,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775079147] [2021-02-22 01:51:40,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-02-22 01:51:40,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:51:40,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-02-22 01:51:40,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-02-22 01:51:40,079 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 14 states. [2021-02-22 01:51:41,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:51:41,116 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2021-02-22 01:51:41,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-02-22 01:51:41,118 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2021-02-22 01:51:41,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:51:41,120 INFO L225 Difference]: With dead ends: 133 [2021-02-22 01:51:41,120 INFO L226 Difference]: Without dead ends: 113 [2021-02-22 01:51:41,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2021-02-22 01:51:41,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-02-22 01:51:41,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-02-22 01:51:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2021-02-22 01:51:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2021-02-22 01:51:41,153 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 57 [2021-02-22 01:51:41,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:51:41,153 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2021-02-22 01:51:41,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-02-22 01:51:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2021-02-22 01:51:41,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-02-22 01:51:41,156 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:51:41,156 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 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, 1] [2021-02-22 01:51:41,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-22 01:51:41,157 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:51:41,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:51:41,157 INFO L82 PathProgramCache]: Analyzing trace with hash 411171829, now seen corresponding path program 1 times [2021-02-22 01:51:41,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:51:41,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1129447359] [2021-02-22 01:51:41,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:51:41,161 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:51:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:41,294 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,295 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:41,296 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,297 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:41,319 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,320 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:41,328 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,329 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:41,338 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,339 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:41,349 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,350 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:41,364 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,365 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:41,379 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,380 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:41,394 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,400 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:41,415 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,416 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:41,432 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,433 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:41,433 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,434 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:41,447 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,448 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:41,464 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,464 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:41,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:51:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:41,509 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,510 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:41,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:51:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:41,513 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,514 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:41,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-22 01:51:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:41,518 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,518 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:41,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-22 01:51:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:41,540 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,541 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:41,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-22 01:51:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:41,548 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,549 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:41,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-22 01:51:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:41,554 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:41,554 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:41,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-02-22 01:51:41,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1129447359] [2021-02-22 01:51:41,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:51:41,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-02-22 01:51:41,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902111645] [2021-02-22 01:51:41,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-22 01:51:41,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:51:41,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-22 01:51:41,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-02-22 01:51:41,569 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand 15 states. [2021-02-22 01:51:43,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:51:43,365 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2021-02-22 01:51:43,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-02-22 01:51:43,366 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2021-02-22 01:51:43,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:51:43,369 INFO L225 Difference]: With dead ends: 184 [2021-02-22 01:51:43,369 INFO L226 Difference]: Without dead ends: 182 [2021-02-22 01:51:43,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2021-02-22 01:51:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-02-22 01:51:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 156. [2021-02-22 01:51:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2021-02-22 01:51:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 169 transitions. [2021-02-22 01:51:43,412 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 169 transitions. Word has length 72 [2021-02-22 01:51:43,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:51:43,413 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 169 transitions. [2021-02-22 01:51:43,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-22 01:51:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 169 transitions. [2021-02-22 01:51:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-02-22 01:51:43,415 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:51:43,416 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 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, 1] [2021-02-22 01:51:43,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-22 01:51:43,416 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:51:43,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:51:43,417 INFO L82 PathProgramCache]: Analyzing trace with hash -710591147, now seen corresponding path program 1 times [2021-02-22 01:51:43,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:51:43,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [589611219] [2021-02-22 01:51:43,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:51:43,420 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:51:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:43,530 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,531 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:43,535 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,539 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:43,546 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,547 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:43,557 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,558 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:43,567 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,568 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:43,578 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,579 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:43,591 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,592 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:43,613 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,614 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:43,626 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,628 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:43,643 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,644 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:43,659 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,659 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:43,661 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,661 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:43,673 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,674 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:43,686 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,686 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:43,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:51:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:43,750 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,751 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:43,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:51:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:43,754 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,758 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:43,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-22 01:51:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:43,771 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,772 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:43,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-22 01:51:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:43,796 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,797 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:43,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-22 01:51:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:43,805 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,805 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:43,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-22 01:51:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:43,815 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:43,817 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:43,827 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-02-22 01:51:43,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [589611219] [2021-02-22 01:51:43,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:51:43,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-02-22 01:51:43,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163921056] [2021-02-22 01:51:43,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-22 01:51:43,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:51:43,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-22 01:51:43,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-02-22 01:51:43,830 INFO L87 Difference]: Start difference. First operand 156 states and 169 transitions. Second operand 15 states. [2021-02-22 01:51:45,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:51:45,643 INFO L93 Difference]: Finished difference Result 226 states and 247 transitions. [2021-02-22 01:51:45,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-02-22 01:51:45,644 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2021-02-22 01:51:45,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:51:45,648 INFO L225 Difference]: With dead ends: 226 [2021-02-22 01:51:45,648 INFO L226 Difference]: Without dead ends: 224 [2021-02-22 01:51:45,651 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2021-02-22 01:51:45,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-02-22 01:51:45,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 199. [2021-02-22 01:51:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2021-02-22 01:51:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 217 transitions. [2021-02-22 01:51:45,712 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 217 transitions. Word has length 72 [2021-02-22 01:51:45,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:51:45,713 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 217 transitions. [2021-02-22 01:51:45,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-22 01:51:45,713 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 217 transitions. [2021-02-22 01:51:45,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-02-22 01:51:45,715 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:51:45,715 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-22 01:51:45,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-22 01:51:45,716 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:51:45,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:51:45,716 INFO L82 PathProgramCache]: Analyzing trace with hash -562495935, now seen corresponding path program 1 times [2021-02-22 01:51:45,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:51:45,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [156817432] [2021-02-22 01:51:45,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:51:45,719 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:51:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:45,774 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,774 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:45,775 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,776 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:51:45,779 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,780 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:51:45,784 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,785 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:51:45,790 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,791 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:51:45,798 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,799 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-02-22 01:51:45,806 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,807 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-22 01:51:45,820 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,821 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-22 01:51:45,835 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,835 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-22 01:51:45,849 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,849 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:51:45,868 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,869 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:51:45,883 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,884 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:45,896 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,897 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:45,910 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,910 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:45,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:51:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:45,950 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,951 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:45,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:51:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:45,955 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,955 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:45,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-22 01:51:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:45,959 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,961 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:45,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-22 01:51:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:45,982 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:45,983 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:51:46,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-22 01:51:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:46,005 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,005 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:46,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-22 01:51:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:46,010 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,011 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:46,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-02-22 01:51:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:46,015 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:46,015 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:46,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-02-22 01:51:46,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [156817432] [2021-02-22 01:51:46,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:51:46,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-02-22 01:51:46,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032334750] [2021-02-22 01:51:46,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-02-22 01:51:46,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:51:46,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-02-22 01:51:46,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-02-22 01:51:46,031 INFO L87 Difference]: Start difference. First operand 199 states and 217 transitions. Second operand 16 states. [2021-02-22 01:51:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:51:47,563 INFO L93 Difference]: Finished difference Result 211 states and 231 transitions. [2021-02-22 01:51:47,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-02-22 01:51:47,563 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 84 [2021-02-22 01:51:47,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:51:47,565 INFO L225 Difference]: With dead ends: 211 [2021-02-22 01:51:47,565 INFO L226 Difference]: Without dead ends: 147 [2021-02-22 01:51:47,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2021-02-22 01:51:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-02-22 01:51:47,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 118. [2021-02-22 01:51:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2021-02-22 01:51:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2021-02-22 01:51:47,589 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 84 [2021-02-22 01:51:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:51:47,590 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2021-02-22 01:51:47,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-02-22 01:51:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2021-02-22 01:51:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-22 01:51:47,592 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:51:47,592 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-02-22 01:51:47,593 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-22 01:51:47,593 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:51:47,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:51:47,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2003080282, now seen corresponding path program 2 times [2021-02-22 01:51:47,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:51:47,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [863682282] [2021-02-22 01:51:47,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:51:47,596 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:51:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:47,656 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,657 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:47,659 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,660 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:47,673 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,675 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:47,683 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,683 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:47,693 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,694 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:47,707 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,708 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:47,720 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,721 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:47,733 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,738 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:47,752 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,753 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:47,768 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,769 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:47,790 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,792 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:47,793 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,794 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:47,818 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,819 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:47,839 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,841 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:47,862 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,863 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:47,886 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,887 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:47,917 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,918 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:47,918 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,919 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:47,937 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,937 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:47,961 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:47,962 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:48,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:51:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:48,018 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:48,019 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:48,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:51:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:48,022 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:48,023 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:48,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-22 01:51:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:48,026 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:48,027 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:48,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-22 01:51:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:48,052 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:48,053 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:48,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-22 01:51:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:48,057 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:48,058 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:48,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-22 01:51:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:48,062 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:48,063 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:48,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-02-22 01:51:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:48,067 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:48,067 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:48,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-02-22 01:51:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:48,072 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:48,073 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-02-22 01:51:48,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [863682282] [2021-02-22 01:51:48,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:51:48,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-02-22 01:51:48,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256583885] [2021-02-22 01:51:48,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-22 01:51:48,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:51:48,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-22 01:51:48,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-22 01:51:48,095 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 20 states. [2021-02-22 01:51:50,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:51:50,471 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2021-02-22 01:51:50,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-02-22 01:51:50,472 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2021-02-22 01:51:50,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:51:50,475 INFO L225 Difference]: With dead ends: 173 [2021-02-22 01:51:50,475 INFO L226 Difference]: Without dead ends: 171 [2021-02-22 01:51:50,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2021-02-22 01:51:50,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-02-22 01:51:50,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 124. [2021-02-22 01:51:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2021-02-22 01:51:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2021-02-22 01:51:50,501 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 99 [2021-02-22 01:51:50,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:51:50,501 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2021-02-22 01:51:50,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-22 01:51:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2021-02-22 01:51:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-22 01:51:50,503 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:51:50,504 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2021-02-22 01:51:50,504 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-22 01:51:50,504 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:51:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:51:50,505 INFO L82 PathProgramCache]: Analyzing trace with hash 881317306, now seen corresponding path program 1 times [2021-02-22 01:51:50,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:51:50,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1729525910] [2021-02-22 01:51:50,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:51:50,507 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:51:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:50,604 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,605 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:50,606 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,606 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,613 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,615 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,624 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,626 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,637 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,637 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,648 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,648 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,660 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,660 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,673 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,674 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,691 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,692 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,706 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,706 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,722 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,724 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,726 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,726 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,748 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,751 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,790 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,793 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,815 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,817 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,843 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,844 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,870 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,871 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:50,874 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,874 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:50,895 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,896 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:50,918 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,919 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:50,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:51:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:50,983 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,984 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:50,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:51:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:50,987 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,988 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:50,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-22 01:51:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:50,991 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:50,992 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:51,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-22 01:51:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:51,015 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:51,015 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:51,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-22 01:51:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:51,020 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:51,020 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:51,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-22 01:51:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:51,024 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:51,025 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:51,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-02-22 01:51:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:51,029 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:51,029 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:51,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-02-22 01:51:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:51,035 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:51,036 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-02-22 01:51:51,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1729525910] [2021-02-22 01:51:51,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:51:51,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-02-22 01:51:51,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539573760] [2021-02-22 01:51:51,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-22 01:51:51,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:51:51,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-22 01:51:51,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-22 01:51:51,057 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 20 states. [2021-02-22 01:51:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:51:53,492 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2021-02-22 01:51:53,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-02-22 01:51:53,492 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2021-02-22 01:51:53,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:51:53,494 INFO L225 Difference]: With dead ends: 196 [2021-02-22 01:51:53,495 INFO L226 Difference]: Without dead ends: 194 [2021-02-22 01:51:53,496 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2021-02-22 01:51:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-02-22 01:51:53,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 147. [2021-02-22 01:51:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2021-02-22 01:51:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2021-02-22 01:51:53,529 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 99 [2021-02-22 01:51:53,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:51:53,529 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2021-02-22 01:51:53,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-22 01:51:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2021-02-22 01:51:53,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-22 01:51:53,531 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:51:53,531 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2021-02-22 01:51:53,531 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-22 01:51:53,532 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:51:53,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:51:53,532 INFO L82 PathProgramCache]: Analyzing trace with hash -39618822, now seen corresponding path program 2 times [2021-02-22 01:51:53,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:51:53,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [141345814] [2021-02-22 01:51:53,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:51:53,535 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:51:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:53,589 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,590 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:53,591 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,592 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:53,598 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,599 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:53,606 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,607 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:53,616 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,617 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:53,627 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,627 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:53,638 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,639 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:53,651 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,652 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:53,665 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,665 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:53,681 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,681 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:53,700 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,700 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:53,703 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,703 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:53,720 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,721 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:53,740 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,741 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:53,763 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,763 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:53,787 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,787 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:53,815 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,815 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:53,816 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,817 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:53,837 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,837 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:53,859 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,861 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:53,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:51:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:53,926 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,927 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:53,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:51:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:53,931 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,932 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:53,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-22 01:51:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:53,943 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,943 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:53,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-22 01:51:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:53,971 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,972 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:53,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-22 01:51:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:53,984 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,985 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:53,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-22 01:51:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:53,993 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:53,994 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:53,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-02-22 01:51:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:54,003 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:54,004 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:54,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-02-22 01:51:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:54,009 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:54,010 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-02-22 01:51:54,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [141345814] [2021-02-22 01:51:54,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:51:54,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-02-22 01:51:54,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945549127] [2021-02-22 01:51:54,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-22 01:51:54,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:51:54,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-22 01:51:54,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-22 01:51:54,032 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 20 states. [2021-02-22 01:51:56,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:51:56,536 INFO L93 Difference]: Finished difference Result 213 states and 228 transitions. [2021-02-22 01:51:56,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-02-22 01:51:56,537 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2021-02-22 01:51:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:51:56,539 INFO L225 Difference]: With dead ends: 213 [2021-02-22 01:51:56,539 INFO L226 Difference]: Without dead ends: 211 [2021-02-22 01:51:56,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2021-02-22 01:51:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-02-22 01:51:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 187. [2021-02-22 01:51:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2021-02-22 01:51:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 200 transitions. [2021-02-22 01:51:56,580 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 200 transitions. Word has length 99 [2021-02-22 01:51:56,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:51:56,580 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 200 transitions. [2021-02-22 01:51:56,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-22 01:51:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 200 transitions. [2021-02-22 01:51:56,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-02-22 01:51:56,583 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:51:56,583 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2021-02-22 01:51:56,583 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-22 01:51:56,583 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:51:56,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:51:56,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1220663755, now seen corresponding path program 3 times [2021-02-22 01:51:56,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:51:56,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1633341495] [2021-02-22 01:51:56,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:51:56,586 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:51:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:56,650 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,651 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:56,652 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,652 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,658 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,659 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,666 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,666 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,674 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,675 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,685 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,686 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,697 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,698 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,710 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,710 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,723 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,723 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,739 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,740 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,759 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,760 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,761 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,761 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,782 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,785 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,807 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,807 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,832 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,833 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,855 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,858 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,881 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,881 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,882 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,883 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,911 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,912 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,941 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,941 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,969 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,970 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:56,998 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:56,999 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:57,028 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:57,028 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-22 01:51:57,029 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:57,029 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:57,053 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:57,053 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-22 01:51:57,079 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:57,079 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:57,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:51:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:57,151 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:57,152 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:57,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:51:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:57,156 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:57,156 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:57,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-22 01:51:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:57,160 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:57,161 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:57,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-22 01:51:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:57,188 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:57,189 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:57,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-22 01:51:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:57,194 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:57,194 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:57,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-22 01:51:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:57,200 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:57,201 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:57,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-02-22 01:51:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:57,208 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:57,209 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:57,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-02-22 01:51:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:57,219 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:57,219 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:57,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-02-22 01:51:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:57,223 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:57,224 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:57,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-02-22 01:51:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:51:57,229 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:51:57,229 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:51:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-02-22 01:51:57,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1633341495] [2021-02-22 01:51:57,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:51:57,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-02-22 01:51:57,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929411599] [2021-02-22 01:51:57,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-02-22 01:51:57,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:51:57,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-02-22 01:51:57,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-02-22 01:51:57,274 INFO L87 Difference]: Start difference. First operand 187 states and 200 transitions. Second operand 25 states. [2021-02-22 01:52:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:52:00,852 INFO L93 Difference]: Finished difference Result 242 states and 257 transitions. [2021-02-22 01:52:00,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-02-22 01:52:00,853 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 126 [2021-02-22 01:52:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:52:00,856 INFO L225 Difference]: With dead ends: 242 [2021-02-22 01:52:00,856 INFO L226 Difference]: Without dead ends: 176 [2021-02-22 01:52:00,858 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=576, Invalid=2846, Unknown=0, NotChecked=0, Total=3422 [2021-02-22 01:52:00,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-02-22 01:52:00,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2021-02-22 01:52:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2021-02-22 01:52:00,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2021-02-22 01:52:00,889 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 126 [2021-02-22 01:52:00,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:52:00,889 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2021-02-22 01:52:00,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-02-22 01:52:00,889 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2021-02-22 01:52:00,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-02-22 01:52:00,891 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:52:00,891 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2021-02-22 01:52:00,891 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-22 01:52:00,892 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:52:00,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:52:00,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2141599883, now seen corresponding path program 4 times [2021-02-22 01:52:00,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:52:00,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [627728126] [2021-02-22 01:52:00,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:52:00,895 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:52:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:00,945 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:00,946 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:00,947 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:00,947 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:52:00,957 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:00,958 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:52:00,963 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:00,963 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:52:00,969 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:00,969 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:52:00,976 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:00,977 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:52:00,978 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:00,978 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-22 01:52:00,992 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:00,993 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-22 01:52:01,006 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:01,006 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-22 01:52:01,019 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:01,020 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:01,020 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:01,021 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:01,021 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:01,022 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:01,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:52:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:01,059 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:01,059 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:01,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-22 01:52:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:01,062 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:01,063 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:01,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-22 01:52:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:01,066 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:01,067 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:01,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-22 01:52:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:01,084 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:01,085 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-22 01:52:01,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-22 01:52:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:01,103 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:01,104 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:01,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-22 01:52:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:01,108 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:01,108 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:01,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-02-22 01:52:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:01,113 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:01,114 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:01,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-02-22 01:52:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:01,118 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:01,119 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:01,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-02-22 01:52:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:01,123 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:01,124 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:01,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-02-22 01:52:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:01,127 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:01,127 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-02-22 01:52:01,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [627728126] [2021-02-22 01:52:01,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:52:01,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-02-22 01:52:01,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070307660] [2021-02-22 01:52:01,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-22 01:52:01,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:52:01,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-22 01:52:01,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-02-22 01:52:01,155 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 12 states. [2021-02-22 01:52:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:52:01,813 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2021-02-22 01:52:01,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-02-22 01:52:01,814 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 126 [2021-02-22 01:52:01,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:52:01,814 INFO L225 Difference]: With dead ends: 168 [2021-02-22 01:52:01,814 INFO L226 Difference]: Without dead ends: 0 [2021-02-22 01:52:01,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-02-22 01:52:01,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-22 01:52:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-22 01:52:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-22 01:52:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-22 01:52:01,816 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 126 [2021-02-22 01:52:01,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:52:01,816 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-22 01:52:01,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-22 01:52:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-22 01:52:01,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-22 01:52:01,817 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-22 01:52:01,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-22 01:52:04,986 WARN L202 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-22 01:52:05,195 WARN L202 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 29 [2021-02-22 01:52:05,551 WARN L202 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2021-02-22 01:52:05,930 WARN L202 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-22 01:52:06,145 WARN L202 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2021-02-22 01:52:06,280 WARN L202 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 25 [2021-02-22 01:52:06,654 WARN L202 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-22 01:52:06,935 WARN L202 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 34 [2021-02-22 01:52:07,327 WARN L202 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-22 01:52:07,451 WARN L202 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 20 [2021-02-22 01:52:07,876 WARN L202 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-22 01:52:08,123 WARN L202 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2021-02-22 01:52:08,343 WARN L202 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2021-02-22 01:52:08,678 WARN L202 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2021-02-22 01:52:08,973 WARN L202 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2021-02-22 01:52:09,354 WARN L202 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2021-02-22 01:52:09,802 WARN L202 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2021-02-22 01:52:10,282 WARN L202 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2021-02-22 01:52:10,729 WARN L202 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2021-02-22 01:52:11,006 WARN L202 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2021-02-22 01:52:11,420 WARN L202 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 50 [2021-02-22 01:52:11,674 WARN L202 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2021-02-22 01:52:12,171 WARN L202 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2021-02-22 01:52:12,415 WARN L202 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2021-02-22 01:52:12,877 WARN L202 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2021-02-22 01:52:12,992 WARN L202 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 20 [2021-02-22 01:52:13,398 WARN L202 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-22 01:52:13,737 WARN L202 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2021-02-22 01:52:14,089 WARN L202 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2021-02-22 01:52:14,423 WARN L202 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2021-02-22 01:52:14,725 WARN L202 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 42 [2021-02-22 01:52:14,937 WARN L202 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2021-02-22 01:52:14,965 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2021-02-22 01:52:14,965 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2021-02-22 01:52:14,965 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2021-02-22 01:52:14,965 INFO L192 CegarLoopUtils]: At program point L5-4(line 5) the Hoare annotation is: true [2021-02-22 01:52:14,965 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-22 01:52:14,966 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-22 01:52:14,966 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 5) the Hoare annotation is: true [2021-02-22 01:52:14,966 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#t~string6.offset)| |#t~string6.offset|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string7.offset| |old(#t~string7.offset)|) (= |old(#t~string7.base)| |#t~string7.base|) (= |old(#valid)| |#valid|)) [2021-02-22 01:52:14,966 INFO L192 CegarLoopUtils]: At program point L5(line 5) the Hoare annotation is: true [2021-02-22 01:52:14,966 INFO L192 CegarLoopUtils]: At program point L5-1(line 5) the Hoare annotation is: true [2021-02-22 01:52:14,966 INFO L192 CegarLoopUtils]: At program point L5-2(line 5) the Hoare annotation is: true [2021-02-22 01:52:14,967 INFO L192 CegarLoopUtils]: At program point L5-3(line 5) the Hoare annotation is: true [2021-02-22 01:52:14,967 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-22 01:52:14,967 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-22 01:52:14,967 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-22 01:52:14,967 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-22 01:52:14,967 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-22 01:52:14,967 INFO L192 CegarLoopUtils]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2021-02-22 01:52:14,968 INFO L192 CegarLoopUtils]: At program point L8(line 8) the Hoare annotation is: true [2021-02-22 01:52:14,968 INFO L192 CegarLoopUtils]: At program point L8-1(line 8) the Hoare annotation is: true [2021-02-22 01:52:14,968 INFO L192 CegarLoopUtils]: At program point L8-3(lines 7 9) the Hoare annotation is: true [2021-02-22 01:52:14,968 INFO L192 CegarLoopUtils]: At program point assume_abort_if_notEXIT(lines 7 9) the Hoare annotation is: true [2021-02-22 01:52:14,968 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 40 54) the Hoare annotation is: true [2021-02-22 01:52:14,968 INFO L192 CegarLoopUtils]: At program point L52(line 52) the Hoare annotation is: true [2021-02-22 01:52:14,968 INFO L185 CegarLoopUtils]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)) (= main_~ax~1 0) (= main_~ai~1 0))) [2021-02-22 01:52:14,968 INFO L192 CegarLoopUtils]: At program point L50-1(line 50) the Hoare annotation is: true [2021-02-22 01:52:14,969 INFO L185 CegarLoopUtils]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)))) [2021-02-22 01:52:14,969 INFO L185 CegarLoopUtils]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)) (= |main_#t~mem19| 0))) [2021-02-22 01:52:14,969 INFO L185 CegarLoopUtils]: At program point L46(line 46) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-02-22 01:52:14,969 INFO L185 CegarLoopUtils]: At program point L48-2(line 48) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)) (= main_~ai~1 0) (= |main_#t~mem19| 0))) [2021-02-22 01:52:14,969 INFO L185 CegarLoopUtils]: At program point L46-1(line 46) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc17.base|)) [2021-02-22 01:52:14,969 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 40 54) the Hoare annotation is: true [2021-02-22 01:52:14,969 INFO L185 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-22 01:52:14,970 INFO L185 CegarLoopUtils]: At program point L42-1(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-22 01:52:14,970 INFO L185 CegarLoopUtils]: At program point mainENTRY(lines 40 54) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-22 01:52:14,970 INFO L185 CegarLoopUtils]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)) (= main_~ai~1 0))) [2021-02-22 01:52:14,970 INFO L185 CegarLoopUtils]: At program point L49-1(line 49) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)) (= |main_#t~mem20| 0) (= main_~ai~1 0))) [2021-02-22 01:52:14,970 INFO L185 CegarLoopUtils]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)))) [2021-02-22 01:52:14,971 INFO L185 CegarLoopUtils]: At program point L49-2(line 49) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)) (= main_~ax~1 0) (= |main_#t~mem20| 0) (= main_~ai~1 0))) [2021-02-22 01:52:14,971 INFO L185 CegarLoopUtils]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)))) [2021-02-22 01:52:14,971 INFO L185 CegarLoopUtils]: At program point L45(line 45) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-22 01:52:14,971 INFO L185 CegarLoopUtils]: At program point L47-2(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)))) [2021-02-22 01:52:14,971 INFO L185 CegarLoopUtils]: At program point L45-1(line 45) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-22 01:52:14,971 INFO L185 CegarLoopUtils]: At program point L47-3(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)))) [2021-02-22 01:52:14,971 INFO L185 CegarLoopUtils]: At program point L43(line 43) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-22 01:52:14,972 INFO L185 CegarLoopUtils]: At program point L43-1(line 43) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-22 01:52:14,972 INFO L185 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-22 01:52:14,972 INFO L185 CegarLoopUtils]: At program point L41-1(line 41) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-22 01:52:14,972 INFO L185 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-22 01:52:14,972 INFO L185 CegarLoopUtils]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (= |check_#t~mem13| 0)) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or (and .cse0 .cse1) .cse2 (not (<= 1 |check_#in~x|)) .cse3) (or .cse2 (and (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse0 .cse1) (not (= |check_#in~x| 0)) .cse3)))) [2021-02-22 01:52:14,972 INFO L192 CegarLoopUtils]: At program point checkENTRY(lines 16 38) the Hoare annotation is: true [2021-02-22 01:52:14,973 INFO L185 CegarLoopUtils]: At program point L33-2(line 33) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (= check_~ai~0 0)) (.cse2 (= (select |#memory_int| check_~a.base) .cse6)) (.cse3 (= |check_#t~mem13| 0)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse1 .cse2 .cse3) .cse4) (or .cse0 (and (or (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse1 .cse2 .cse3) (not (= |check_#in~x| 0)) .cse4)))) [2021-02-22 01:52:14,973 INFO L185 CegarLoopUtils]: At program point L29(line 29) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-22 01:52:14,973 INFO L185 CegarLoopUtils]: At program point L29-1(line 29) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-22 01:52:14,973 INFO L185 CegarLoopUtils]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2021-02-22 01:52:14,973 INFO L185 CegarLoopUtils]: At program point L29-2(line 29) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-22 01:52:14,973 INFO L185 CegarLoopUtils]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2021-02-22 01:52:14,973 INFO L185 CegarLoopUtils]: At program point L27-2(line 27) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2021-02-22 01:52:14,974 INFO L185 CegarLoopUtils]: At program point L21(line 21) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-22 01:52:14,974 INFO L185 CegarLoopUtils]: At program point L17(line 17) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-22 01:52:14,974 INFO L185 CegarLoopUtils]: At program point L17-1(line 17) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0)) (.cse5 (+ check_~y 1))) (let ((.cse1 (<= .cse5 |check_#in~n|)) (.cse2 (<= .cse5 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 (and .cse1 .cse2 (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or (and .cse1 .cse2 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse4)))) [2021-02-22 01:52:14,974 INFO L185 CegarLoopUtils]: At program point checkFINAL(lines 16 38) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2021-02-22 01:52:14,974 INFO L185 CegarLoopUtils]: At program point L34(line 34) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5))) (.cse2 (= check_~ai~0 0)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2 .cse3))))) [2021-02-22 01:52:14,974 INFO L185 CegarLoopUtils]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6))) (.cse2 (= |check_#t~mem14| 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 (or (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse3 .cse4))))) [2021-02-22 01:52:14,975 INFO L185 CegarLoopUtils]: At program point L34-2(line 34) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= check_~ax~0 0)) (.cse3 (= |check_#t~mem14| 0)) (.cse5 (= check_~ai~0 0)) (.cse6 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse5 .cse6)) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse5 .cse6) .cse1)))) [2021-02-22 01:52:14,975 INFO L185 CegarLoopUtils]: At program point L26(line 26) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-22 01:52:14,975 INFO L185 CegarLoopUtils]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0)) (.cse9 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= |check_#t~mem8| 0)) (.cse4 (<= .cse9 |check_#in~n|)) (.cse5 (<= .cse9 check_~n)) (.cse6 (= (select |#memory_int| check_~a.base) .cse8)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse8))) (.cse2 (not (<= 2 |check_#in~x|)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse3 .cse4 .cse5 .cse6 (= check_~x 0))) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse3 .cse4 .cse5 .cse6 (<= 1 check_~x)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse7 (+ check_~y 2))) (and (<= .cse7 check_~n) (<= .cse7 |check_#in~n|))) .cse2)))) [2021-02-22 01:52:14,975 INFO L185 CegarLoopUtils]: At program point L24(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-22 01:52:14,976 INFO L185 CegarLoopUtils]: At program point L26-2(lines 26 27) the Hoare annotation is: (let ((.cse9 ((as const (Array Int Int)) 0)) (.cse10 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= |check_#t~mem8| 0)) (.cse4 (<= .cse10 |check_#in~n|)) (.cse5 (<= .cse10 check_~n)) (.cse6 (= |check_#t~mem9| 0)) (.cse7 (= (select |#memory_int| check_~a.base) .cse9)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse9))) (.cse2 (not (<= 2 |check_#in~x|)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse3 .cse4 .cse5 .cse6 .cse7 (= check_~x 0))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse8 (+ check_~y 2))) (and (<= .cse8 check_~n) (<= .cse8 |check_#in~n|))) .cse2)))) [2021-02-22 01:52:14,976 INFO L185 CegarLoopUtils]: At program point L26-3(line 26) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse4 (<= .cse8 |check_#in~n|)) (.cse5 (<= .cse8 check_~n)) (.cse6 (= (select |#memory_int| check_~a.base) .cse7))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 check_~n) (<= .cse3 |check_#in~n|)))) (or .cse0 (and .cse4 .cse5 .cse6 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse4 .cse5 (= |check_#t~mem9| 0) .cse6 (= check_~x 0)))))) [2021-02-22 01:52:14,976 INFO L185 CegarLoopUtils]: At program point L26-4(line 26) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse3 .cse4 .cse5 (= check_~x 0))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-22 01:52:14,976 INFO L185 CegarLoopUtils]: At program point L26-5(line 26) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (<= .cse8 |check_#in~n|)) (.cse5 (<= .cse8 check_~n)) (.cse6 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 check_~n) (<= .cse3 |check_#in~n|)))) (or .cse0 (and .cse4 .cse5 .cse6 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse4 .cse5 .cse6 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-22 01:52:14,976 INFO L185 CegarLoopUtils]: At program point L20(line 20) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-22 01:52:14,977 INFO L185 CegarLoopUtils]: At program point L26-6(line 26) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (not (<= 2 |check_#in~x|)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse3 (<= 1 |check_#t~post10|) .cse4 .cse5 (<= 1 check_~x))) (or .cse0 (and .cse3 (= |check_#t~post10| 0) .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2)))) [2021-02-22 01:52:14,977 INFO L185 CegarLoopUtils]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-22 01:52:14,977 INFO L185 CegarLoopUtils]: At program point L26-7(line 26) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse7 |check_#in~n|)) (.cse3 (<= .cse7 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 (= |check_#t~post10| 0) .cse4 (<= 1 check_~x))) (or .cse0 (and .cse2 (<= 1 |check_#t~post10|) .cse3 .cse4 (<= 2 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 check_~n) (<= .cse5 |check_#in~n|))) (not (<= 2 |check_#in~x|)))))) [2021-02-22 01:52:14,977 INFO L185 CegarLoopUtils]: At program point checkEXIT(lines 16 38) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2021-02-22 01:52:14,977 INFO L185 CegarLoopUtils]: At program point L26-9(line 26) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2021-02-22 01:52:14,977 INFO L185 CegarLoopUtils]: At program point L16(lines 16 38) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (= check_~x 0)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (<= 1 check_~x)))) [2021-02-22 01:52:14,978 INFO L185 CegarLoopUtils]: At program point L26-10(line 26) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2021-02-22 01:52:14,978 INFO L185 CegarLoopUtils]: At program point L16-1(lines 16 38) the Hoare annotation is: (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (<= (+ check_~y 2) |check_#in~n|)) (or .cse0 (and .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1))) [2021-02-22 01:52:14,978 INFO L185 CegarLoopUtils]: At program point L26-11(lines 26 27) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse1 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse0 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse0 (<= (+ check_~y 2) check_~n) (not (<= 2 |check_#in~x|))) (or .cse1 (and .cse2 .cse3 .cse4 (<= 2 check_~x)) (not (<= 1 |check_#in~x|)) .cse0) (or .cse1 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) (not (= |check_#in~x| 0)) .cse0)))) [2021-02-22 01:52:14,978 INFO L185 CegarLoopUtils]: At program point L16-2(lines 16 38) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (<= (+ check_~y 2) |check_#in~n|)) (or .cse0 (and .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-22 01:52:14,978 INFO L185 CegarLoopUtils]: At program point L16-3(lines 16 38) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (<= (+ check_~y 2) |check_#in~n|)) (or .cse0 (and .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-22 01:52:14,978 INFO L185 CegarLoopUtils]: At program point L35(line 35) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (= check_~ax~0 0)) (.cse1 (= check_~ai~0 0)) (.cse2 (= (select |#memory_int| check_~a.base) .cse6)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or (and .cse0 .cse1 .cse2) .cse3 (not (<= 1 |check_#in~x|)) .cse4) (or .cse3 (and .cse0 (or (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse1 .cse2) (not (= |check_#in~x| 0)) .cse4)))) [2021-02-22 01:52:14,979 INFO L185 CegarLoopUtils]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= check_~ax~0 0) (= check_~ai~0 0) (= (select |#memory_int| check_~a.base) .cse0)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)))) [2021-02-22 01:52:14,979 INFO L192 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2021-02-22 01:52:14,979 INFO L185 CegarLoopUtils]: At program point L11(line 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-22 01:52:14,979 INFO L185 CegarLoopUtils]: At program point L11-1(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-22 01:52:14,979 INFO L185 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-22 01:52:14,979 INFO L185 CegarLoopUtils]: At program point L11-2(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-22 01:52:14,979 INFO L185 CegarLoopUtils]: At program point L11-4(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-22 01:52:14,979 INFO L185 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-22 01:52:14,979 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-02-22 01:52:14,979 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2021-02-22 01:52:14,980 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2021-02-22 01:52:14,997 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:240) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:558) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-02-22 01:52:15,003 INFO L168 Benchmark]: Toolchain (without parser) took 38582.89 ms. Allocated memory was 152.0 MB in the beginning and 324.0 MB in the end (delta: 172.0 MB). Free memory was 126.5 MB in the beginning and 160.6 MB in the end (delta: -34.1 MB). Peak memory consumption was 188.2 MB. Max. memory is 8.0 GB. [2021-02-22 01:52:15,004 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 152.0 MB. Free memory is still 128.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-22 01:52:15,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.45 ms. Allocated memory is still 152.0 MB. Free memory was 125.7 MB in the beginning and 115.2 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-02-22 01:52:15,004 INFO L168 Benchmark]: Boogie Preprocessor took 39.46 ms. Allocated memory is still 152.0 MB. Free memory was 115.2 MB in the beginning and 113.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-02-22 01:52:15,004 INFO L168 Benchmark]: RCFGBuilder took 660.45 ms. Allocated memory is still 152.0 MB. Free memory was 113.5 MB in the beginning and 91.1 MB in the end (delta: 22.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2021-02-22 01:52:15,005 INFO L168 Benchmark]: TraceAbstraction took 37480.32 ms. Allocated memory was 152.0 MB in the beginning and 324.0 MB in the end (delta: 172.0 MB). Free memory was 90.7 MB in the beginning and 160.6 MB in the end (delta: -69.9 MB). Peak memory consumption was 152.5 MB. Max. memory is 8.0 GB. [2021-02-22 01:52:15,006 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.17 ms. Allocated memory is still 152.0 MB. Free memory is still 128.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 376.45 ms. Allocated memory is still 152.0 MB. Free memory was 125.7 MB in the beginning and 115.2 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 39.46 ms. Allocated memory is still 152.0 MB. Free memory was 115.2 MB in the beginning and 113.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 660.45 ms. Allocated memory is still 152.0 MB. Free memory was 113.5 MB in the beginning and 91.1 MB in the end (delta: 22.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 37480.32 ms. Allocated memory was 152.0 MB in the beginning and 324.0 MB in the end (delta: 172.0 MB). Free memory was 90.7 MB in the beginning and 160.6 MB in the end (delta: -69.9 MB). Peak memory consumption was 152.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 40]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 10]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:240) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...