/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/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:45:01,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:45:01,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:45:01,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:45:01,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:45:01,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:45:01,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:45:01,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:45:01,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:45:01,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:45:01,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:45:01,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:45:01,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:45:01,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:45:01,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:45:01,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:45:01,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:45:01,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:45:01,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:45:02,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:45:02,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:45:02,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:45:02,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:45:02,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:45:02,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:45:02,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:45:02,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:45:02,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:45:02,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:45:02,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:45:02,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:45:02,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:45:02,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:45:02,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:45:02,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:45:02,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:45:02,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:45:02,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:45:02,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:45:02,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:45:02,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:45:02,030 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:45:02,042 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:45:02,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:45:02,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:45:02,045 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:45:02,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:45:02,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:45:02,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:45:02,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:45:02,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:45:02,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:45:02,047 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:45:02,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:45:02,049 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:45:02,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:45:02,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:45:02,050 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:45:02,050 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:45:02,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:45:02,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:45:02,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:45:02,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:45:02,052 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:45:02,053 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 [2020-11-07 00:45:02,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:45:02,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:45:02,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:45:02,547 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:45:02,547 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:45:02,548 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 [2020-11-07 00:45:02,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6129bdf46/274e13cb81ea4845b5fb9b690e25705c/FLAGae2bda63b [2020-11-07 00:45:03,266 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:45:03,267 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-11-07 00:45:03,275 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6129bdf46/274e13cb81ea4845b5fb9b690e25705c/FLAGae2bda63b [2020-11-07 00:45:03,618 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6129bdf46/274e13cb81ea4845b5fb9b690e25705c [2020-11-07 00:45:03,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:45:03,629 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:45:03,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:45:03,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:45:03,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:45:03,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:45:03" (1/1) ... [2020-11-07 00:45:03,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3256a90e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:03, skipping insertion in model container [2020-11-07 00:45:03,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:45:03" (1/1) ... [2020-11-07 00:45:03,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:45:03,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:45:03,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:45:03,866 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:45:03,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:45:03,910 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:45:03,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:03 WrapperNode [2020-11-07 00:45:03,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:45:03,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:45:03,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:45:03,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:45:03,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:03" (1/1) ... [2020-11-07 00:45:03,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:03" (1/1) ... [2020-11-07 00:45:03,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:03" (1/1) ... [2020-11-07 00:45:03,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:03" (1/1) ... [2020-11-07 00:45:03,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:03" (1/1) ... [2020-11-07 00:45:03,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:03" (1/1) ... [2020-11-07 00:45:03,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:03" (1/1) ... [2020-11-07 00:45:03,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:45:03,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:45:03,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:45:03,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:45:03,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:03" (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 [2020-11-07 00:45:04,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:45:04,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:45:04,041 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:45:04,041 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-07 00:45:04,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 00:45:04,041 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-11-07 00:45:04,042 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:45:04,042 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-11-07 00:45:04,042 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-07 00:45:04,042 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-07 00:45:04,043 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:45:04,043 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:45:04,043 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:45:04,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:45:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-07 00:45:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 00:45:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:45:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-11-07 00:45:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:45:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:45:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-07 00:45:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-11-07 00:45:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:45:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:45:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:45:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:45:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:45:04,582 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:45:04,582 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:45:04,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:45:04 BoogieIcfgContainer [2020-11-07 00:45:04,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:45:04,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:45:04,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:45:04,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:45:04,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:45:03" (1/3) ... [2020-11-07 00:45:04,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f033b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:45:04, skipping insertion in model container [2020-11-07 00:45:04,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:03" (2/3) ... [2020-11-07 00:45:04,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f033b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:45:04, skipping insertion in model container [2020-11-07 00:45:04,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:45:04" (3/3) ... [2020-11-07 00:45:04,596 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2020-11-07 00:45:04,614 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:45:04,618 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:45:04,634 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:45:04,664 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:45:04,665 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:45:04,665 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:45:04,665 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:45:04,665 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:45:04,666 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:45:04,666 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:45:04,666 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:45:04,687 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2020-11-07 00:45:04,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-07 00:45:04,698 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:45:04,699 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] [2020-11-07 00:45:04,700 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:45:04,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:45:04,706 INFO L82 PathProgramCache]: Analyzing trace with hash 266751524, now seen corresponding path program 1 times [2020-11-07 00:45:04,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:45:04,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [554507100] [2020-11-07 00:45:04,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:45:04,804 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:45:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:05,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:45:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:05,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:45:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:05,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-07 00:45:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:05,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 00:45:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:05,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 00:45:05,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [554507100] [2020-11-07 00:45:05,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:45:05,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:45:05,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133661261] [2020-11-07 00:45:05,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:45:05,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:45:05,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:45:05,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:45:05,433 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 10 states. [2020-11-07 00:45:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:45:07,425 INFO L93 Difference]: Finished difference Result 231 states and 268 transitions. [2020-11-07 00:45:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 00:45:07,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2020-11-07 00:45:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:45:07,440 INFO L225 Difference]: With dead ends: 231 [2020-11-07 00:45:07,440 INFO L226 Difference]: Without dead ends: 144 [2020-11-07 00:45:07,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2020-11-07 00:45:07,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-11-07 00:45:07,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 128. [2020-11-07 00:45:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-11-07 00:45:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2020-11-07 00:45:07,531 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 46 [2020-11-07 00:45:07,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:45:07,532 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2020-11-07 00:45:07,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:45:07,532 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2020-11-07 00:45:07,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-07 00:45:07,535 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:45:07,536 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, 1] [2020-11-07 00:45:07,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:45:07,536 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:45:07,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:45:07,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2018690229, now seen corresponding path program 1 times [2020-11-07 00:45:07,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:45:07,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [812408594] [2020-11-07 00:45:07,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:45:07,542 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:45:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:07,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:45:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:07,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:45:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:07,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-07 00:45:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:07,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 00:45:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:07,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-07 00:45:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 00:45:07,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [812408594] [2020-11-07 00:45:07,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:45:07,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:45:07,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031670230] [2020-11-07 00:45:07,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:45:07,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:45:07,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:45:07,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:45:07,996 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 13 states. [2020-11-07 00:45:09,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:45:09,917 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2020-11-07 00:45:09,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 00:45:09,923 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2020-11-07 00:45:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:45:09,925 INFO L225 Difference]: With dead ends: 135 [2020-11-07 00:45:09,926 INFO L226 Difference]: Without dead ends: 114 [2020-11-07 00:45:09,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2020-11-07 00:45:09,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-11-07 00:45:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-11-07 00:45:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-11-07 00:45:09,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2020-11-07 00:45:09,959 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 58 [2020-11-07 00:45:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:45:09,959 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2020-11-07 00:45:09,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:45:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2020-11-07 00:45:09,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 00:45:09,962 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:45:09,962 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, 1] [2020-11-07 00:45:09,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:45:09,963 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:45:09,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:45:09,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1111445585, now seen corresponding path program 1 times [2020-11-07 00:45:09,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:45:09,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1773421362] [2020-11-07 00:45:09,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:45:09,967 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:45:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:10,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:45:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:10,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:45:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:10,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-07 00:45:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:10,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 00:45:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:10,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 00:45:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:10,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:45:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 00:45:10,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1773421362] [2020-11-07 00:45:10,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:45:10,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:45:10,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750589993] [2020-11-07 00:45:10,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:45:10,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:45:10,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:45:10,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:45:10,570 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 15 states. [2020-11-07 00:45:14,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:45:14,036 INFO L93 Difference]: Finished difference Result 186 states and 201 transitions. [2020-11-07 00:45:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:45:14,039 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-11-07 00:45:14,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:45:14,043 INFO L225 Difference]: With dead ends: 186 [2020-11-07 00:45:14,043 INFO L226 Difference]: Without dead ends: 183 [2020-11-07 00:45:14,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2020-11-07 00:45:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-11-07 00:45:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 157. [2020-11-07 00:45:14,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-11-07 00:45:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 170 transitions. [2020-11-07 00:45:14,082 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 170 transitions. Word has length 73 [2020-11-07 00:45:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:45:14,083 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 170 transitions. [2020-11-07 00:45:14,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:45:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 170 transitions. [2020-11-07 00:45:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 00:45:14,084 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:45:14,085 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, 1] [2020-11-07 00:45:14,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:45:14,085 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:45:14,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:45:14,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1526359473, now seen corresponding path program 1 times [2020-11-07 00:45:14,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:45:14,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [206924720] [2020-11-07 00:45:14,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:45:14,089 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:45:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:14,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:45:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:14,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:45:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:14,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-07 00:45:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:14,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 00:45:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:14,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 00:45:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:14,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:45:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 00:45:14,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [206924720] [2020-11-07 00:45:14,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:45:14,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:45:14,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013597160] [2020-11-07 00:45:14,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:45:14,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:45:14,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:45:14,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:45:14,682 INFO L87 Difference]: Start difference. First operand 157 states and 170 transitions. Second operand 15 states. [2020-11-07 00:45:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:45:17,992 INFO L93 Difference]: Finished difference Result 228 states and 249 transitions. [2020-11-07 00:45:17,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 00:45:17,994 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-11-07 00:45:17,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:45:17,997 INFO L225 Difference]: With dead ends: 228 [2020-11-07 00:45:17,997 INFO L226 Difference]: Without dead ends: 225 [2020-11-07 00:45:17,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 00:45:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-11-07 00:45:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 200. [2020-11-07 00:45:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-11-07 00:45:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 218 transitions. [2020-11-07 00:45:18,047 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 218 transitions. Word has length 73 [2020-11-07 00:45:18,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:45:18,048 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 218 transitions. [2020-11-07 00:45:18,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:45:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 218 transitions. [2020-11-07 00:45:18,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-11-07 00:45:18,050 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:45:18,051 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, 1] [2020-11-07 00:45:18,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:45:18,051 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:45:18,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:45:18,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1118871710, now seen corresponding path program 1 times [2020-11-07 00:45:18,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:45:18,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1868695138] [2020-11-07 00:45:18,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:45:18,055 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:45:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:18,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:45:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:18,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:45:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:18,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-07 00:45:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:18,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 00:45:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:18,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 00:45:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:18,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:45:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:18,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 00:45:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 00:45:18,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1868695138] [2020-11-07 00:45:18,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:45:18,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:45:18,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157643374] [2020-11-07 00:45:18,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:45:18,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:45:18,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:45:18,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:45:18,527 INFO L87 Difference]: Start difference. First operand 200 states and 218 transitions. Second operand 15 states. [2020-11-07 00:45:21,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:45:21,044 INFO L93 Difference]: Finished difference Result 213 states and 233 transitions. [2020-11-07 00:45:21,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 00:45:21,045 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2020-11-07 00:45:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:45:21,050 INFO L225 Difference]: With dead ends: 213 [2020-11-07 00:45:21,050 INFO L226 Difference]: Without dead ends: 148 [2020-11-07 00:45:21,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2020-11-07 00:45:21,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-11-07 00:45:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2020-11-07 00:45:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-11-07 00:45:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2020-11-07 00:45:21,100 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 85 [2020-11-07 00:45:21,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:45:21,101 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2020-11-07 00:45:21,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:45:21,102 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2020-11-07 00:45:21,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-11-07 00:45:21,114 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:45:21,115 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, 1] [2020-11-07 00:45:21,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:45:21,117 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:45:21,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:45:21,118 INFO L82 PathProgramCache]: Analyzing trace with hash 753971012, now seen corresponding path program 2 times [2020-11-07 00:45:21,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:45:21,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1843416414] [2020-11-07 00:45:21,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:45:21,125 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:45:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:21,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:45:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:21,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:45:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:21,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-07 00:45:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:21,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 00:45:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:21,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 00:45:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:21,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:45:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:21,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-11-07 00:45:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:21,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-07 00:45:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 00:45:21,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1843416414] [2020-11-07 00:45:21,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:45:21,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-11-07 00:45:21,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333556197] [2020-11-07 00:45:21,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 00:45:21,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:45:21,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 00:45:21,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:45:21,949 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 20 states. [2020-11-07 00:45:26,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:45:26,400 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2020-11-07 00:45:26,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 00:45:26,401 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 100 [2020-11-07 00:45:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:45:26,403 INFO L225 Difference]: With dead ends: 175 [2020-11-07 00:45:26,403 INFO L226 Difference]: Without dead ends: 172 [2020-11-07 00:45:26,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2020-11-07 00:45:26,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-11-07 00:45:26,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 125. [2020-11-07 00:45:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-11-07 00:45:26,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2020-11-07 00:45:26,439 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 100 [2020-11-07 00:45:26,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:45:26,442 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2020-11-07 00:45:26,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 00:45:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2020-11-07 00:45:26,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-11-07 00:45:26,448 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:45:26,449 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, 1] [2020-11-07 00:45:26,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:45:26,449 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:45:26,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:45:26,450 INFO L82 PathProgramCache]: Analyzing trace with hash 339057124, now seen corresponding path program 1 times [2020-11-07 00:45:26,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:45:26,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2112690863] [2020-11-07 00:45:26,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:45:26,459 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:45:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:26,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:45:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:26,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:45:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:26,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-07 00:45:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:26,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 00:45:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:26,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 00:45:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:26,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:45:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:26,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-11-07 00:45:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:26,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-07 00:45:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:45:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 00:45:26,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2112690863] [2020-11-07 00:45:26,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:45:26,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:45:26,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852935383] [2020-11-07 00:45:26,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:45:26,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:45:26,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:45:26,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:45:26,775 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand 11 states. [2020-11-07 00:45:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:45:27,785 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2020-11-07 00:45:27,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:45:27,787 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2020-11-07 00:45:27,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:45:27,788 INFO L225 Difference]: With dead ends: 129 [2020-11-07 00:45:27,788 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:45:27,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-11-07 00:45:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:45:27,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:45:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:45:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:45:27,793 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2020-11-07 00:45:27,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:45:27,793 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:45:27,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:45:27,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:45:27,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:45:27,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:45:27,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:45:29,339 WARN L194 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-11-07 00:45:29,557 WARN L194 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 25 [2020-11-07 00:45:29,881 WARN L194 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 30 [2020-11-07 00:45:30,223 WARN L194 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-11-07 00:45:30,561 WARN L194 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2020-11-07 00:45:30,733 WARN L194 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 26 [2020-11-07 00:45:31,067 WARN L194 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-11-07 00:45:31,493 WARN L194 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-11-07 00:45:31,821 WARN L194 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-11-07 00:45:31,981 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 21 [2020-11-07 00:45:32,393 WARN L194 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-11-07 00:45:32,761 WARN L194 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 41 [2020-11-07 00:45:33,079 WARN L194 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-11-07 00:45:33,588 WARN L194 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-11-07 00:45:33,974 WARN L194 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-11-07 00:45:34,631 WARN L194 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-11-07 00:45:35,051 WARN L194 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 40 [2020-11-07 00:45:35,567 WARN L194 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-11-07 00:45:35,938 WARN L194 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2020-11-07 00:45:36,326 WARN L194 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2020-11-07 00:45:36,706 WARN L194 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2020-11-07 00:45:37,057 WARN L194 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-11-07 00:45:37,442 WARN L194 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2020-11-07 00:45:37,808 WARN L194 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2020-11-07 00:45:38,226 WARN L194 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2020-11-07 00:45:38,371 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 21 [2020-11-07 00:45:38,743 WARN L194 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-11-07 00:45:39,051 WARN L194 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-11-07 00:45:39,468 WARN L194 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2020-11-07 00:45:39,784 WARN L194 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-11-07 00:45:40,186 WARN L194 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2020-11-07 00:45:40,536 WARN L194 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2020-11-07 00:45:40,594 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 5) the Hoare annotation is: true [2020-11-07 00:45:40,594 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 5) the Hoare annotation is: true [2020-11-07 00:45:40,594 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 5) the Hoare annotation is: true [2020-11-07 00:45:40,595 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) the Hoare annotation is: true [2020-11-07 00:45:40,595 INFO L269 CegarLoopResult]: At program point L5-4(line 5) the Hoare annotation is: true [2020-11-07 00:45:40,595 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:45:40,595 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:45:40,595 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 5) the Hoare annotation is: true [2020-11-07 00:45:40,595 INFO L262 CegarLoopResult]: 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|)) [2020-11-07 00:45:40,595 INFO L269 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: true [2020-11-07 00:45:40,595 INFO L269 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: true [2020-11-07 00:45:40,596 INFO L269 CegarLoopResult]: At program point L5-2(line 5) the Hoare annotation is: true [2020-11-07 00:45:40,596 INFO L269 CegarLoopResult]: At program point L5-3(line 5) the Hoare annotation is: true [2020-11-07 00:45:40,596 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:45:40,596 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:45:40,596 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:45:40,596 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:45:40,596 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:45:40,596 INFO L269 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2020-11-07 00:45:40,596 INFO L269 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-11-07 00:45:40,596 INFO L269 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-11-07 00:45:40,596 INFO L269 CegarLoopResult]: At program point L8-3(lines 7 9) the Hoare annotation is: true [2020-11-07 00:45:40,596 INFO L269 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 7 9) the Hoare annotation is: true [2020-11-07 00:45:40,597 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 40 54) the Hoare annotation is: true [2020-11-07 00:45:40,597 INFO L269 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-11-07 00:45:40,597 INFO L262 CegarLoopResult]: 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))) [2020-11-07 00:45:40,597 INFO L269 CegarLoopResult]: At program point L50-1(line 50) the Hoare annotation is: true [2020-11-07 00:45:40,597 INFO L262 CegarLoopResult]: 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|)))) [2020-11-07 00:45:40,597 INFO L262 CegarLoopResult]: 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))) [2020-11-07 00:45:40,597 INFO L262 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-11-07 00:45:40,598 INFO L262 CegarLoopResult]: 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))) [2020-11-07 00:45:40,598 INFO L262 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc17.base|)) [2020-11-07 00:45:40,598 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 40 54) the Hoare annotation is: true [2020-11-07 00:45:40,598 INFO L262 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:45:40,599 INFO L262 CegarLoopResult]: At program point L42-1(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:45:40,599 INFO L262 CegarLoopResult]: At program point mainENTRY(lines 40 54) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:45:40,599 INFO L262 CegarLoopResult]: 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))) [2020-11-07 00:45:40,599 INFO L262 CegarLoopResult]: 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))) [2020-11-07 00:45:40,600 INFO L262 CegarLoopResult]: 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|)))) [2020-11-07 00:45:40,600 INFO L262 CegarLoopResult]: 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))) [2020-11-07 00:45:40,600 INFO L262 CegarLoopResult]: 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|)))) [2020-11-07 00:45:40,600 INFO L262 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:45:40,600 INFO L262 CegarLoopResult]: 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|)))) [2020-11-07 00:45:40,601 INFO L262 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:45:40,601 INFO L262 CegarLoopResult]: 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|)))) [2020-11-07 00:45:40,601 INFO L262 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:45:40,601 INFO L262 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:45:40,601 INFO L262 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:45:40,602 INFO L262 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:45:40,602 INFO L262 CegarLoopResult]: 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)))) [2020-11-07 00:45:40,602 INFO L262 CegarLoopResult]: 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)))) [2020-11-07 00:45:40,602 INFO L269 CegarLoopResult]: At program point checkENTRY(lines 16 38) the Hoare annotation is: true [2020-11-07 00:45:40,603 INFO L262 CegarLoopResult]: 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)))) [2020-11-07 00:45:40,603 INFO L262 CegarLoopResult]: 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)))) [2020-11-07 00:45:40,603 INFO L262 CegarLoopResult]: 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)))) [2020-11-07 00:45:40,603 INFO L262 CegarLoopResult]: 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))) [2020-11-07 00:45:40,603 INFO L262 CegarLoopResult]: 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)))) [2020-11-07 00:45:40,604 INFO L262 CegarLoopResult]: 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))) [2020-11-07 00:45:40,604 INFO L262 CegarLoopResult]: 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))) [2020-11-07 00:45:40,604 INFO L262 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or .cse0 (and .cse1 .cse2 .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse4)))) [2020-11-07 00:45:40,604 INFO L262 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or .cse0 (and .cse1 .cse2 .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse4)))) [2020-11-07 00:45:40,604 INFO L262 CegarLoopResult]: 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)))) [2020-11-07 00:45:40,604 INFO L262 CegarLoopResult]: 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))) [2020-11-07 00:45:40,605 INFO L262 CegarLoopResult]: 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))))) [2020-11-07 00:45:40,605 INFO L262 CegarLoopResult]: 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 (or (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2 .cse3 .cse4))))) [2020-11-07 00:45:40,605 INFO L262 CegarLoopResult]: 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)) (.cse4 (= check_~ai~0 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4 .cse5)) (or .cse0 (and .cse2 (or (let ((.cse6 (+ check_~y 1))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse3 .cse4 .cse5) (not (= |check_#in~x| 0)) .cse1)))) [2020-11-07 00:45:40,605 INFO L262 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or .cse0 (and .cse1 .cse2 .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse4)))) [2020-11-07 00:45:40,606 INFO L262 CegarLoopResult]: At program point L26-1(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 (= |check_#t~mem8| 0)) (.cse3 (<= .cse7 |check_#in~n|)) (.cse4 (<= .cse7 check_~n)) (.cse5 (= (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 .cse4 .cse5 (= check_~x 0))) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse1)))) [2020-11-07 00:45:40,606 INFO L262 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or .cse0 (and .cse1 .cse2 .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse4)))) [2020-11-07 00:45:40,606 INFO L262 CegarLoopResult]: At program point L26-2(lines 26 27) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse6 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse1 (= |check_#t~mem8| 0)) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= |check_#t~mem9| 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse6) (or .cse0 (not (= |check_#in~x| 0)) .cse6 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= check_~x 0)))))) [2020-11-07 00:45:40,606 INFO L262 CegarLoopResult]: At program point L26-3(line 26) the Hoare annotation is: (let ((.cse4 (= |check_#in~x| 0)) (.cse1 (<= 1 |check_#in~x|)) (.cse9 ((as const (Array Int Int)) 0)) (.cse5 (<= (+ |check_#in~y| 1) |check_#in~n|))) (let ((.cse0 (not .cse5)) (.cse2 (not (= (select |#memory_int| |check_#in~a.base|) .cse9))) (.cse3 (and (let ((.cse8 (+ check_~y 1))) (let ((.cse6 (<= .cse8 |check_#in~n|)) (.cse7 (<= .cse8 check_~n))) (or (and .cse5 .cse4 .cse6 .cse7 (= check_~x 0)) (and .cse5 .cse6 .cse7 .cse1 (<= 1 check_~x))))) (= |check_#t~mem8| 0) (= |check_#t~mem9| 0) (= (select |#memory_int| check_~a.base) .cse9)))) (and (or .cse0 (not .cse1) .cse2 .cse3) (or .cse0 (not .cse4) .cse2 .cse3)))) [2020-11-07 00:45:40,606 INFO L262 CegarLoopResult]: At program point L26-4(line 26) the Hoare annotation is: (let ((.cse4 (= |check_#in~x| 0)) (.cse1 (<= 1 |check_#in~x|)) (.cse9 ((as const (Array Int Int)) 0)) (.cse5 (<= (+ |check_#in~y| 1) |check_#in~n|))) (let ((.cse0 (not .cse5)) (.cse2 (not (= (select |#memory_int| |check_#in~a.base|) .cse9))) (.cse3 (and (let ((.cse8 (+ check_~y 1))) (let ((.cse6 (<= .cse8 |check_#in~n|)) (.cse7 (<= .cse8 check_~n))) (or (and .cse5 .cse4 .cse6 .cse7 (= check_~x 0)) (and .cse5 .cse6 .cse7 .cse1 (<= 1 check_~x))))) (= (select |#memory_int| check_~a.base) .cse9)))) (and (or .cse0 (not .cse1) .cse2 .cse3) (or .cse0 (not .cse4) .cse2 .cse3)))) [2020-11-07 00:45:40,607 INFO L262 CegarLoopResult]: At program point L26-5(line 26) the Hoare annotation is: (let ((.cse4 (= |check_#in~x| 0)) (.cse1 (<= 1 |check_#in~x|)) (.cse9 ((as const (Array Int Int)) 0)) (.cse5 (<= (+ |check_#in~y| 1) |check_#in~n|))) (let ((.cse0 (not .cse5)) (.cse2 (not (= (select |#memory_int| |check_#in~a.base|) .cse9))) (.cse3 (and (let ((.cse8 (+ check_~y 1))) (let ((.cse6 (<= .cse8 |check_#in~n|)) (.cse7 (<= .cse8 check_~n))) (or (and .cse5 .cse4 .cse6 .cse7 (= check_~x 0)) (and .cse5 .cse6 .cse7 .cse1 (<= 1 check_~x))))) (= (select |#memory_int| check_~a.base) .cse9)))) (and (or .cse0 (not .cse1) .cse2 .cse3) (or .cse0 (not .cse4) .cse2 .cse3)))) [2020-11-07 00:45:40,607 INFO L262 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or .cse0 (and .cse1 .cse2 .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse4)))) [2020-11-07 00:45:40,607 INFO L262 CegarLoopResult]: At program point L26-6(line 26) the Hoare annotation is: (let ((.cse1 (<= 1 |check_#in~x|)) (.cse4 (= |check_#in~x| 0)) (.cse5 ((as const (Array Int Int)) 0)) (.cse6 (<= (+ |check_#in~y| 1) |check_#in~n|))) (let ((.cse0 (not .cse6)) (.cse2 (not (= (select |#memory_int| |check_#in~a.base|) .cse5))) (.cse3 (and (= (select |#memory_int| check_~a.base) .cse5) (let ((.cse9 (+ check_~y 1))) (let ((.cse7 (<= .cse9 |check_#in~n|)) (.cse8 (<= .cse9 check_~n))) (or (and .cse6 .cse7 (<= 1 |check_#t~post10|) .cse8 .cse1 (<= 1 check_~x)) (and .cse6 .cse4 .cse7 .cse8 (= |check_#t~post10| 0) (= check_~x 0)))))))) (and (or .cse0 (not .cse1) .cse2 .cse3) (or .cse0 (not .cse4) .cse2 .cse3)))) [2020-11-07 00:45:40,607 INFO L262 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or .cse0 (and .cse1 .cse2 .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse4)))) [2020-11-07 00:45:40,607 INFO L262 CegarLoopResult]: At program point L26-7(line 26) the Hoare annotation is: (let ((.cse4 (= |check_#in~x| 0)) (.cse1 (<= 1 |check_#in~x|)) (.cse5 ((as const (Array Int Int)) 0)) (.cse6 (<= (+ |check_#in~y| 1) |check_#in~n|))) (let ((.cse0 (not .cse6)) (.cse2 (not (= (select |#memory_int| |check_#in~a.base|) .cse5))) (.cse3 (and (= (select |#memory_int| check_~a.base) .cse5) (let ((.cse9 (+ check_~y 1))) (let ((.cse7 (<= .cse9 |check_#in~n|)) (.cse8 (<= .cse9 check_~n))) (or (and .cse6 .cse4 .cse7 .cse8 (= |check_#t~post10| 0) (<= 1 check_~x)) (and .cse6 .cse7 (<= 1 |check_#t~post10|) .cse8 (<= 2 check_~x) .cse1))))))) (and (or .cse0 (not .cse1) .cse2 .cse3) (or .cse0 (not .cse4) .cse2 .cse3)))) [2020-11-07 00:45:40,608 INFO L262 CegarLoopResult]: 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))) [2020-11-07 00:45:40,608 INFO L262 CegarLoopResult]: 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))) [2020-11-07 00:45:40,608 INFO L262 CegarLoopResult]: 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 (not (= |check_#in~x| 0)) .cse1 (= check_~x 0)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (<= 1 check_~x)))) [2020-11-07 00:45:40,608 INFO L262 CegarLoopResult]: 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))) [2020-11-07 00:45:40,608 INFO L262 CegarLoopResult]: At program point L16-1(lines 16 38) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= (+ check_~y 1) |check_#in~n|)) (.cse2 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (and .cse1 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse2) (or .cse0 (and .cse1 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse2))) [2020-11-07 00:45:40,609 INFO L262 CegarLoopResult]: 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 ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 2 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (= |check_#in~x| 0)) .cse4)))) [2020-11-07 00:45:40,609 INFO L262 CegarLoopResult]: At program point L16-2(lines 16 38) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= (+ check_~y 1) |check_#in~n|)) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (and .cse1 .cse2 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse3) (or .cse0 (and .cse1 .cse2 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse3)))) [2020-11-07 00:45:40,609 INFO L262 CegarLoopResult]: At program point L16-3(lines 16 38) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= (+ check_~y 1) |check_#in~n|)) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (and .cse1 .cse2 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse3) (or .cse0 (and .cse1 .cse2 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse3)))) [2020-11-07 00:45:40,609 INFO L262 CegarLoopResult]: 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)))) [2020-11-07 00:45:40,610 INFO L262 CegarLoopResult]: 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)))) [2020-11-07 00:45:40,610 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2020-11-07 00:45:40,610 INFO L262 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 00:45:40,610 INFO L262 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 00:45:40,610 INFO L262 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 00:45:40,610 INFO L262 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 00:45:40,610 INFO L262 CegarLoopResult]: At program point L11-4(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 00:45:40,611 INFO L262 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-11-07 00:45:40,611 INFO L262 CegarLoopResult]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-11-07 00:45:40,611 INFO L262 CegarLoopResult]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-11-07 00:45:40,635 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:238) 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:797) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:240) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:149) 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) [2020-11-07 00:45:40,642 INFO L168 Benchmark]: Toolchain (without parser) took 37017.99 ms. Allocated memory was 160.4 MB in the beginning and 231.7 MB in the end (delta: 71.3 MB). Free memory was 137.2 MB in the beginning and 135.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 134.3 MB. Max. memory is 8.0 GB. [2020-11-07 00:45:40,643 INFO L168 Benchmark]: CDTParser took 1.05 ms. Allocated memory is still 160.4 MB. Free memory was 135.1 MB in the beginning and 135.0 MB in the end (delta: 117.5 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:45:40,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.21 ms. Allocated memory is still 160.4 MB. Free memory was 136.6 MB in the beginning and 126.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:45:40,650 INFO L168 Benchmark]: Boogie Preprocessor took 43.27 ms. Allocated memory is still 160.4 MB. Free memory was 126.6 MB in the beginning and 124.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:45:40,654 INFO L168 Benchmark]: RCFGBuilder took 628.24 ms. Allocated memory is still 160.4 MB. Free memory was 124.9 MB in the beginning and 135.4 MB in the end (delta: -10.5 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. [2020-11-07 00:45:40,655 INFO L168 Benchmark]: TraceAbstraction took 36052.62 ms. Allocated memory was 160.4 MB in the beginning and 231.7 MB in the end (delta: 71.3 MB). Free memory was 134.8 MB in the beginning and 135.9 MB in the end (delta: -1.0 MB). Peak memory consumption was 130.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:45:40,662 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.05 ms. Allocated memory is still 160.4 MB. Free memory was 135.1 MB in the beginning and 135.0 MB in the end (delta: 117.5 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 280.21 ms. Allocated memory is still 160.4 MB. Free memory was 136.6 MB in the beginning and 126.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.27 ms. Allocated memory is still 160.4 MB. Free memory was 126.6 MB in the beginning and 124.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 628.24 ms. Allocated memory is still 160.4 MB. Free memory was 124.9 MB in the beginning and 135.4 MB in the end (delta: -10.5 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 36052.62 ms. Allocated memory was 160.4 MB in the beginning and 231.7 MB in the end (delta: 71.3 MB). Free memory was 134.8 MB in the beginning and 135.9 MB in the end (delta: -1.0 MB). Peak memory consumption was 130.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 5]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - 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:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...