/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-06 11:32:59,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 11:32:59,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 11:32:59,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 11:32:59,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 11:32:59,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 11:32:59,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 11:32:59,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 11:32:59,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 11:32:59,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 11:32:59,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 11:32:59,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 11:32:59,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 11:32:59,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 11:32:59,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 11:32:59,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 11:32:59,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 11:32:59,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 11:32:59,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 11:32:59,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 11:32:59,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 11:32:59,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 11:32:59,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 11:32:59,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 11:32:59,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 11:32:59,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 11:32:59,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 11:32:59,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 11:32:59,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 11:32:59,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 11:32:59,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 11:32:59,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 11:32:59,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 11:32:59,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 11:32:59,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 11:32:59,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 11:32:59,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 11:32:59,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 11:32:59,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 11:32:59,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 11:32:59,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 11:32:59,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-06 11:32:59,395 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 11:32:59,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 11:32:59,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 11:32:59,397 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 11:32:59,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 11:32:59,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 11:32:59,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 11:32:59,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 11:32:59,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 11:32:59,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 11:32:59,398 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 11:32:59,398 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 11:32:59,398 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 11:32:59,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 11:32:59,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 11:32:59,399 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 11:32:59,399 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 11:32:59,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 11:32:59,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 11:32:59,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 11:32:59,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-06 11:32:59,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-06 11:32:59,400 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-06 11:32:59,400 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-06 11:32:59,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 11:32:59,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 11:32:59,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 11:32:59,744 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 11:32:59,745 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 11:32:59,746 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+lhb-reducer.c [2021-05-06 11:32:59,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2543b470/808331501ec94f68b0599ce9bcacacbd/FLAGbaa2a7f9a [2021-05-06 11:33:00,144 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 11:33:00,145 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2021-05-06 11:33:00,151 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2543b470/808331501ec94f68b0599ce9bcacacbd/FLAGbaa2a7f9a [2021-05-06 11:33:00,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2543b470/808331501ec94f68b0599ce9bcacacbd [2021-05-06 11:33:00,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 11:33:00,550 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-06 11:33:00,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 11:33:00,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 11:33:00,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 11:33:00,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:33:00" (1/1) ... [2021-05-06 11:33:00,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2614fb8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:00, skipping insertion in model container [2021-05-06 11:33:00,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:33:00" (1/1) ... [2021-05-06 11:33:00,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 11:33:00,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 11:33:00,686 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[1126,1139] [2021-05-06 11:33:00,694 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[1880,1893] [2021-05-06 11:33:00,698 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[2401,2414] [2021-05-06 11:33:00,702 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[3193,3206] [2021-05-06 11:33:00,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:33:00,710 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 11:33:00,757 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[1126,1139] [2021-05-06 11:33:00,760 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[1880,1893] [2021-05-06 11:33:00,762 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[2401,2414] [2021-05-06 11:33:00,765 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[3193,3206] [2021-05-06 11:33:00,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:33:00,778 INFO L208 MainTranslator]: Completed translation [2021-05-06 11:33:00,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:00 WrapperNode [2021-05-06 11:33:00,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 11:33:00,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 11:33:00,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 11:33:00,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 11:33:00,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:00" (1/1) ... [2021-05-06 11:33:00,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:00" (1/1) ... [2021-05-06 11:33:00,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:00" (1/1) ... [2021-05-06 11:33:00,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:00" (1/1) ... [2021-05-06 11:33:00,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:00" (1/1) ... [2021-05-06 11:33:00,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:00" (1/1) ... [2021-05-06 11:33:00,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:00" (1/1) ... [2021-05-06 11:33:00,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 11:33:00,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 11:33:00,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 11:33:00,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 11:33:00,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 11:33:00,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 11:33:00,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 11:33:00,878 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 11:33:00,878 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-06 11:33:00,878 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 11:33:00,879 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 11:33:00,879 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 11:33:00,879 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 11:33:00,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 11:33:00,879 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-06 11:33:00,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 11:33:00,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2021-05-06 11:33:00,879 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 11:33:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 11:33:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 11:33:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 11:33:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 11:33:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 11:33:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 11:33:01,232 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 11:33:01,233 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-06 11:33:01,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:33:01 BoogieIcfgContainer [2021-05-06 11:33:01,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 11:33:01,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 11:33:01,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 11:33:01,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 11:33:01,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 11:33:00" (1/3) ... [2021-05-06 11:33:01,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51993456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:33:01, skipping insertion in model container [2021-05-06 11:33:01,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:00" (2/3) ... [2021-05-06 11:33:01,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51993456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:33:01, skipping insertion in model container [2021-05-06 11:33:01,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:33:01" (3/3) ... [2021-05-06 11:33:01,240 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2021-05-06 11:33:01,244 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-06 11:33:01,246 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2021-05-06 11:33:01,260 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-05-06 11:33:01,276 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 11:33:01,277 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-06 11:33:01,277 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-06 11:33:01,277 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 11:33:01,277 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 11:33:01,277 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 11:33:01,277 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 11:33:01,277 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 11:33:01,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 37 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 11:33:01,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-06 11:33:01,298 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:01,299 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:01,299 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:01,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:01,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1265954152, now seen corresponding path program 1 times [2021-05-06 11:33:01,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:01,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [940427219] [2021-05-06 11:33:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:01,373 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:01,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 11:33:01,645 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:01,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [940427219] [2021-05-06 11:33:01,646 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [940427219] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:01,647 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:01,647 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 11:33:01,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024319742] [2021-05-06 11:33:01,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 11:33:01,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:01,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 11:33:01,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:33:01,665 INFO L87 Difference]: Start difference. First operand has 42 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 37 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:01,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:01,797 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2021-05-06 11:33:01,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 11:33:01,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-05-06 11:33:01,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:01,808 INFO L225 Difference]: With dead ends: 56 [2021-05-06 11:33:01,809 INFO L226 Difference]: Without dead ends: 34 [2021-05-06 11:33:01,811 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:33:01,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-05-06 11:33:01,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2021-05-06 11:33:01,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:01,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2021-05-06 11:33:01,846 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2021-05-06 11:33:01,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:01,846 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2021-05-06 11:33:01,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:01,847 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2021-05-06 11:33:01,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-06 11:33:01,847 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:01,848 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:01,848 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 11:33:01,848 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:01,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:01,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1569720066, now seen corresponding path program 1 times [2021-05-06 11:33:01,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:01,850 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1076293964] [2021-05-06 11:33:01,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:01,855 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:01,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 11:33:01,989 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:01,989 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1076293964] [2021-05-06 11:33:01,989 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1076293964] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:01,990 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:01,990 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 11:33:01,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346500852] [2021-05-06 11:33:01,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 11:33:01,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:01,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 11:33:01,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 11:33:01,993 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:02,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:02,116 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2021-05-06 11:33:02,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 11:33:02,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-06 11:33:02,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:02,119 INFO L225 Difference]: With dead ends: 53 [2021-05-06 11:33:02,119 INFO L226 Difference]: Without dead ends: 51 [2021-05-06 11:33:02,120 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 86.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:02,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-06 11:33:02,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2021-05-06 11:33:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-05-06 11:33:02,137 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2021-05-06 11:33:02,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:02,137 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-05-06 11:33:02,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:02,137 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-05-06 11:33:02,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-06 11:33:02,138 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:02,138 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:02,138 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 11:33:02,138 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:02,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:02,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1505043805, now seen corresponding path program 1 times [2021-05-06 11:33:02,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:02,139 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1101898683] [2021-05-06 11:33:02,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:02,140 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:02,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 11:33:02,192 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:02,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1101898683] [2021-05-06 11:33:02,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1101898683] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:02,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:02,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 11:33:02,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640871758] [2021-05-06 11:33:02,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 11:33:02,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:02,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 11:33:02,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:33:02,194 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:02,281 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2021-05-06 11:33:02,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 11:33:02,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-06 11:33:02,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:02,284 INFO L225 Difference]: With dead ends: 62 [2021-05-06 11:33:02,284 INFO L226 Difference]: Without dead ends: 41 [2021-05-06 11:33:02,285 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:33:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-05-06 11:33:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2021-05-06 11:33:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:02,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2021-05-06 11:33:02,293 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2021-05-06 11:33:02,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:02,294 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-05-06 11:33:02,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-05-06 11:33:02,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-06 11:33:02,294 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:02,294 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:02,294 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-06 11:33:02,295 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:02,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:02,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1358532641, now seen corresponding path program 1 times [2021-05-06 11:33:02,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:02,295 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1432957421] [2021-05-06 11:33:02,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:02,297 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:02,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 11:33:02,365 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:02,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1432957421] [2021-05-06 11:33:02,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1432957421] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:02,365 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:02,365 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 11:33:02,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196042616] [2021-05-06 11:33:02,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 11:33:02,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:02,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 11:33:02,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:33:02,367 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:02,420 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2021-05-06 11:33:02,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 11:33:02,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-06 11:33:02,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:02,421 INFO L225 Difference]: With dead ends: 56 [2021-05-06 11:33:02,421 INFO L226 Difference]: Without dead ends: 35 [2021-05-06 11:33:02,422 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:33:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-06 11:33:02,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2021-05-06 11:33:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:02,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2021-05-06 11:33:02,427 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2021-05-06 11:33:02,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:02,427 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2021-05-06 11:33:02,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:02,427 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2021-05-06 11:33:02,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-06 11:33:02,428 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:02,428 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:02,428 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 11:33:02,428 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:02,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:02,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1464846627, now seen corresponding path program 1 times [2021-05-06 11:33:02,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:02,429 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [721493815] [2021-05-06 11:33:02,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:02,430 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:03,151 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 88 [2021-05-06 11:33:03,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:03,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 11:33:03,287 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:03,287 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [721493815] [2021-05-06 11:33:03,287 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [721493815] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:03,287 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:03,287 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-06 11:33:03,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544141206] [2021-05-06 11:33:03,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-06 11:33:03,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:03,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-06 11:33:03,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-06 11:33:03,289 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:03,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:03,628 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2021-05-06 11:33:03,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-06 11:33:03,629 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-05-06 11:33:03,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:03,629 INFO L225 Difference]: With dead ends: 47 [2021-05-06 11:33:03,629 INFO L226 Difference]: Without dead ends: 31 [2021-05-06 11:33:03,630 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 668.6ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-05-06 11:33:03,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-06 11:33:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-05-06 11:33:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2021-05-06 11:33:03,635 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2021-05-06 11:33:03,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:03,635 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2021-05-06 11:33:03,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2021-05-06 11:33:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-06 11:33:03,636 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:03,636 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:03,636 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-06 11:33:03,636 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:03,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:03,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1183527149, now seen corresponding path program 1 times [2021-05-06 11:33:03,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:03,637 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [12342176] [2021-05-06 11:33:03,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:03,639 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:03,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 11:33:03,719 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:03,720 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [12342176] [2021-05-06 11:33:03,720 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [12342176] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:03,720 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:03,720 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:33:03,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994223940] [2021-05-06 11:33:03,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:33:03,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:03,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:33:03,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:33:03,722 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:03,830 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2021-05-06 11:33:03,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 11:33:03,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-05-06 11:33:03,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:03,831 INFO L225 Difference]: With dead ends: 44 [2021-05-06 11:33:03,831 INFO L226 Difference]: Without dead ends: 42 [2021-05-06 11:33:03,831 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 79.6ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-05-06 11:33:03,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-05-06 11:33:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2021-05-06 11:33:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2021-05-06 11:33:03,836 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2021-05-06 11:33:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:03,837 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2021-05-06 11:33:03,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2021-05-06 11:33:03,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-06 11:33:03,837 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:03,838 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:03,838 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-06 11:33:03,838 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:03,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:03,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1919789033, now seen corresponding path program 1 times [2021-05-06 11:33:03,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:03,839 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [478221880] [2021-05-06 11:33:03,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:03,856 INFO L73 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2021-05-06 11:33:03,856 WARN L75 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-06 11:33:03,857 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:03,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 11:33:03,982 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:03,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [478221880] [2021-05-06 11:33:03,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [478221880] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:03,982 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:03,982 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:33:03,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659403926] [2021-05-06 11:33:03,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:33:03,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:03,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:33:03,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:33:03,984 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:04,139 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2021-05-06 11:33:04,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:33:04,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-06 11:33:04,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:04,140 INFO L225 Difference]: With dead ends: 32 [2021-05-06 11:33:04,140 INFO L226 Difference]: Without dead ends: 0 [2021-05-06 11:33:04,140 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 101.1ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-05-06 11:33:04,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-06 11:33:04,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-06 11:33:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-06 11:33:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-06 11:33:04,141 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2021-05-06 11:33:04,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:04,141 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-06 11:33:04,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-06 11:33:04,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-06 11:33:04,141 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-06 11:33:04,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-06 11:33:06,396 WARN L205 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 35 [2021-05-06 11:33:06,576 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2021-05-06 11:33:06,708 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2021-05-06 11:33:06,923 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2021-05-06 11:33:08,011 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2021-05-06 11:33:08,088 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-05-06 11:33:08,088 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-05-06 11:33:08,088 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-05-06 11:33:08,089 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:33:08,089 INFO L194 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-05-06 11:33:08,089 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:33:08,089 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:33:08,089 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-06 11:33:08,089 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-06 11:33:08,089 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:33:08,089 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2021-05-06 11:33:08,089 INFO L198 CegarLoopUtils]: For program point L7(line 7) no Hoare annotation was computed. [2021-05-06 11:33:08,089 INFO L198 CegarLoopUtils]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2021-05-06 11:33:08,089 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2021-05-06 11:33:08,089 INFO L194 CegarLoopUtils]: At program point L97(lines 97 132) the Hoare annotation is: (and (let ((.cse0 (div main_~main__index2~0 4294967296)) (.cse1 (div main_~main__index1~0 4294967296))) (or (<= (+ main_~main__index1~0 (* 4294967296 .cse0)) (+ main_~main__index2~0 (* 4294967296 .cse1))) (let ((.cse6 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse5 (select .cse6 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse1 (- 17179869184))))) (.cse3 (select .cse6 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse0 (- 17179869184)))))) (let ((.cse4 (+ .cse5 (* 4294967296 (div .cse3 4294967296)))) (.cse2 (* 4294967296 (div .cse5 4294967296)))) (and (<= (+ .cse2 .cse3) .cse4) (< .cse4 (+ .cse2 .cse3 1)))))))) (<= 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)) [2021-05-06 11:33:08,089 INFO L194 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-05-06 11:33:08,090 INFO L194 CegarLoopUtils]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 167) the Hoare annotation is: false [2021-05-06 11:33:08,090 INFO L194 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_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296))))) [2021-05-06 11:33:08,090 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 14 196) the Hoare annotation is: true [2021-05-06 11:33:08,090 INFO L194 CegarLoopUtils]: At program point L151(lines 29 152) the Hoare annotation is: false [2021-05-06 11:33:08,090 INFO L194 CegarLoopUtils]: At program point L172(lines 26 185) 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)) [2021-05-06 11:33:08,090 INFO L194 CegarLoopUtils]: At program point L73(line 73) the Hoare annotation is: false [2021-05-06 11:33:08,090 INFO L194 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)))))) [2021-05-06 11:33:08,090 INFO L201 CegarLoopUtils]: At program point L131(lines 97 132) the Hoare annotation is: true [2021-05-06 11:33:08,090 INFO L194 CegarLoopUtils]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 109) the Hoare annotation is: false [2021-05-06 11:33:08,090 INFO L194 CegarLoopUtils]: At program point L156(lines 156 184) the Hoare annotation is: (= main_~main__loop_entered~0 0) [2021-05-06 11:33:08,090 INFO L194 CegarLoopUtils]: At program point L57(lines 57 133) the Hoare annotation is: (and (let ((.cse0 (div main_~main__index2~0 4294967296)) (.cse1 (div main_~main__index1~0 4294967296))) (or (<= (+ main_~main__index1~0 (* 4294967296 .cse0)) (+ main_~main__index2~0 (* 4294967296 .cse1))) (let ((.cse6 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse5 (select .cse6 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse1 (- 17179869184))))) (.cse3 (select .cse6 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse0 (- 17179869184)))))) (let ((.cse4 (+ .cse5 (* 4294967296 (div .cse3 4294967296)))) (.cse2 (* 4294967296 (div .cse5 4294967296)))) (and (<= (+ .cse2 .cse3) .cse4) (< .cse4 (+ .cse2 .cse3 1)))))))) (<= 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)) [2021-05-06 11:33:08,091 INFO L194 CegarLoopUtils]: At program point L24(lines 24 190) the Hoare annotation is: (and (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999)) (= main_~main__loop_entered~0 0)) [2021-05-06 11:33:08,091 INFO L194 CegarLoopUtils]: At program point L119(lines 98 128) the Hoare annotation is: (let ((.cse8 (div main_~main__index1~0 4294967296)) (.cse7 (div main_~main__index2~0 4294967296))) (let ((.cse9 (= main_~__VERIFIER_assert__cond~0 1)) (.cse0 (* 4294967296 .cse7)) (.cse1 (+ main_~main__index2~0 (* 4294967296 .cse8)))) (or (and (or (<= (+ main_~main__index1~0 .cse0) .cse1) (let ((.cse6 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse5 (select .cse6 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse8 (- 17179869184))))) (.cse3 (select .cse6 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse7 (- 17179869184)))))) (let ((.cse4 (+ .cse5 (* 4294967296 (div .cse3 4294967296)))) (.cse2 (* 4294967296 (div .cse5 4294967296)))) (and (<= (+ .cse2 .cse3) .cse4) (< .cse4 (+ .cse2 .cse3 1))))))) (<= 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)) .cse9) (and (<= main_~main__index2~0 (+ .cse0 99999)) (not (= main_~__VERIFIER_assert__cond~2 0)) .cse9 (<= (+ main_~main__index1~0 .cse0 1) .cse1))))) [2021-05-06 11:33:08,091 INFO L194 CegarLoopUtils]: At program point L107(lines 107 120) the Hoare annotation is: (and (let ((.cse0 (div main_~main__index2~0 4294967296)) (.cse1 (div main_~main__index1~0 4294967296))) (or (<= (+ main_~main__index1~0 (* 4294967296 .cse0)) (+ main_~main__index2~0 (* 4294967296 .cse1))) (let ((.cse6 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse5 (select .cse6 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse1 (- 17179869184))))) (.cse3 (select .cse6 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse0 (- 17179869184)))))) (let ((.cse4 (+ .cse5 (* 4294967296 (div .cse3 4294967296)))) (.cse2 (* 4294967296 (div .cse5 4294967296)))) (and (<= (+ .cse2 .cse3) .cse4) (< .cse4 (+ .cse2 .cse3 1)))))))) (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)) [2021-05-06 11:33:08,091 INFO L194 CegarLoopUtils]: At program point L165(lines 165 173) the Hoare annotation is: false [2021-05-06 11:33:08,091 INFO L194 CegarLoopUtils]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 73) the Hoare annotation is: false [2021-05-06 11:33:08,091 INFO L194 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_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296))))) [2021-05-06 11:33:08,091 INFO L194 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-05-06 11:33:08,092 INFO L194 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_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296))))) [2021-05-06 11:33:08,092 INFO L194 CegarLoopUtils]: At program point L21(lines 21 195) the Hoare annotation is: (= main_~main__loop_entered~0 0) [2021-05-06 11:33:08,092 INFO L194 CegarLoopUtils]: At program point L50(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_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 .cse2)))))) [2021-05-06 11:33:08,092 INFO L194 CegarLoopUtils]: At program point L79(lines 46 139) the Hoare annotation is: (let ((.cse2 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (let ((.cse0 (<= main_~main__index2~0 (+ .cse2 99999))) (.cse1 (= main_~__VERIFIER_assert__cond~0 1))) (or (and (not (= main_~main____CPAchecker_TMP_0~1 0)) .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (and .cse0 .cse1 (= main_~main____CPAchecker_TMP_0~0 1)))) (<= (+ main_~main__index1~0 .cse2 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))))) [2021-05-06 11:33:08,092 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 14 196) the Hoare annotation is: true [2021-05-06 11:33:08,092 INFO L194 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: false [2021-05-06 11:33:08,093 INFO L194 CegarLoopUtils]: At program point L71(lines 71 80) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (not (= main_~main____CPAchecker_TMP_0~1 0)) (<= main_~main__index2~0 (+ .cse0 99999)) (<= 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 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))))) [2021-05-06 11:33:08,093 INFO L194 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) the Hoare annotation is: false [2021-05-06 11:33:08,093 INFO L194 CegarLoopUtils]: At program point L158(lines 158 179) the Hoare annotation is: false [2021-05-06 11:33:08,093 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 14 196) the Hoare annotation is: (and (= |old(#length)| |#length|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= |old(#valid)| |#valid|)) [2021-05-06 11:33:08,093 INFO L194 CegarLoopUtils]: At program point L92(lines 60 93) the Hoare annotation is: false [2021-05-06 11:33:08,093 INFO L194 CegarLoopUtils]: At program point L26(lines 26 185) 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-05-06 11:33:08,093 INFO L194 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-05-06 11:33:08,093 INFO L194 CegarLoopUtils]: At program point L109(line 109) the Hoare annotation is: false [2021-05-06 11:33:08,094 INFO L194 CegarLoopUtils]: At program point L167(line 167) the Hoare annotation is: false [2021-05-06 11:33:08,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 11:33:08 BoogieIcfgContainer [2021-05-06 11:33:08,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-06 11:33:08,113 INFO L168 Benchmark]: Toolchain (without parser) took 7563.47 ms. Allocated memory was 173.0 MB in the beginning and 235.9 MB in the end (delta: 62.9 MB). Free memory was 138.3 MB in the beginning and 176.1 MB in the end (delta: -37.8 MB). Peak memory consumption was 120.5 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:08,113 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 173.0 MB. Free memory is still 154.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 11:33:08,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.98 ms. Allocated memory is still 173.0 MB. Free memory was 138.1 MB in the beginning and 154.8 MB in the end (delta: -16.7 MB). Peak memory consumption was 11.8 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:08,114 INFO L168 Benchmark]: Boogie Preprocessor took 33.03 ms. Allocated memory is still 173.0 MB. Free memory was 154.8 MB in the beginning and 153.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:08,114 INFO L168 Benchmark]: RCFGBuilder took 421.44 ms. Allocated memory is still 173.0 MB. Free memory was 153.0 MB in the beginning and 132.2 MB in the end (delta: 20.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:08,115 INFO L168 Benchmark]: TraceAbstraction took 6877.07 ms. Allocated memory was 173.0 MB in the beginning and 235.9 MB in the end (delta: 62.9 MB). Free memory was 131.7 MB in the beginning and 176.1 MB in the end (delta: -44.4 MB). Peak memory consumption was 113.9 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:08,116 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.14 ms. Allocated memory is still 173.0 MB. Free memory is still 154.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 226.98 ms. Allocated memory is still 173.0 MB. Free memory was 138.1 MB in the beginning and 154.8 MB in the end (delta: -16.7 MB). Peak memory consumption was 11.8 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 33.03 ms. Allocated memory is still 173.0 MB. Free memory was 154.8 MB in the beginning and 153.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 421.44 ms. Allocated memory is still 173.0 MB. Free memory was 153.0 MB in the beginning and 132.2 MB in the end (delta: 20.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6877.07 ms. Allocated memory was 173.0 MB in the beginning and 235.9 MB in the end (delta: 62.9 MB). Free memory was 131.7 MB in the beginning and 176.1 MB in the end (delta: -44.4 MB). Peak memory consumption was 113.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: 109]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 167]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 49 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2867.0ms, OverallIterations: 7, TraceHistogramMax: 2, EmptinessCheckTime: 14.8ms, AutomataDifference: 1045.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 3946.3ms, InitialAbstractionConstructionTime: 9.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 196 SDtfs, 185 SDslu, 260 SDs, 0 SdLazy, 388 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 457.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1041.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 65.4ms AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 42 LocationsWithAnnotation, 42 PreInvPairs, 65 NumberOfFragments, 1313 HoareAnnotationTreeSize, 42 FomulaSimplifications, 1633 FormulaSimplificationTreeSizeReduction, 42.7ms HoareSimplificationTime, 42 FomulaSimplificationsInter, 251 FormulaSimplificationTreeSizeReductionInter, 3892.3ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (!(__VERIFIER_assert__cond == 0) && main__index1 <= main__index2 + 4294967296 * (((main__index1 + -1) / 4294967296 * 4294967296 + main__index2 * -1 + 99998) / 4294967296) + 1) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((main__index1 + 4294967296 * (main__index2 / 4294967296) <= main__index2 + 4294967296 * (main__index1 / 4294967296) || (4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] / 4294967296) + 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__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] / 4294967296) && unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] + 1)) && main__index1 <= main__index2 + 4294967296 * (((main__index1 + -1) / 4294967296 * 4294967296 + main__index2 * -1 + 99998) / 4294967296) + 1) && __VERIFIER_assert__cond == 1) || (((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) - 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) && 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: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((!(main____CPAchecker_TMP_0 == 0) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) || ((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && main____CPAchecker_TMP_0 == 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...