/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-36cd7be [2021-02-24 00:17:38,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-24 00:17:38,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-24 00:17:38,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-24 00:17:38,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-24 00:17:38,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-24 00:17:38,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-24 00:17:38,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-24 00:17:38,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-24 00:17:38,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-24 00:17:38,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-24 00:17:38,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-24 00:17:38,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-24 00:17:38,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-24 00:17:38,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-24 00:17:38,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-24 00:17:38,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-24 00:17:38,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-24 00:17:38,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-24 00:17:38,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-24 00:17:38,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-24 00:17:38,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-24 00:17:38,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-24 00:17:38,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-24 00:17:38,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-24 00:17:38,570 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-24 00:17:38,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-24 00:17:38,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-24 00:17:38,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-24 00:17:38,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-24 00:17:38,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-24 00:17:38,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-24 00:17:38,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-24 00:17:38,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-24 00:17:38,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-24 00:17:38,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-24 00:17:38,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-24 00:17:38,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-24 00:17:38,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-24 00:17:38,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-24 00:17:38,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-24 00:17:38,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-24 00:17:38,597 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-24 00:17:38,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-24 00:17:38,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-24 00:17:38,599 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-24 00:17:38,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-24 00:17:38,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-24 00:17:38,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-24 00:17:38,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-24 00:17:38,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-24 00:17:38,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-24 00:17:38,601 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-24 00:17:38,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-24 00:17:38,602 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-24 00:17:38,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-24 00:17:38,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-24 00:17:38,603 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-24 00:17:38,603 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-24 00:17:38,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-24 00:17:38,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-24 00:17:38,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-24 00:17:38,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-24 00:17:38,605 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-24 00:17:38,605 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2021-02-24 00:17:39,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-24 00:17:39,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-24 00:17:39,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-24 00:17:39,061 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-24 00:17:39,062 INFO L275 PluginConnector]: CDTParser initialized [2021-02-24 00:17:39,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2021-02-24 00:17:39,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19dba30e6/f9a7806dac0d4b97ba2de4a1a3a1d7e7/FLAG6af35a238 [2021-02-24 00:17:39,834 INFO L306 CDTParser]: Found 1 translation units. [2021-02-24 00:17:39,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2021-02-24 00:17:39,845 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19dba30e6/f9a7806dac0d4b97ba2de4a1a3a1d7e7/FLAG6af35a238 [2021-02-24 00:17:40,163 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19dba30e6/f9a7806dac0d4b97ba2de4a1a3a1d7e7 [2021-02-24 00:17:40,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-24 00:17:40,179 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-24 00:17:40,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-24 00:17:40,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-24 00:17:40,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-24 00:17:40,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:17:40" (1/1) ... [2021-02-24 00:17:40,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@797959b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:17:40, skipping insertion in model container [2021-02-24 00:17:40,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:17:40" (1/1) ... [2021-02-24 00:17:40,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-24 00:17:40,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-24 00:17:40,388 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1126,1139] [2021-02-24 00:17:40,408 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1880,1893] [2021-02-24 00:17:40,422 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[2415,2428] [2021-02-24 00:17:40,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-24 00:17:40,449 INFO L203 MainTranslator]: Completed pre-run [2021-02-24 00:17:40,490 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1126,1139] [2021-02-24 00:17:40,503 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1880,1893] [2021-02-24 00:17:40,516 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[2415,2428] [2021-02-24 00:17:40,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-24 00:17:40,563 INFO L208 MainTranslator]: Completed translation [2021-02-24 00:17:40,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:17:40 WrapperNode [2021-02-24 00:17:40,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-24 00:17:40,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-24 00:17:40,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-24 00:17:40,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-24 00:17:40,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:17:40" (1/1) ... [2021-02-24 00:17:40,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:17:40" (1/1) ... [2021-02-24 00:17:40,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:17:40" (1/1) ... [2021-02-24 00:17:40,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:17:40" (1/1) ... [2021-02-24 00:17:40,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:17:40" (1/1) ... [2021-02-24 00:17:40,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:17:40" (1/1) ... [2021-02-24 00:17:40,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:17:40" (1/1) ... [2021-02-24 00:17:40,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-24 00:17:40,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-24 00:17:40,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-24 00:17:40,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-24 00:17:40,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:17:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-24 00:17:40,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-24 00:17:40,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-24 00:17:40,809 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-24 00:17:40,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-02-24 00:17:40,810 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-24 00:17:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-24 00:17:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-24 00:17:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-24 00:17:40,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-24 00:17:40,812 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-02-24 00:17:40,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-02-24 00:17:40,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2021-02-24 00:17:40,813 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-24 00:17:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-24 00:17:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-24 00:17:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-24 00:17:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-24 00:17:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-24 00:17:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-24 00:17:41,475 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-24 00:17:41,475 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-02-24 00:17:41,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:17:41 BoogieIcfgContainer [2021-02-24 00:17:41,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-24 00:17:41,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-24 00:17:41,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-24 00:17:41,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-24 00:17:41,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 12:17:40" (1/3) ... [2021-02-24 00:17:41,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f435b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:17:41, skipping insertion in model container [2021-02-24 00:17:41,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:17:40" (2/3) ... [2021-02-24 00:17:41,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f435b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:17:41, skipping insertion in model container [2021-02-24 00:17:41,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:17:41" (3/3) ... [2021-02-24 00:17:41,487 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2021-02-24 00:17:41,494 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-24 00:17:41,500 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2021-02-24 00:17:41,521 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-02-24 00:17:41,549 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-24 00:17:41,549 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-24 00:17:41,549 INFO L378 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2021-02-24 00:17:41,549 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-24 00:17:41,550 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-24 00:17:41,550 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-24 00:17:41,550 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-24 00:17:41,550 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-24 00:17:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2021-02-24 00:17:41,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-02-24 00:17:41,580 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:17:41,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:17:41,582 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:17:41,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:17:41,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1631991453, now seen corresponding path program 1 times [2021-02-24 00:17:41,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:17:41,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [24452701] [2021-02-24 00:17:41,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:17:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:41,820 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:41,822 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:41,826 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:41,827 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 00:17:41,842 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:41,843 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:41,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:17:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:41,906 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:41,907 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:41,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:17:41,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [24452701] [2021-02-24 00:17:41,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:17:41,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-24 00:17:41,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828022828] [2021-02-24 00:17:41,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-24 00:17:41,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:17:41,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-24 00:17:41,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 00:17:41,949 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 4 states. [2021-02-24 00:17:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:17:42,301 INFO L93 Difference]: Finished difference Result 215 states and 241 transitions. [2021-02-24 00:17:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-24 00:17:42,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2021-02-24 00:17:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:17:42,315 INFO L225 Difference]: With dead ends: 215 [2021-02-24 00:17:42,316 INFO L226 Difference]: Without dead ends: 115 [2021-02-24 00:17:42,320 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 00:17:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-02-24 00:17:42,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 81. [2021-02-24 00:17:42,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2021-02-24 00:17:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2021-02-24 00:17:42,378 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 35 [2021-02-24 00:17:42,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:17:42,379 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2021-02-24 00:17:42,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-24 00:17:42,379 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2021-02-24 00:17:42,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-02-24 00:17:42,381 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:17:42,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:17:42,382 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-24 00:17:42,382 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:17:42,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:17:42,383 INFO L82 PathProgramCache]: Analyzing trace with hash 510759303, now seen corresponding path program 1 times [2021-02-24 00:17:42,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:17:42,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2032231334] [2021-02-24 00:17:42,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:17:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:42,485 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:42,488 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:42,489 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:42,490 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:17:42,497 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:42,498 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:17:42,505 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:42,507 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:17:42,513 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:42,513 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:42,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:17:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:42,610 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:42,612 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:17:42,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2032231334] [2021-02-24 00:17:42,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:17:42,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-02-24 00:17:42,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734382099] [2021-02-24 00:17:42,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-02-24 00:17:42,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:17:42,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-02-24 00:17:42,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-02-24 00:17:42,627 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 6 states. [2021-02-24 00:17:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:17:42,937 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2021-02-24 00:17:42,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-02-24 00:17:42,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2021-02-24 00:17:42,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:17:42,940 INFO L225 Difference]: With dead ends: 132 [2021-02-24 00:17:42,940 INFO L226 Difference]: Without dead ends: 130 [2021-02-24 00:17:42,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-02-24 00:17:42,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-02-24 00:17:42,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 86. [2021-02-24 00:17:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2021-02-24 00:17:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2021-02-24 00:17:42,972 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 36 [2021-02-24 00:17:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:17:42,972 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2021-02-24 00:17:42,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-02-24 00:17:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2021-02-24 00:17:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-02-24 00:17:42,974 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:17:42,974 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:17:42,975 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-24 00:17:42,975 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:17:42,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:17:42,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2004335176, now seen corresponding path program 1 times [2021-02-24 00:17:42,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:17:42,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1111498817] [2021-02-24 00:17:42,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:17:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:43,017 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:43,018 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:43,019 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:43,020 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 00:17:43,024 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:43,024 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:43,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:17:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:43,091 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:43,095 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:17:43,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1111498817] [2021-02-24 00:17:43,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:17:43,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-24 00:17:43,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460762259] [2021-02-24 00:17:43,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-24 00:17:43,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:17:43,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-24 00:17:43,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 00:17:43,105 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 4 states. [2021-02-24 00:17:43,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:17:43,313 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2021-02-24 00:17:43,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-24 00:17:43,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2021-02-24 00:17:43,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:17:43,315 INFO L225 Difference]: With dead ends: 162 [2021-02-24 00:17:43,316 INFO L226 Difference]: Without dead ends: 111 [2021-02-24 00:17:43,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 00:17:43,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-02-24 00:17:43,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 78. [2021-02-24 00:17:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2021-02-24 00:17:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2021-02-24 00:17:43,329 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 36 [2021-02-24 00:17:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:17:43,330 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2021-02-24 00:17:43,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-24 00:17:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2021-02-24 00:17:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-02-24 00:17:43,331 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:17:43,332 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:17:43,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-24 00:17:43,332 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:17:43,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:17:43,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1679437122, now seen corresponding path program 1 times [2021-02-24 00:17:43,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:17:43,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [17390469] [2021-02-24 00:17:43,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:17:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:43,385 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:43,385 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:43,386 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:43,386 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:17:43,390 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:43,390 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:43,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:17:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:43,429 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:43,430 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:17:43,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [17390469] [2021-02-24 00:17:43,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:17:43,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-24 00:17:43,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358616766] [2021-02-24 00:17:43,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-24 00:17:43,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:17:43,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-24 00:17:43,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 00:17:43,436 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 4 states. [2021-02-24 00:17:43,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:17:43,591 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2021-02-24 00:17:43,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-24 00:17:43,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2021-02-24 00:17:43,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:17:43,593 INFO L225 Difference]: With dead ends: 106 [2021-02-24 00:17:43,594 INFO L226 Difference]: Without dead ends: 89 [2021-02-24 00:17:43,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 00:17:43,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-02-24 00:17:43,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2021-02-24 00:17:43,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2021-02-24 00:17:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2021-02-24 00:17:43,606 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 38 [2021-02-24 00:17:43,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:17:43,607 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2021-02-24 00:17:43,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-24 00:17:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2021-02-24 00:17:43,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-02-24 00:17:43,609 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:17:43,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:17:43,610 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-24 00:17:43,610 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:17:43,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:17:43,611 INFO L82 PathProgramCache]: Analyzing trace with hash 2146049076, now seen corresponding path program 1 times [2021-02-24 00:17:43,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:17:43,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1083477250] [2021-02-24 00:17:43,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:17:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:43,738 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:43,740 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:43,741 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:43,742 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:17:43,752 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:43,753 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-02-24 00:17:43,764 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:43,766 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-02-24 00:17:43,782 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:43,783 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-02-24 00:17:43,799 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:43,800 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 00:17:43,801 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:43,801 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:43,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:17:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:43,849 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:43,850 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:17:43,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1083477250] [2021-02-24 00:17:43,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:17:43,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-02-24 00:17:43,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950087336] [2021-02-24 00:17:43,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-02-24 00:17:43,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:17:43,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-02-24 00:17:43,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-02-24 00:17:43,865 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 6 states. [2021-02-24 00:17:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:17:44,139 INFO L93 Difference]: Finished difference Result 186 states and 194 transitions. [2021-02-24 00:17:44,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-02-24 00:17:44,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2021-02-24 00:17:44,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:17:44,145 INFO L225 Difference]: With dead ends: 186 [2021-02-24 00:17:44,145 INFO L226 Difference]: Without dead ends: 144 [2021-02-24 00:17:44,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-02-24 00:17:44,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-02-24 00:17:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 92. [2021-02-24 00:17:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2021-02-24 00:17:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2021-02-24 00:17:44,181 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 57 [2021-02-24 00:17:44,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:17:44,181 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2021-02-24 00:17:44,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-02-24 00:17:44,181 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2021-02-24 00:17:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-02-24 00:17:44,183 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:17:44,184 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:17:44,184 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-24 00:17:44,184 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:17:44,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:17:44,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2038639544, now seen corresponding path program 1 times [2021-02-24 00:17:44,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:17:44,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1114829972] [2021-02-24 00:17:44,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:17:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:44,268 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:44,269 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:44,269 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:44,270 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:17:44,273 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:44,274 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:17:44,278 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:44,279 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:17:44,284 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:44,285 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:44,285 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:44,286 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:17:44,292 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:44,293 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:17:44,302 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:44,303 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:17:44,312 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:44,313 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:44,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:17:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:44,403 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:44,404 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:17:44,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1114829972] [2021-02-24 00:17:44,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:17:44,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-24 00:17:44,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790615074] [2021-02-24 00:17:44,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-24 00:17:44,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:17:44,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-24 00:17:44,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-02-24 00:17:44,422 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 9 states. [2021-02-24 00:17:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:17:44,873 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2021-02-24 00:17:44,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-02-24 00:17:44,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2021-02-24 00:17:44,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:17:44,878 INFO L225 Difference]: With dead ends: 162 [2021-02-24 00:17:44,878 INFO L226 Difference]: Without dead ends: 160 [2021-02-24 00:17:44,879 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-02-24 00:17:44,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-02-24 00:17:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 97. [2021-02-24 00:17:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2021-02-24 00:17:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2021-02-24 00:17:44,894 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 58 [2021-02-24 00:17:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:17:44,894 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2021-02-24 00:17:44,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-24 00:17:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2021-02-24 00:17:44,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-02-24 00:17:44,896 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:17:44,896 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:17:44,896 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-24 00:17:44,896 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:17:44,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:17:44,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1267812039, now seen corresponding path program 1 times [2021-02-24 00:17:44,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:17:44,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1670394829] [2021-02-24 00:17:44,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:17:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:44,954 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:44,955 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:44,955 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:44,956 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:17:44,959 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:44,960 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-02-24 00:17:44,976 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:44,977 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-02-24 00:17:44,987 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:44,988 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-02-24 00:17:45,001 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:45,002 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-24 00:17:45,005 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:45,005 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:45,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:17:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:45,047 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:45,047 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:17:45,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1670394829] [2021-02-24 00:17:45,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:17:45,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-02-24 00:17:45,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744953934] [2021-02-24 00:17:45,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-02-24 00:17:45,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:17:45,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-02-24 00:17:45,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-02-24 00:17:45,059 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 6 states. [2021-02-24 00:17:45,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:17:45,340 INFO L93 Difference]: Finished difference Result 174 states and 181 transitions. [2021-02-24 00:17:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-02-24 00:17:45,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2021-02-24 00:17:45,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:17:45,342 INFO L225 Difference]: With dead ends: 174 [2021-02-24 00:17:45,342 INFO L226 Difference]: Without dead ends: 127 [2021-02-24 00:17:45,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-02-24 00:17:45,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-02-24 00:17:45,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 97. [2021-02-24 00:17:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2021-02-24 00:17:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2021-02-24 00:17:45,363 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 58 [2021-02-24 00:17:45,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:17:45,363 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2021-02-24 00:17:45,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-02-24 00:17:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2021-02-24 00:17:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-02-24 00:17:45,365 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:17:45,365 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:17:45,365 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-24 00:17:45,365 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:17:45,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:17:45,366 INFO L82 PathProgramCache]: Analyzing trace with hash -742105895, now seen corresponding path program 1 times [2021-02-24 00:17:45,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:17:45,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1262725089] [2021-02-24 00:17:45,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:17:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:45,640 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:45,641 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:45,642 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:45,643 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-02-24 00:17:45,655 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:45,656 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-02-24 00:17:45,677 WARN L141 QuantifierPusher]: treesize reduction 9, result has 85.0 percent of original size [2021-02-24 00:17:45,679 WARN L147 QuantifierPusher]: treesize reduction 9, result has 85.0 percent of original size 51 [2021-02-24 00:17:45,712 WARN L141 QuantifierPusher]: treesize reduction 102, result has 39.6 percent of original size [2021-02-24 00:17:45,713 WARN L147 QuantifierPusher]: treesize reduction 102, result has 39.6 percent of original size 67 [2021-02-24 00:17:45,764 WARN L141 QuantifierPusher]: treesize reduction 179, result has 31.7 percent of original size [2021-02-24 00:17:45,770 WARN L147 QuantifierPusher]: treesize reduction 179, result has 31.7 percent of original size 83 [2021-02-24 00:17:45,829 WARN L141 QuantifierPusher]: treesize reduction 370, result has 23.9 percent of original size [2021-02-24 00:17:45,834 WARN L147 QuantifierPusher]: treesize reduction 370, result has 23.9 percent of original size 116 [2021-02-24 00:17:45,914 WARN L141 QuantifierPusher]: treesize reduction 656, result has 49.8 percent of original size [2021-02-24 00:17:45,931 WARN L147 QuantifierPusher]: treesize reduction 656, result has 49.8 percent of original size 651 [2021-02-24 00:17:46,104 WARN L202 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 44 [2021-02-24 00:17:46,116 WARN L141 QuantifierPusher]: treesize reduction 63, result has 87.3 percent of original size [2021-02-24 00:17:46,121 WARN L147 QuantifierPusher]: treesize reduction 63, result has 87.3 percent of original size 434 [2021-02-24 00:17:46,362 WARN L202 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2021-02-24 00:17:46,370 WARN L141 QuantifierPusher]: treesize reduction 53, result has 89.1 percent of original size [2021-02-24 00:17:46,375 WARN L147 QuantifierPusher]: treesize reduction 53, result has 89.1 percent of original size 433 [2021-02-24 00:17:46,509 WARN L202 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2021-02-24 00:17:46,517 WARN L141 QuantifierPusher]: treesize reduction 43, result has 88.5 percent of original size [2021-02-24 00:17:46,519 WARN L147 QuantifierPusher]: treesize reduction 43, result has 88.5 percent of original size 331 [2021-02-24 00:17:46,643 WARN L141 QuantifierPusher]: treesize reduction 21, result has 82.8 percent of original size [2021-02-24 00:17:46,645 WARN L147 QuantifierPusher]: treesize reduction 21, result has 82.8 percent of original size 101 [2021-02-24 00:17:46,689 WARN L141 QuantifierPusher]: treesize reduction 32, result has 67.3 percent of original size [2021-02-24 00:17:46,690 WARN L147 QuantifierPusher]: treesize reduction 32, result has 67.3 percent of original size 66 [2021-02-24 00:17:46,736 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:46,736 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:17:46,757 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:46,758 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:17:46,781 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:46,782 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:46,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:17:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:46,845 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:46,845 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:17:46,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1262725089] [2021-02-24 00:17:46,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:17:46,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-02-24 00:17:46,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014056614] [2021-02-24 00:17:46,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-02-24 00:17:46,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:17:46,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-02-24 00:17:46,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2021-02-24 00:17:46,885 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 17 states. [2021-02-24 00:17:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:17:48,322 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2021-02-24 00:17:48,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-02-24 00:17:48,323 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2021-02-24 00:17:48,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:17:48,324 INFO L225 Difference]: With dead ends: 152 [2021-02-24 00:17:48,324 INFO L226 Difference]: Without dead ends: 105 [2021-02-24 00:17:48,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2021-02-24 00:17:48,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-02-24 00:17:48,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2021-02-24 00:17:48,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2021-02-24 00:17:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2021-02-24 00:17:48,345 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 60 [2021-02-24 00:17:48,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:17:48,345 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2021-02-24 00:17:48,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-02-24 00:17:48,346 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2021-02-24 00:17:48,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-02-24 00:17:48,347 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:17:48,347 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:17:48,347 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-24 00:17:48,347 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:17:48,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:17:48,348 INFO L82 PathProgramCache]: Analyzing trace with hash -582759126, now seen corresponding path program 1 times [2021-02-24 00:17:48,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:17:48,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1163658898] [2021-02-24 00:17:48,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:17:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:48,429 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:48,430 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:48,431 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:48,431 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:17:48,434 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:48,435 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-02-24 00:17:48,443 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:48,444 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-02-24 00:17:48,460 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:48,461 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-02-24 00:17:48,477 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:48,481 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-02-24 00:17:48,498 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:48,499 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-02-24 00:17:48,521 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:48,522 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-02-24 00:17:48,546 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:48,546 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:48,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:17:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:17:48,589 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:17:48,590 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:17:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:17:48,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1163658898] [2021-02-24 00:17:48,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-24 00:17:48,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-02-24 00:17:48,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507663851] [2021-02-24 00:17:48,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-02-24 00:17:48,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:17:48,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-02-24 00:17:48,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-02-24 00:17:48,615 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 8 states. [2021-02-24 00:17:51,279 WARN L202 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2021-02-24 00:17:52,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:17:52,054 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2021-02-24 00:17:52,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-02-24 00:17:52,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2021-02-24 00:17:52,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:17:52,056 INFO L225 Difference]: With dead ends: 100 [2021-02-24 00:17:52,056 INFO L226 Difference]: Without dead ends: 0 [2021-02-24 00:17:52,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-02-24 00:17:52,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-24 00:17:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-24 00:17:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-24 00:17:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-24 00:17:52,058 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2021-02-24 00:17:52,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:17:52,058 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-24 00:17:52,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-02-24 00:17:52,058 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-24 00:17:52,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-24 00:17:52,058 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-24 00:17:52,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-24 00:17:52,723 WARN L202 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2021-02-24 00:17:53,090 WARN L202 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 28 [2021-02-24 00:17:53,502 WARN L202 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2021-02-24 00:17:53,683 WARN L202 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2021-02-24 00:17:53,943 WARN L202 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2021-02-24 00:17:54,288 WARN L202 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2021-02-24 00:17:54,544 WARN L202 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2021-02-24 00:17:55,713 WARN L202 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2021-02-24 00:17:56,002 WARN L202 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2021-02-24 00:17:56,208 WARN L202 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-02-24 00:17:56,784 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-02-24 00:17:56,784 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-02-24 00:17:56,784 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-02-24 00:17:56,785 INFO L192 CegarLoopUtils]: At program point L4-3(line 4) the Hoare annotation is: true [2021-02-24 00:17:56,785 INFO L192 CegarLoopUtils]: At program point L4-4(line 4) the Hoare annotation is: true [2021-02-24 00:17:56,785 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-24 00:17:56,785 INFO L192 CegarLoopUtils]: At program point L4-5(line 4) the Hoare annotation is: true [2021-02-24 00:17:56,785 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-24 00:17:56,785 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-02-24 00:17:56,785 INFO L192 CegarLoopUtils]: At program point L13(line 13) the Hoare annotation is: true [2021-02-24 00:17:56,786 INFO L192 CegarLoopUtils]: At program point L12(line 12) the Hoare annotation is: true [2021-02-24 00:17:56,786 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= ~__return_136~0 |old(~__return_136~0)|) (= |old(#valid)| |#valid|) (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string4.base| |old(#t~string4.base)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |#NULL.base| |old(#NULL.base)|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2021-02-24 00:17:56,786 INFO L192 CegarLoopUtils]: At program point L4(line 4) the Hoare annotation is: true [2021-02-24 00:17:56,786 INFO L192 CegarLoopUtils]: At program point L4-1(line 4) the Hoare annotation is: true [2021-02-24 00:17:56,787 INFO L192 CegarLoopUtils]: At program point L4-2(line 4) the Hoare annotation is: true [2021-02-24 00:17:56,787 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-24 00:17:56,787 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-24 00:17:56,787 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-24 00:17:56,787 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-24 00:17:56,787 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-24 00:17:56,787 INFO L189 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2021-02-24 00:17:56,787 INFO L189 CegarLoopUtils]: For program point L7(line 7) no Hoare annotation was computed. [2021-02-24 00:17:56,788 INFO L189 CegarLoopUtils]: For program point L7-1(line 7) no Hoare annotation was computed. [2021-02-24 00:17:56,788 INFO L189 CegarLoopUtils]: For program point L7-3(lines 6 8) no Hoare annotation was computed. [2021-02-24 00:17:56,788 INFO L189 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2021-02-24 00:17:56,788 INFO L185 CegarLoopUtils]: At program point L60(lines 60 93) the Hoare annotation is: (and (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__tmp_1~0 1) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296))))) [2021-02-24 00:17:56,788 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 14 168) the Hoare annotation is: true [2021-02-24 00:17:56,788 INFO L185 CegarLoopUtils]: At program point L151(lines 29 152) the Hoare annotation is: false [2021-02-24 00:17:56,789 INFO L185 CegarLoopUtils]: At program point L118(line 118) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~2 0)) (= main_~__VERIFIER_assert__cond~0 1) (let ((.cse0 (div main_~main__index2~0 4294967296))) (<= (+ main_~main__index1~0 (* 4294967296 .cse0)) (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) (* .cse0 4294967296) 99999) 4294967296))))) (= main_~__tmp_1~0 1)) [2021-02-24 00:17:56,789 INFO L185 CegarLoopUtils]: At program point L52(line 52) the Hoare annotation is: (let ((.cse4 (div main_~main__index2~0 4294967296))) (let ((.cse0 (* 4294967296 .cse4)) (.cse5 (div main_~main__index1~0 4294967296))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (let ((.cse3 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse1 (select .cse3 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse5 (- 17179869184)))))) (<= .cse1 (let ((.cse2 (select .cse3 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse4 (- 17179869184)))))) (+ .cse2 (* 4294967296 (div (+ .cse1 (* .cse2 (- 1))) 4294967296))))))) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__tmp_1~0 1) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 .cse5)))))) [2021-02-24 00:17:56,789 INFO L192 CegarLoopUtils]: At program point L19(line 19) the Hoare annotation is: true [2021-02-24 00:17:56,789 INFO L185 CegarLoopUtils]: At program point L110(line 110) the Hoare annotation is: false [2021-02-24 00:17:56,789 INFO L185 CegarLoopUtils]: At program point L69(line 69) the Hoare annotation is: (and (not (= main_~main____CPAchecker_TMP_0~1 0)) (not (= main_~__tmp_2~0 0)) (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__tmp_1~0 1) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296))))) [2021-02-24 00:17:56,790 INFO L185 CegarLoopUtils]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))))) [2021-02-24 00:17:56,790 INFO L185 CegarLoopUtils]: At program point L119(lines 99 128) the Hoare annotation is: (let ((.cse1 (= main_~__VERIFIER_assert__cond~0 1)) (.cse3 (div main_~main__index1~0 4294967296)) (.cse4 (div main_~main__index2~0 4294967296)) (.cse2 (= main_~__tmp_1~0 1))) (or (let ((.cse0 (* 4294967296 .cse4))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (not (= main_~__VERIFIER_assert__cond~2 0)) .cse1 .cse2 (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 .cse3))))) (and (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) .cse1 (let ((.cse7 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse5 (select .cse7 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse4 (- 17179869184)))))) (<= .cse5 (let ((.cse6 (select .cse7 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse3 (- 17179869184)))))) (+ .cse6 (* 4294967296 (div (+ (* .cse6 (- 1)) .cse5) 4294967296))))))) .cse2))) [2021-02-24 00:17:56,790 INFO L185 CegarLoopUtils]: At program point L53(line 53) the Hoare annotation is: (let ((.cse4 (div main_~main__index2~0 4294967296))) (let ((.cse0 (* 4294967296 .cse4)) (.cse5 (div main_~main__index1~0 4294967296))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (let ((.cse3 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse1 (select .cse3 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse5 (- 17179869184)))))) (<= .cse1 (let ((.cse2 (select .cse3 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse4 (- 17179869184)))))) (+ .cse2 (* 4294967296 (div (+ .cse1 (* .cse2 (- 1))) 4294967296))))))) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__tmp_1~0 1) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 .cse5)))))) [2021-02-24 00:17:56,790 INFO L185 CegarLoopUtils]: At program point L20(line 20) the Hoare annotation is: (= main_~main__loop_entered~0 0) [2021-02-24 00:17:56,790 INFO L185 CegarLoopUtils]: At program point L20-1(line 20) the Hoare annotation is: (= main_~main__loop_entered~0 0) [2021-02-24 00:17:56,790 INFO L185 CegarLoopUtils]: At program point L111(line 111) the Hoare annotation is: false [2021-02-24 00:17:56,791 INFO L185 CegarLoopUtils]: At program point L78(line 78) the Hoare annotation is: (and (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (= main_~__tmp_1~0 1) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296))))) [2021-02-24 00:17:56,791 INFO L185 CegarLoopUtils]: At program point L70(line 70) the Hoare annotation is: (and (not (= main_~main____CPAchecker_TMP_0~1 0)) (not (= main_~__tmp_2~0 0)) (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))) (= main_~__tmp_1~0 1)) [2021-02-24 00:17:56,791 INFO L185 CegarLoopUtils]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (= main_~main____CPAchecker_TMP_0~0 1) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))))) [2021-02-24 00:17:56,791 INFO L185 CegarLoopUtils]: At program point L161(line 161) the Hoare annotation is: (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999)) [2021-02-24 00:17:56,791 INFO L185 CegarLoopUtils]: At program point L62(lines 62 88) the Hoare annotation is: (and (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__tmp_1~0 1) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296))))) [2021-02-24 00:17:56,791 INFO L185 CegarLoopUtils]: At program point L29(lines 29 152) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))))) [2021-02-24 00:17:56,791 INFO L185 CegarLoopUtils]: At program point L87(lines 62 88) the Hoare annotation is: (and (not (= main_~main____CPAchecker_TMP_0~1 0)) (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__tmp_1~0 1) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296))))) [2021-02-24 00:17:56,792 INFO L185 CegarLoopUtils]: At program point L54(line 54) the Hoare annotation is: (let ((.cse4 (div main_~main__index2~0 4294967296))) (let ((.cse5 (* .cse4 4294967296))) (and (let ((.cse3 (div main_~main__index1~0 4294967296))) (or (let ((.cse2 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse0 (select .cse2 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse4 (- 17179869184)) (- 4))))) (<= .cse0 (let ((.cse1 (select .cse2 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse3 (- 17179869184)))))) (+ .cse1 (* 4294967296 (div (+ (* .cse1 (- 1)) .cse0) 4294967296))))))) (not (= (+ main_~main__index1~0 .cse5) (+ main_~main__index2~0 (* .cse3 4294967296)))))) (= main_~__VERIFIER_assert__cond~0 1) (<= (+ main_~main__index1~0 (* 4294967296 .cse4)) (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) .cse5 99999) 4294967296)))) (= main_~__tmp_1~0 1)))) [2021-02-24 00:17:56,792 INFO L185 CegarLoopUtils]: At program point L21(lines 21 167) the Hoare annotation is: (= main_~main__loop_entered~0 0) [2021-02-24 00:17:56,792 INFO L185 CegarLoopUtils]: At program point L79(lines 46 139) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (let ((.cse1 (= main_~__VERIFIER_assert__cond~0 1)) (.cse2 (= main_~__tmp_1~0 1))) (or (and (<= main_~main__index2~0 (+ .cse0 99999)) .cse1 (= main_~main____CPAchecker_TMP_0~0 1) .cse2) (and .cse1 (<= main_~main__index2~0 (+ .cse0 99998)) (not (= main_~__VERIFIER_assert__cond~1 0)) .cse2))) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))))) [2021-02-24 00:17:56,792 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 14 168) the Hoare annotation is: true [2021-02-24 00:17:56,792 INFO L192 CegarLoopUtils]: At program point L137(line 137) the Hoare annotation is: true [2021-02-24 00:17:56,792 INFO L185 CegarLoopUtils]: At program point L104(line 104) the Hoare annotation is: (and (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (let ((.cse2 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse0 (select .cse2 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* (div main_~main__index2~0 4294967296) (- 17179869184)))))) (<= .cse0 (let ((.cse1 (select .cse2 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* (div main_~main__index1~0 4294967296) (- 17179869184)))))) (+ .cse1 (* 4294967296 (div (+ (* .cse1 (- 1)) .cse0) 4294967296))))))) (= main_~__tmp_1~0 1)) [2021-02-24 00:17:56,793 INFO L185 CegarLoopUtils]: At program point L71(lines 71 80) the Hoare annotation is: (and (not (= main_~main____CPAchecker_TMP_0~1 0)) (not (= main_~__tmp_2~0 0)) (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))) (= main_~__tmp_1~0 1)) [2021-02-24 00:17:56,793 INFO L185 CegarLoopUtils]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (= main_~main____CPAchecker_TMP_0~0 1) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))) (= main_~__tmp_1~0 1))) [2021-02-24 00:17:56,793 INFO L185 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) the Hoare annotation is: false [2021-02-24 00:17:56,793 INFO L185 CegarLoopUtils]: At program point mainENTRY(lines 14 168) the Hoare annotation is: (and (= |old(#length)| |#length|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= |old(#valid)| |#valid|)) [2021-02-24 00:17:56,793 INFO L185 CegarLoopUtils]: At program point L55(line 55) the Hoare annotation is: (let ((.cse4 (div main_~main__index2~0 4294967296))) (let ((.cse5 (* .cse4 4294967296))) (and (let ((.cse3 (div main_~main__index1~0 4294967296))) (or (let ((.cse2 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse0 (select .cse2 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse4 (- 17179869184)) (- 4))))) (<= .cse0 (let ((.cse1 (select .cse2 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse3 (- 17179869184)))))) (+ .cse1 (* 4294967296 (div (+ (* .cse1 (- 1)) .cse0) 4294967296))))))) (not (= (+ main_~main__index1~0 .cse5) (+ main_~main__index2~0 (* .cse3 4294967296)))))) (= main_~__VERIFIER_assert__cond~0 1) (<= (+ main_~main__index1~0 (* 4294967296 .cse4)) (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) .cse5 99999) 4294967296)))) (= main_~__tmp_1~0 1)))) [2021-02-24 00:17:56,793 INFO L185 CegarLoopUtils]: At program point L146(lines 31 147) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (= main_~main____CPAchecker_TMP_0~0 1) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))))) [2021-02-24 00:17:56,794 INFO L185 CegarLoopUtils]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (= main_~__VERIFIER_assert__cond~0 1) (= main_~main____CPAchecker_TMP_0~0 1) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))) (= main_~__tmp_1~0 1))) [2021-02-24 00:17:56,794 INFO L185 CegarLoopUtils]: At program point L105(line 105) the Hoare annotation is: (and (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (let ((.cse2 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse0 (select .cse2 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* (div main_~main__index2~0 4294967296) (- 17179869184)))))) (<= .cse0 (let ((.cse1 (select .cse2 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* (div main_~main__index1~0 4294967296) (- 17179869184)))))) (+ .cse1 (* 4294967296 (div (+ (* .cse1 (- 1)) .cse0) 4294967296))))))) (= main_~__tmp_1~0 1)) [2021-02-24 00:17:56,794 INFO L185 CegarLoopUtils]: At program point L105-1(line 105) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse0 (select .cse2 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* (div main_~main__index2~0 4294967296) (- 17179869184)))))) (and (<= .cse0 (+ (* 4294967296 (div (+ .cse0 (* |main_#t~mem11| (- 1))) 4294967296)) |main_#t~mem11|)) (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (<= .cse0 (let ((.cse1 (select .cse2 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* (div main_~main__index1~0 4294967296) (- 17179869184)))))) (+ .cse1 (* 4294967296 (div (+ (* .cse1 (- 1)) .cse0) 4294967296))))) (= main_~__tmp_1~0 1)))) [2021-02-24 00:17:56,794 INFO L185 CegarLoopUtils]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (= main_~main____CPAchecker_TMP_0~0 1) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))) (= main_~__tmp_1~0 1))) [2021-02-24 00:17:56,794 INFO L185 CegarLoopUtils]: At program point L105-2(line 105) the Hoare annotation is: (let ((.cse4 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse2 (+ (* 4294967296 (div |main_#t~mem11| 4294967296)) |main_#t~mem12|)) (.cse1 (* 4294967296 (div |main_#t~mem12| 4294967296))) (.cse0 (select .cse4 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* (div main_~main__index2~0 4294967296) (- 17179869184)))))) (and (<= .cse0 (+ (* 4294967296 (div (+ .cse0 (* |main_#t~mem11| (- 1))) 4294967296)) |main_#t~mem11|)) (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (<= (+ |main_#t~mem11| .cse1) .cse2) (< .cse2 (+ |main_#t~mem11| .cse1 1)) (<= .cse0 (let ((.cse3 (select .cse4 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* (div main_~main__index1~0 4294967296) (- 17179869184)))))) (+ .cse3 (* 4294967296 (div (+ (* .cse3 (- 1)) .cse0) 4294967296))))) (= main_~__tmp_1~0 1)))) [2021-02-24 00:17:56,795 INFO L185 CegarLoopUtils]: At program point L105-3(line 105) the Hoare annotation is: (let ((.cse4 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse2 (+ (* 4294967296 (div |main_#t~mem11| 4294967296)) |main_#t~mem12|)) (.cse1 (* 4294967296 (div |main_#t~mem12| 4294967296))) (.cse0 (select .cse4 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* (div main_~main__index2~0 4294967296) (- 17179869184)))))) (and (<= .cse0 (+ (* 4294967296 (div (+ .cse0 (* |main_#t~mem11| (- 1))) 4294967296)) |main_#t~mem11|)) (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (<= (+ |main_#t~mem11| .cse1) .cse2) (not (= main_~__tmp_3~0 0)) (< .cse2 (+ |main_#t~mem11| .cse1 1)) (<= .cse0 (let ((.cse3 (select .cse4 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* (div main_~main__index1~0 4294967296) (- 17179869184)))))) (+ .cse3 (* 4294967296 (div (+ (* .cse3 (- 1)) .cse0) 4294967296))))) (= main_~__tmp_1~0 1)))) [2021-02-24 00:17:56,795 INFO L185 CegarLoopUtils]: At program point L105-4(line 105) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse0 (select .cse2 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* (div main_~main__index2~0 4294967296) (- 17179869184)))))) (and (<= .cse0 (+ (* 4294967296 (div (+ .cse0 (* |main_#t~mem11| (- 1))) 4294967296)) |main_#t~mem11|)) (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~__tmp_3~0 0)) (<= .cse0 (let ((.cse1 (select .cse2 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* (div main_~main__index1~0 4294967296) (- 17179869184)))))) (+ .cse1 (* 4294967296 (div (+ (* .cse1 (- 1)) .cse0) 4294967296))))) (= main_~__tmp_1~0 1)))) [2021-02-24 00:17:56,795 INFO L185 CegarLoopUtils]: At program point L64(line 64) the Hoare annotation is: (and (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__tmp_1~0 1) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296))))) [2021-02-24 00:17:56,795 INFO L185 CegarLoopUtils]: At program point L31(lines 31 147) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))))) [2021-02-24 00:17:56,796 INFO L185 CegarLoopUtils]: At program point L56(line 56) the Hoare annotation is: (and (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (let ((.cse1 (div main_~main__index1~0 4294967296)) (.cse0 (div main_~main__index2~0 4294967296))) (or (<= (+ main_~main__index1~0 (* 4294967296 .cse0)) (+ main_~main__index2~0 (* 4294967296 .cse1))) (let ((.cse4 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse2 (select .cse4 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse0 (- 17179869184)))))) (<= .cse2 (let ((.cse3 (select .cse4 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse1 (- 17179869184)))))) (+ .cse3 (* 4294967296 (div (+ (* .cse3 (- 1)) .cse2) 4294967296))))))))) (= main_~__tmp_1~0 1)) [2021-02-24 00:17:56,796 INFO L185 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: (and (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999)) (= main_~main__loop_entered~0 0)) [2021-02-24 00:17:56,796 INFO L185 CegarLoopUtils]: At program point L23-1(line 23) the Hoare annotation is: (and (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999)) (= main_~main__loop_entered~0 0)) [2021-02-24 00:17:56,796 INFO L185 CegarLoopUtils]: At program point L106(line 106) the Hoare annotation is: (and (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~__tmp_3~0 0)) (let ((.cse2 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse0 (select .cse2 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* (div main_~main__index2~0 4294967296) (- 17179869184)))))) (<= .cse0 (let ((.cse1 (select .cse2 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* (div main_~main__index1~0 4294967296) (- 17179869184)))))) (+ .cse1 (* 4294967296 (div (+ (* .cse1 (- 1)) .cse0) 4294967296))))))) (= main_~__tmp_1~0 1)) [2021-02-24 00:17:56,796 INFO L185 CegarLoopUtils]: At program point L73(line 73) the Hoare annotation is: false [2021-02-24 00:17:56,796 INFO L185 CegarLoopUtils]: At program point L40(lines 40 139) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (= main_~__VERIFIER_assert__cond~0 1) (= main_~main____CPAchecker_TMP_0~0 1) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))) (= main_~__tmp_1~0 1))) [2021-02-24 00:17:56,796 INFO L192 CegarLoopUtils]: At program point L131(lines 98 132) the Hoare annotation is: true [2021-02-24 00:17:56,796 INFO L185 CegarLoopUtils]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 110) the Hoare annotation is: false [2021-02-24 00:17:56,797 INFO L185 CegarLoopUtils]: At program point L156(lines 26 157) the Hoare annotation is: (or (= main_~main__loop_entered~0 0) (and (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (let ((.cse2 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse0 (select .cse2 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* (div main_~main__index2~0 4294967296) (- 17179869184)))))) (<= .cse0 (let ((.cse1 (select .cse2 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* (div main_~main__index1~0 4294967296) (- 17179869184)))))) (+ .cse1 (* 4294967296 (div (+ (* .cse1 (- 1)) .cse0) 4294967296))))))) (= main_~__tmp_1~0 1))) [2021-02-24 00:17:56,797 INFO L185 CegarLoopUtils]: At program point L57(lines 57 133) the Hoare annotation is: (and (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (let ((.cse1 (div main_~main__index1~0 4294967296)) (.cse0 (div main_~main__index2~0 4294967296))) (or (<= (+ main_~main__index1~0 (* 4294967296 .cse0)) (+ main_~main__index2~0 (* 4294967296 .cse1))) (let ((.cse4 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse2 (select .cse4 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse0 (- 17179869184)))))) (<= .cse2 (let ((.cse3 (select .cse4 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse1 (- 17179869184)))))) (+ .cse3 (* 4294967296 (div (+ (* .cse3 (- 1)) .cse2) 4294967296))))))))) (= main_~__tmp_1~0 1)) [2021-02-24 00:17:56,797 INFO L185 CegarLoopUtils]: At program point L24(lines 24 162) the Hoare annotation is: (and (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999)) (= main_~main__loop_entered~0 0)) [2021-02-24 00:17:56,797 INFO L185 CegarLoopUtils]: At program point L115(line 115) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__tmp_1~0 1)) [2021-02-24 00:17:56,797 INFO L192 CegarLoopUtils]: At program point L16(line 16) the Hoare annotation is: true [2021-02-24 00:17:56,797 INFO L185 CegarLoopUtils]: At program point L16-1(line 16) the Hoare annotation is: false [2021-02-24 00:17:56,798 INFO L185 CegarLoopUtils]: At program point L16-2(line 16) the Hoare annotation is: false [2021-02-24 00:17:56,798 INFO L185 CegarLoopUtils]: At program point L16-3(line 16) the Hoare annotation is: false [2021-02-24 00:17:56,798 INFO L185 CegarLoopUtils]: At program point L16-4(line 16) the Hoare annotation is: false [2021-02-24 00:17:56,798 INFO L185 CegarLoopUtils]: At program point L107(line 107) the Hoare annotation is: (and (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~__tmp_3~0 0)) (let ((.cse2 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse0 (select .cse2 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* (div main_~main__index2~0 4294967296) (- 17179869184)))))) (<= .cse0 (let ((.cse1 (select .cse2 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* (div main_~main__index1~0 4294967296) (- 17179869184)))))) (+ .cse1 (* 4294967296 (div (+ (* .cse1 (- 1)) .cse0) 4294967296))))))) (= main_~__tmp_1~0 1)) [2021-02-24 00:17:56,798 INFO L185 CegarLoopUtils]: At program point L16-5(line 16) the Hoare annotation is: false [2021-02-24 00:17:56,798 INFO L185 CegarLoopUtils]: At program point L74(line 74) the Hoare annotation is: false [2021-02-24 00:17:56,798 INFO L185 CegarLoopUtils]: At program point L16-6(line 16) the Hoare annotation is: false [2021-02-24 00:17:56,798 INFO L192 CegarLoopUtils]: At program point L16-7(line 16) the Hoare annotation is: true [2021-02-24 00:17:56,799 INFO L192 CegarLoopUtils]: At program point L16-8(line 16) the Hoare annotation is: true [2021-02-24 00:17:56,799 INFO L192 CegarLoopUtils]: At program point L16-9(line 16) the Hoare annotation is: true [2021-02-24 00:17:56,799 INFO L192 CegarLoopUtils]: At program point L16-10(line 16) the Hoare annotation is: true [2021-02-24 00:17:56,799 INFO L185 CegarLoopUtils]: At program point L16-11(line 16) the Hoare annotation is: (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999)) [2021-02-24 00:17:56,799 INFO L185 CegarLoopUtils]: At program point L16-12(line 16) the Hoare annotation is: (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999)) [2021-02-24 00:17:56,799 INFO L192 CegarLoopUtils]: At program point L16-13(line 16) the Hoare annotation is: true [2021-02-24 00:17:56,799 INFO L192 CegarLoopUtils]: At program point L16-14(line 16) the Hoare annotation is: true [2021-02-24 00:17:56,799 INFO L185 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))))) [2021-02-24 00:17:56,800 INFO L185 CegarLoopUtils]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 73) the Hoare annotation is: false [2021-02-24 00:17:56,800 INFO L185 CegarLoopUtils]: At program point L116(line 116) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__tmp_1~0 1)) [2021-02-24 00:17:56,800 INFO L185 CegarLoopUtils]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__tmp_1~0 1) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))))) [2021-02-24 00:17:56,800 INFO L185 CegarLoopUtils]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296))) (.cse1 (div main_~main__index1~0 4294967296))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse1 (- 17179869184)))) |main_#t~mem9|) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__tmp_1~0 1) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 .cse1))))) [2021-02-24 00:17:56,801 INFO L185 CegarLoopUtils]: At program point L50-2(lines 50 138) the Hoare annotation is: (let ((.cse3 (div main_~main__index2~0 4294967296))) (let ((.cse1 (select |#memory_int| |main_~#main__array~0.base|)) (.cse0 (* 4294967296 .cse3)) (.cse2 (div main_~main__index1~0 4294967296))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= (select .cse1 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse2 (- 17179869184)))) |main_#t~mem9|) (= main_~__VERIFIER_assert__cond~0 1) (= |main_#t~mem10| (select .cse1 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse3 (- 17179869184))))) (= main_~__tmp_1~0 1) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 .cse2)))))) [2021-02-24 00:17:56,801 INFO L185 CegarLoopUtils]: At program point L50-3(line 50) the Hoare annotation is: (let ((.cse4 (div main_~main__index2~0 4294967296)) (.cse5 (select |#memory_int| |main_~#main__array~0.base|)) (.cse3 (div main_~main__index1~0 4294967296))) (let ((.cse1 (select .cse5 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse3 (- 17179869184))))) (.cse2 (select .cse5 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse4 (- 17179869184))))) (.cse0 (* 4294967296 .cse4))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= .cse1 |main_#t~mem9|) (<= .cse1 (+ .cse2 (* 4294967296 (div (+ .cse1 (* .cse2 (- 1))) 4294967296)))) (= main_~__VERIFIER_assert__cond~0 1) (= |main_#t~mem10| .cse2) (= main_~__tmp_1~0 1) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 .cse3)))))) [2021-02-24 00:17:56,801 INFO L185 CegarLoopUtils]: At program point L50-4(line 50) the Hoare annotation is: (let ((.cse4 (div main_~main__index2~0 4294967296)) (.cse3 (select |#memory_int| |main_~#main__array~0.base|)) (.cse5 (div main_~main__index1~0 4294967296))) (let ((.cse1 (select .cse3 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse5 (- 17179869184))))) (.cse0 (* 4294967296 .cse4))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= .cse1 |main_#t~mem9|) (<= .cse1 (let ((.cse2 (select .cse3 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse4 (- 17179869184)))))) (+ .cse2 (* 4294967296 (div (+ .cse1 (* .cse2 (- 1))) 4294967296))))) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__tmp_1~0 1) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 .cse5)))))) [2021-02-24 00:17:56,801 INFO L192 CegarLoopUtils]: At program point L50-5(line 50) the Hoare annotation is: true [2021-02-24 00:17:56,802 INFO L185 CegarLoopUtils]: At program point L108(lines 108 120) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~__tmp_3~0 0)) (let ((.cse2 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse0 (select .cse2 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* (div main_~main__index2~0 4294967296) (- 17179869184)))))) (<= .cse0 (let ((.cse1 (select .cse2 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* (div main_~main__index1~0 4294967296) (- 17179869184)))))) (+ .cse1 (* 4294967296 (div (+ (* .cse1 (- 1)) .cse0) 4294967296))))))) (= main_~__tmp_1~0 1)) [2021-02-24 00:17:56,802 INFO L192 CegarLoopUtils]: At program point L50-6(line 50) the Hoare annotation is: true [2021-02-24 00:17:56,802 INFO L185 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: false [2021-02-24 00:17:56,802 INFO L192 CegarLoopUtils]: At program point L166(line 166) the Hoare annotation is: true [2021-02-24 00:17:56,802 INFO L185 CegarLoopUtils]: At program point L92(lines 60 93) the Hoare annotation is: false [2021-02-24 00:17:56,802 INFO L185 CegarLoopUtils]: At program point L59(line 59) the Hoare annotation is: (and (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__tmp_1~0 1) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296))))) [2021-02-24 00:17:56,803 INFO L185 CegarLoopUtils]: At program point L26(lines 26 157) the Hoare annotation is: (and (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999)) (= main_~main__loop_entered~0 0)) [2021-02-24 00:17:56,803 INFO L185 CegarLoopUtils]: At program point L117(line 117) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~2 0)) (= main_~__VERIFIER_assert__cond~0 1) (let ((.cse0 (div main_~main__index2~0 4294967296))) (<= (+ main_~main__index1~0 (* 4294967296 .cse0)) (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) (* .cse0 4294967296) 99999) 4294967296))))) (= main_~__tmp_1~0 1)) [2021-02-24 00:17:56,803 INFO L192 CegarLoopUtils]: At program point L18(line 18) the Hoare annotation is: true [2021-02-24 00:17:56,803 INFO L185 CegarLoopUtils]: At program point L43(line 43) the Hoare annotation is: false [2021-02-24 00:17:56,803 INFO L185 CegarLoopUtils]: At program point L68(line 68) the Hoare annotation is: (and (not (= main_~main____CPAchecker_TMP_0~1 0)) (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) 1)) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__tmp_1~0 1) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296))))) [2021-02-24 00:17:56,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 12:17:56 BoogieIcfgContainer [2021-02-24 00:17:56,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-24 00:17:56,834 INFO L168 Benchmark]: Toolchain (without parser) took 16665.91 ms. Allocated memory was 160.4 MB in the beginning and 248.5 MB in the end (delta: 88.1 MB). Free memory was 136.4 MB in the beginning and 178.1 MB in the end (delta: -41.7 MB). Peak memory consumption was 137.2 MB. Max. memory is 8.0 GB. [2021-02-24 00:17:56,834 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 160.4 MB. Free memory is still 131.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-24 00:17:56,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.79 ms. Allocated memory is still 160.4 MB. Free memory was 135.4 MB in the beginning and 124.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-02-24 00:17:56,836 INFO L168 Benchmark]: Boogie Preprocessor took 92.80 ms. Allocated memory is still 160.4 MB. Free memory was 124.3 MB in the beginning and 122.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-02-24 00:17:56,836 INFO L168 Benchmark]: RCFGBuilder took 813.64 ms. Allocated memory is still 160.4 MB. Free memory was 122.6 MB in the beginning and 140.8 MB in the end (delta: -18.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 8.0 GB. [2021-02-24 00:17:56,837 INFO L168 Benchmark]: TraceAbstraction took 15353.37 ms. Allocated memory was 160.4 MB in the beginning and 248.5 MB in the end (delta: 88.1 MB). Free memory was 140.3 MB in the beginning and 178.1 MB in the end (delta: -37.9 MB). Peak memory consumption was 140.9 MB. Max. memory is 8.0 GB. [2021-02-24 00:17:56,839 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 160.4 MB. Free memory is still 131.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 387.79 ms. Allocated memory is still 160.4 MB. Free memory was 135.4 MB in the beginning and 124.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 92.80 ms. Allocated memory is still 160.4 MB. Free memory was 124.3 MB in the beginning and 122.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 813.64 ms. Allocated memory is still 160.4 MB. Free memory was 122.6 MB in the beginning and 140.8 MB in the end (delta: -18.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 15353.37 ms. Allocated memory was 160.4 MB in the beginning and 248.5 MB in the end (delta: 88.1 MB). Free memory was 140.3 MB in the beginning and 178.1 MB in the end (delta: -37.9 MB). Peak memory consumption was 140.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 110]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 73]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main__loop_entered == 0 || (((main__index1 <= main__index2 + 4294967296 * (((main__index1 + -1) / 4294967296 * 4294967296 + main__index2 * -1 + 99998) / 4294967296) + 1 && __VERIFIER_assert__cond == 1) && unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] <= unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] + 4294967296 * ((unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] * -1 + unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184]) / 4294967296)) && __tmp_1 == 1) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __tmp_1 == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) || (((main__index1 <= main__index2 + 4294967296 * (((main__index1 + -1) / 4294967296 * 4294967296 + main__index2 * -1 + 99998) / 4294967296) + 1 && __VERIFIER_assert__cond == 1) && unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] <= unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] + 4294967296 * ((unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] * -1 + unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184]) / 4294967296)) && __tmp_1 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: (((!(main____CPAchecker_TMP_0 == 0) && main__index1 <= main__index2 + 4294967296 * (((main__index1 + -1) / 4294967296 * 4294967296 + main__index2 * -1 + 99998) / 4294967296) + 1) && __VERIFIER_assert__cond == 1) && __tmp_1 == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && main__loop_entered == 0) && main____CPAchecker_TMP_0 == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && main____CPAchecker_TMP_0 == 1) && __tmp_1 == 1) || (((__VERIFIER_assert__cond == 1 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99998) && !(__VERIFIER_assert__cond == 0)) && __tmp_1 == 1)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) - ProcedureContractResult [Line: 14]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.5s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 739 SDtfs, 1037 SDslu, 1559 SDs, 0 SdLazy, 1386 SolverSat, 49 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 287 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 108 LocationsWithAnnotation, 108 PreInvPairs, 185 NumberOfFragments, 3555 HoareAnnotationTreeSize, 108 FomulaSimplifications, 4629 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 108 FomulaSimplificationsInter, 4456 FormulaSimplificationTreeSizeReductionInter, 4.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 443 ConstructedInterpolants, 0 QuantifiedInterpolants, 329422 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 9/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...