/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/verifythis/prefixsum_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:28:04,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:28:04,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:28:04,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:28:04,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:28:04,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:28:04,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:28:04,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:28:04,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:28:04,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:28:04,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:28:04,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:28:04,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:28:04,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:28:04,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:28:04,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:28:04,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:28:04,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:28:04,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:28:04,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:28:04,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:28:04,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:28:04,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:28:04,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:28:04,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:28:04,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:28:04,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:28:04,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:28:04,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:28:04,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:28:04,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:28:04,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:28:04,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:28:04,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:28:04,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:28:04,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:28:04,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:28:04,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:28:04,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:28:04,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:28:04,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:28:04,725 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:28:04,773 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:28:04,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:28:04,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:28:04,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:28:04,778 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:28:04,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:28:04,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:28:04,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:28:04,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:28:04,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:28:04,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:28:04,780 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:28:04,780 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:28:04,780 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:28:04,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:28:04,781 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:28:04,781 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:28:04,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:28:04,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:28:04,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:28:04,782 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:28:04,782 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:28:04,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:28:04,782 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:28:04,782 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:28:04,783 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 09:28:05,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:28:05,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:28:05,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:28:05,223 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:28:05,224 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:28:05,225 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_rec.c [2020-12-23 09:28:05,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/99e1f7468/3b10103cc1c1422ea3730b6341080811/FLAG8a9445887 [2020-12-23 09:28:06,055 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:28:06,055 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c [2020-12-23 09:28:06,067 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/99e1f7468/3b10103cc1c1422ea3730b6341080811/FLAG8a9445887 [2020-12-23 09:28:06,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/99e1f7468/3b10103cc1c1422ea3730b6341080811 [2020-12-23 09:28:06,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:28:06,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:28:06,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:28:06,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:28:06,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:28:06,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4374b35b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06, skipping insertion in model container [2020-12-23 09:28:06,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:28:06,441 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:28:06,593 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~right,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~right,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~left,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a0~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a0~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~1,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMINUS,IdentifierExpression[~n~0,],IntegerLiteral[1]]]]]] [2020-12-23 09:28:06,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:28:06,644 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:28:06,658 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~right,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~right,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~left,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a0~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a0~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~1,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMINUS,IdentifierExpression[~n~0,],IntegerLiteral[1]]]]]] [2020-12-23 09:28:06,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:28:06,696 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:28:06,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06 WrapperNode [2020-12-23 09:28:06,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:28:06,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:28:06,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:28:06,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:28:06,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:28:06,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:28:06,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:28:06,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:28:06,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... [2020-12-23 09:28:06,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:28:06,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:28:06,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:28:06,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:28:06,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:28:06,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:28:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:28:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2020-12-23 09:28:06,881 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2020-12-23 09:28:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 09:28:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 09:28:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2020-12-23 09:28:06,882 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2020-12-23 09:28:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:28:06,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:28:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 09:28:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 09:28:07,381 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:28:07,382 INFO L299 CfgBuilder]: Removed 21 assume(true) statements. [2020-12-23 09:28:07,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:28:07 BoogieIcfgContainer [2020-12-23 09:28:07,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:28:07,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:28:07,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:28:07,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:28:07,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:28:06" (1/3) ... [2020-12-23 09:28:07,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262dcf84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:28:07, skipping insertion in model container [2020-12-23 09:28:07,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:06" (2/3) ... [2020-12-23 09:28:07,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262dcf84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:28:07, skipping insertion in model container [2020-12-23 09:28:07,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:28:07" (3/3) ... [2020-12-23 09:28:07,393 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2020-12-23 09:28:07,401 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:28:07,406 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:28:07,428 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:28:07,459 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:28:07,459 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:28:07,459 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:28:07,459 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:28:07,460 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:28:07,460 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:28:07,460 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:28:07,460 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:28:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-12-23 09:28:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 09:28:07,488 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:07,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:07,490 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:07,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:07,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1112089738, now seen corresponding path program 1 times [2020-12-23 09:28:07,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:07,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970930872] [2020-12-23 09:28:07,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:07,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-23 09:28:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:07,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-12-23 09:28:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:07,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970930872] [2020-12-23 09:28:07,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:07,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:07,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004488537] [2020-12-23 09:28:07,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:07,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:07,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:07,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:07,778 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-12-23 09:28:07,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:07,867 INFO L93 Difference]: Finished difference Result 78 states and 105 transitions. [2020-12-23 09:28:07,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:07,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-12-23 09:28:07,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:07,882 INFO L225 Difference]: With dead ends: 78 [2020-12-23 09:28:07,883 INFO L226 Difference]: Without dead ends: 37 [2020-12-23 09:28:07,887 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:07,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-12-23 09:28:07,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-12-23 09:28:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-23 09:28:07,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2020-12-23 09:28:07,938 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2020-12-23 09:28:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:07,938 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2020-12-23 09:28:07,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2020-12-23 09:28:07,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 09:28:07,941 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:07,941 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:07,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:28:07,942 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:07,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:07,943 INFO L82 PathProgramCache]: Analyzing trace with hash -627348298, now seen corresponding path program 1 times [2020-12-23 09:28:07,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:07,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297917629] [2020-12-23 09:28:07,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:08,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-12-23 09:28:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:08,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-12-23 09:28:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:08,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297917629] [2020-12-23 09:28:08,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:08,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 09:28:08,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630758046] [2020-12-23 09:28:08,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 09:28:08,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:08,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 09:28:08,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:28:08,217 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 7 states. [2020-12-23 09:28:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:08,552 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2020-12-23 09:28:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:28:08,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-12-23 09:28:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:08,558 INFO L225 Difference]: With dead ends: 76 [2020-12-23 09:28:08,559 INFO L226 Difference]: Without dead ends: 60 [2020-12-23 09:28:08,562 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:28:08,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-12-23 09:28:08,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2020-12-23 09:28:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-23 09:28:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2020-12-23 09:28:08,584 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 28 [2020-12-23 09:28:08,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:08,585 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2020-12-23 09:28:08,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 09:28:08,585 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2020-12-23 09:28:08,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 09:28:08,588 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:08,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:08,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:28:08,589 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:08,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:08,593 INFO L82 PathProgramCache]: Analyzing trace with hash -250977996, now seen corresponding path program 1 times [2020-12-23 09:28:08,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:08,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633364594] [2020-12-23 09:28:08,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:08,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-12-23 09:28:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:08,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-12-23 09:28:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:08,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633364594] [2020-12-23 09:28:08,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354342269] [2020-12-23 09:28:08,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:28:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:08,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 09:28:08,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:28:09,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:09,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:28:09,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-12-23 09:28:09,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419171489] [2020-12-23 09:28:09,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 09:28:09,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:09,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 09:28:09,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:28:09,165 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 11 states. [2020-12-23 09:28:09,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:09,325 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2020-12-23 09:28:09,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 09:28:09,325 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-12-23 09:28:09,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:09,327 INFO L225 Difference]: With dead ends: 64 [2020-12-23 09:28:09,327 INFO L226 Difference]: Without dead ends: 41 [2020-12-23 09:28:09,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-12-23 09:28:09,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-12-23 09:28:09,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2020-12-23 09:28:09,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-12-23 09:28:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2020-12-23 09:28:09,336 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 30 [2020-12-23 09:28:09,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:09,337 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2020-12-23 09:28:09,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 09:28:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2020-12-23 09:28:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-23 09:28:09,338 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:09,339 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:09,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-23 09:28:09,555 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:09,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:09,557 INFO L82 PathProgramCache]: Analyzing trace with hash 663629362, now seen corresponding path program 2 times [2020-12-23 09:28:09,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:09,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707866352] [2020-12-23 09:28:09,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:10,168 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2020-12-23 09:28:10,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-23 09:28:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:10,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:28:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:11,496 WARN L197 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2020-12-23 09:28:12,292 WARN L197 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2020-12-23 09:28:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:12,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707866352] [2020-12-23 09:28:12,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105372483] [2020-12-23 09:28:12,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:28:12,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 09:28:12,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 09:28:12,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 67 conjunts are in the unsatisfiable core [2020-12-23 09:28:12,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:28:12,975 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-12-23 09:28:12,977 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:28:12,984 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:28:12,985 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:28:12,986 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2020-12-23 09:28:13,293 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:28:13,295 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 97 [2020-12-23 09:28:13,303 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-12-23 09:28:13,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:28:13,308 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:28:13,327 INFO L625 ElimStorePlain]: treesize reduction 23, result has 52.1 percent of original size [2020-12-23 09:28:13,328 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:28:13,329 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:25 [2020-12-23 09:28:13,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:28:13,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 09:28:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 09:28:13,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:28:13,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 27 [2020-12-23 09:28:13,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124576061] [2020-12-23 09:28:13,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 09:28:13,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:13,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 09:28:13,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2020-12-23 09:28:13,632 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 13 states. [2020-12-23 09:28:14,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:14,273 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2020-12-23 09:28:14,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 09:28:14,274 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2020-12-23 09:28:14,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:14,277 INFO L225 Difference]: With dead ends: 67 [2020-12-23 09:28:14,277 INFO L226 Difference]: Without dead ends: 65 [2020-12-23 09:28:14,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=110, Invalid=1012, Unknown=0, NotChecked=0, Total=1122 [2020-12-23 09:28:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-23 09:28:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2020-12-23 09:28:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-12-23 09:28:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2020-12-23 09:28:14,290 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 32 [2020-12-23 09:28:14,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:14,290 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2020-12-23 09:28:14,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 09:28:14,291 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2020-12-23 09:28:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 09:28:14,295 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:14,295 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:14,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:28:14,509 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:14,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:14,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1120401257, now seen corresponding path program 1 times [2020-12-23 09:28:14,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:14,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091350799] [2020-12-23 09:28:14,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:14,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-12-23 09:28:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:14,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:28:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:28:14,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091350799] [2020-12-23 09:28:14,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832424717] [2020-12-23 09:28:14,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:28:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:14,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 88 conjunts are in the unsatisfiable core [2020-12-23 09:28:14,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:28:14,940 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 09:28:14,941 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:28:14,949 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:28:14,955 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2020-12-23 09:28:14,956 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 09:28:14,965 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:28:14,966 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:28:14,966 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2020-12-23 09:28:15,007 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:28:15,008 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 09:28:15,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:28:15,016 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:28:15,026 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:28:15,032 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-12-23 09:28:15,034 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 09:28:15,044 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:28:15,045 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:28:15,046 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2020-12-23 09:28:15,120 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2020-12-23 09:28:15,122 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:28:15,135 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:28:15,140 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:28:15,140 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:40 [2020-12-23 09:28:15,218 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2020-12-23 09:28:15,220 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:28:15,245 INFO L625 ElimStorePlain]: treesize reduction 3, result has 93.0 percent of original size [2020-12-23 09:28:15,246 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 09:28:15,247 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:40 [2020-12-23 09:28:22,823 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2020-12-23 09:28:22,825 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:28:22,862 INFO L625 ElimStorePlain]: treesize reduction 3, result has 95.5 percent of original size [2020-12-23 09:28:22,867 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-23 09:28:22,868 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:63 [2020-12-23 09:28:22,922 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2020-12-23 09:28:22,924 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:28:22,934 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:28:22,934 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:28:22,935 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:31 [2020-12-23 09:28:23,613 WARN L860 $PredicateComparison]: unable to prove that (exists ((downsweep_~tmp~0 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ (* |c_downsweep_#in~left| 4) |c_downsweep_#in~a.offset|))) (store (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store .cse0 .cse1 (+ (select .cse0 .cse2) (select .cse0 .cse1)))) .cse2 downsweep_~tmp~0))))) is different from true [2020-12-23 09:28:23,637 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2020-12-23 09:28:23,639 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:28:23,651 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:28:23,653 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 09:28:23,654 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:61 [2020-12-23 09:28:24,329 WARN L197 SmtUtils]: Spent 623.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-12-23 09:28:25,056 WARN L197 SmtUtils]: Spent 670.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-23 09:28:25,790 WARN L197 SmtUtils]: Spent 661.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-12-23 09:28:26,511 WARN L197 SmtUtils]: Spent 652.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-12-23 09:28:26,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:28:26,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:28:26,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 09:28:26,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:28:26,567 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 09:28:26,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 09:28:26,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:28:26,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:28:26,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 09:28:26,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:28:26,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 09:28:26,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 09:28:26,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 09:28:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:27,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:28:27,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20] total 27 [2020-12-23 09:28:27,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977922684] [2020-12-23 09:28:27,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-23 09:28:27,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:27,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-23 09:28:27,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=573, Unknown=5, NotChecked=48, Total=702 [2020-12-23 09:28:27,120 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand 27 states. [2020-12-23 09:28:41,755 WARN L197 SmtUtils]: Spent 1.39 s on a formula simplification that was a NOOP. DAG size: 33 [2020-12-23 09:28:48,923 WARN L197 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 55 [2020-12-23 09:28:50,630 WARN L197 SmtUtils]: Spent 1.61 s on a formula simplification that was a NOOP. DAG size: 61 [2020-12-23 09:28:52,359 WARN L197 SmtUtils]: Spent 1.68 s on a formula simplification that was a NOOP. DAG size: 63 [2020-12-23 09:28:53,164 WARN L197 SmtUtils]: Spent 731.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-12-23 09:29:02,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:02,110 INFO L93 Difference]: Finished difference Result 144 states and 184 transitions. [2020-12-23 09:29:02,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-12-23 09:29:02,110 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2020-12-23 09:29:02,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:02,113 INFO L225 Difference]: With dead ends: 144 [2020-12-23 09:29:02,113 INFO L226 Difference]: Without dead ends: 111 [2020-12-23 09:29:02,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=318, Invalid=2229, Unknown=7, NotChecked=98, Total=2652 [2020-12-23 09:29:02,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-12-23 09:29:02,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 76. [2020-12-23 09:29:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-12-23 09:29:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2020-12-23 09:29:02,133 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 36 [2020-12-23 09:29:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:02,133 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2020-12-23 09:29:02,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-23 09:29:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2020-12-23 09:29:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 09:29:02,135 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:02,136 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:02,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:02,345 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:02,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:02,346 INFO L82 PathProgramCache]: Analyzing trace with hash 451063962, now seen corresponding path program 1 times [2020-12-23 09:29:02,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:02,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578780520] [2020-12-23 09:29:02,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:02,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-12-23 09:29:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:02,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-12-23 09:29:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 09:29:02,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578780520] [2020-12-23 09:29:02,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174109899] [2020-12-23 09:29:02,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:02,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 09:29:02,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 09:29:02,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:02,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2020-12-23 09:29:02,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783673630] [2020-12-23 09:29:02,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 09:29:02,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:02,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 09:29:02,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:29:02,635 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand 12 states. [2020-12-23 09:29:02,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:02,857 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2020-12-23 09:29:02,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 09:29:02,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-12-23 09:29:02,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:02,859 INFO L225 Difference]: With dead ends: 100 [2020-12-23 09:29:02,859 INFO L226 Difference]: Without dead ends: 80 [2020-12-23 09:29:02,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:29:02,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-12-23 09:29:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2020-12-23 09:29:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-12-23 09:29:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2020-12-23 09:29:02,873 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 39 [2020-12-23 09:29:02,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:02,874 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2020-12-23 09:29:02,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 09:29:02,874 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2020-12-23 09:29:02,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-23 09:29:02,876 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:02,876 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:03,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:03,091 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:03,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:03,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1049653485, now seen corresponding path program 2 times [2020-12-23 09:29:03,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:03,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540362153] [2020-12-23 09:29:03,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:03,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-12-23 09:29:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:03,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-12-23 09:29:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:03,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540362153] [2020-12-23 09:29:03,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824551796] [2020-12-23 09:29:03,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:03,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 09:29:03,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 09:29:03,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-23 09:29:03,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:03,461 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 09:29:03,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:03,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2020-12-23 09:29:03,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175280505] [2020-12-23 09:29:03,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 09:29:03,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:03,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 09:29:03,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:29:03,463 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 15 states. [2020-12-23 09:29:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:03,782 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2020-12-23 09:29:03,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 09:29:03,783 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-12-23 09:29:03,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:03,785 INFO L225 Difference]: With dead ends: 104 [2020-12-23 09:29:03,785 INFO L226 Difference]: Without dead ends: 88 [2020-12-23 09:29:03,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2020-12-23 09:29:03,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-12-23 09:29:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2020-12-23 09:29:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-12-23 09:29:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2020-12-23 09:29:03,798 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 41 [2020-12-23 09:29:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:03,799 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2020-12-23 09:29:03,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 09:29:03,799 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2020-12-23 09:29:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-23 09:29:03,800 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:03,801 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:04,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 09:29:04,015 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:04,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:04,016 INFO L82 PathProgramCache]: Analyzing trace with hash 207235141, now seen corresponding path program 1 times [2020-12-23 09:29:04,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:04,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986990790] [2020-12-23 09:29:04,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:04,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-12-23 09:29:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:04,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-12-23 09:29:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:04,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:29:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:04,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-12-23 09:29:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 09:29:04,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986990790] [2020-12-23 09:29:04,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116109151] [2020-12-23 09:29:04,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:04,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-23 09:29:04,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 09:29:04,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:04,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2020-12-23 09:29:04,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009964569] [2020-12-23 09:29:04,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-23 09:29:04,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:04,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-23 09:29:04,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2020-12-23 09:29:04,513 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 18 states. [2020-12-23 09:29:05,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:05,022 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2020-12-23 09:29:05,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 09:29:05,023 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2020-12-23 09:29:05,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:05,024 INFO L225 Difference]: With dead ends: 73 [2020-12-23 09:29:05,024 INFO L226 Difference]: Without dead ends: 59 [2020-12-23 09:29:05,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2020-12-23 09:29:05,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-12-23 09:29:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2020-12-23 09:29:05,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-12-23 09:29:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-12-23 09:29:05,032 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 43 [2020-12-23 09:29:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:05,033 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-12-23 09:29:05,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-23 09:29:05,033 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-12-23 09:29:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 09:29:05,034 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:05,035 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:05,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:05,250 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:05,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:05,251 INFO L82 PathProgramCache]: Analyzing trace with hash -421543614, now seen corresponding path program 1 times [2020-12-23 09:29:05,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:05,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18625404] [2020-12-23 09:29:05,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:05,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-23 09:29:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:05,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:29:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:05,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-12-23 09:29:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:05,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:29:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:05,397 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-23 09:29:05,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18625404] [2020-12-23 09:29:05,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226112791] [2020-12-23 09:29:05,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:05,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 09:29:05,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-23 09:29:05,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:05,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2020-12-23 09:29:05,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129708321] [2020-12-23 09:29:05,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 09:29:05,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:05,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 09:29:05,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:29:05,609 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 11 states. [2020-12-23 09:29:05,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:05,765 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2020-12-23 09:29:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 09:29:05,766 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2020-12-23 09:29:05,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:05,767 INFO L225 Difference]: With dead ends: 53 [2020-12-23 09:29:05,767 INFO L226 Difference]: Without dead ends: 46 [2020-12-23 09:29:05,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:29:05,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-23 09:29:05,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-12-23 09:29:05,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-12-23 09:29:05,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2020-12-23 09:29:05,775 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 46 [2020-12-23 09:29:05,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:05,776 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2020-12-23 09:29:05,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 09:29:05,776 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2020-12-23 09:29:05,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-23 09:29:05,777 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:05,777 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:05,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:05,991 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:05,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:05,992 INFO L82 PathProgramCache]: Analyzing trace with hash -156199390, now seen corresponding path program 1 times [2020-12-23 09:29:05,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:05,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629217987] [2020-12-23 09:29:05,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:06,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-12-23 09:29:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:06,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:29:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:06,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-12-23 09:29:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:06,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:29:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:06,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:29:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:06,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-12-23 09:29:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-23 09:29:06,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629217987] [2020-12-23 09:29:06,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551045744] [2020-12-23 09:29:06,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:06,333 WARN L261 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 152 conjunts are in the unsatisfiable core [2020-12-23 09:29:06,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:06,401 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 09:29:06,402 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:29:06,410 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:29:06,414 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2020-12-23 09:29:06,415 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 09:29:06,422 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:29:06,423 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:29:06,423 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2020-12-23 09:29:06,460 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:29:06,461 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 09:29:06,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:29:06,464 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:29:06,473 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:29:06,477 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-12-23 09:29:06,479 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 09:29:06,488 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:29:06,489 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:29:06,489 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2020-12-23 09:29:06,578 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2020-12-23 09:29:06,581 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:29:06,595 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:29:06,596 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:29:06,596 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:40 [2020-12-23 09:29:06,678 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2020-12-23 09:29:06,680 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:29:06,693 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:29:06,694 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 09:29:06,695 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:41 [2020-12-23 09:29:06,784 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2020-12-23 09:29:06,786 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:29:06,815 INFO L625 ElimStorePlain]: treesize reduction 3, result has 93.0 percent of original size [2020-12-23 09:29:06,817 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 09:29:06,817 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:40 [2020-12-23 09:29:08,874 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 29 [2020-12-23 09:29:10,942 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2020-12-23 09:29:13,000 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2020-12-23 09:29:15,138 WARN L860 $PredicateComparison]: unable to prove that (exists ((upsweep_~left Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (let ((.cse1 (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|)) (.cse0 (select |c_old(#memory_int)| |c_upsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 (+ (* upsweep_~left 4) |c_upsweep_#in~a.offset|)))))))) is different from true [2020-12-23 09:29:18,787 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 32 [2020-12-23 09:29:26,893 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 41 [2020-12-23 09:29:33,025 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 208 [2020-12-23 09:29:33,026 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:29:33,056 INFO L625 ElimStorePlain]: treesize reduction 3, result has 98.8 percent of original size [2020-12-23 09:29:33,059 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-23 09:29:33,059 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:266, output treesize:238 [2020-12-23 09:29:33,135 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2020-12-23 09:29:33,136 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:29:33,147 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 09:29:33,149 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 09:29:33,149 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:41 [2020-12-23 09:29:35,359 WARN L860 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (downsweep_~tmp~0 Int)) (and (<= downsweep_~left |c_downsweep_#in~left|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ (* downsweep_~left 4) |c_downsweep_#in~a.offset|))) (store (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store .cse0 .cse1 (+ (select .cse0 .cse2) (select .cse0 .cse1)))) .cse2 downsweep_~tmp~0)))))) is different from true [2020-12-23 09:29:39,512 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 46 [2020-12-23 09:29:41,552 WARN L860 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (downsweep_~right Int) (downsweep_~tmp~0 Int) (downsweep_~a.offset Int)) (and (<= |c_downsweep_#in~a.offset| downsweep_~a.offset) (<= |c_downsweep_#in~left| downsweep_~left) (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ (* downsweep_~left 4) downsweep_~a.offset))) (store (let ((.cse1 (+ (* downsweep_~right 4) downsweep_~a.offset)) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 downsweep_~tmp~0)))) (<= |c_downsweep_#in~right| downsweep_~right))) is different from true [2020-12-23 09:29:47,817 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 57 [2020-12-23 09:29:48,026 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 624 treesize of output 576 [2020-12-23 09:29:48,027 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 09:29:48,227 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2020-12-23 09:29:48,228 INFO L625 ElimStorePlain]: treesize reduction 29, result has 96.1 percent of original size [2020-12-23 09:29:48,338 INFO L547 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 1 xjuncts. [2020-12-23 09:29:48,338 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 15 variables, input treesize:781, output treesize:721 [2020-12-23 09:29:50,418 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~a0~0.base Int) (ULTIMATE.start_main_~a0~0.offset Int)) (and (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 (+ ULTIMATE.start_main_~a0~0.offset 8) (select .cse0 (+ c_ULTIMATE.start_main_~a~0.offset 8)))) (select |c_#memory_int| ULTIMATE.start_main_~a0~0.base)) (not (= ULTIMATE.start_main_~a0~0.base c_ULTIMATE.start_main_~a~0.base)))) (exists ((v_downsweep_~a.offset_6 Int) (v_downsweep_~left_6 Int) (aux_mod_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129 Int) (aux_div_aux_div_aux_mod_ULTIMATE.start_main_~n~0_32_89_105 Int) (aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 Int) (v_downsweep_~tmp~0_2 Int) (aux_div_ULTIMATE.start_main_~n~0_32 Int) (downsweep_~tmp~0 Int) (v_downsweep_~right_6 Int) (downsweep_~left Int) (aux_mod_aux_div_aux_mod_ULTIMATE.start_main_~n~0_32_89_105 Int) (aux_div_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129 Int)) (let ((.cse4 (* 2 aux_mod_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129)) (.cse5 (* 4 aux_div_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129))) (let ((.cse2 (* 4 aux_div_aux_div_aux_mod_ULTIMATE.start_main_~n~0_32_89_105)) (.cse3 (* 2 aux_mod_aux_div_aux_mod_ULTIMATE.start_main_~n~0_32_89_105)) (.cse1 (+ .cse4 .cse5))) (and (<= .cse1 (+ aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 3)) (< aux_mod_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129 2) (< .cse1 (+ aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 (* 2 aux_div_ULTIMATE.start_main_~n~0_32) 2)) (<= .cse1 (+ .cse2 aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 .cse3)) (< (+ .cse2 .cse3 aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198) (+ .cse4 .cse5 2)) (< (+ aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 aux_div_ULTIMATE.start_main_~n~0_32 1) .cse1) (<= c_ULTIMATE.start_main_~a~0.offset v_downsweep_~a.offset_6) (<= .cse1 (+ downsweep_~left aux_div_aux_div_aux_mod_ULTIMATE.start_main_~n~0_32_89_105 aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 1)) (< aux_mod_aux_div_aux_mod_ULTIMATE.start_main_~n~0_32_89_105 2) (<= .cse1 (+ aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 v_downsweep_~right_6 1)) (= (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base) (let ((.cse8 (+ v_downsweep_~a.offset_6 (* downsweep_~left 4)))) (store (let ((.cse6 (let ((.cse12 (+ (* v_downsweep_~left_6 4) c_ULTIMATE.start_main_~a~0.offset))) (store (let ((.cse13 ((as const (Array Int Int)) 0)) (.cse14 (+ (* aux_mod_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129 8) c_ULTIMATE.start_main_~a~0.offset (* aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 (- 4)) (* aux_div_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129 16) (- 4)))) (let ((.cse11 (select .cse13 .cse14)) (.cse10 (+ c_ULTIMATE.start_main_~a~0.offset (* (div (+ (* aux_mod_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129 2) (* aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 (- 1)) (* aux_div_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129 4)) 2) 4) (- 4)))) (let ((.cse9 (store .cse13 .cse14 (+ .cse11 (select .cse13 .cse10))))) (store .cse9 .cse10 (+ .cse11 (select (store .cse9 .cse10 .cse11) .cse12)))))) .cse12 downsweep_~tmp~0))) (.cse7 (+ v_downsweep_~a.offset_6 (* v_downsweep_~right_6 4)))) (store .cse6 .cse7 (+ (select .cse6 .cse8) (select .cse6 .cse7)))) .cse8 v_downsweep_~tmp~0_2))) (<= 0 aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198) (< aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 2) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129) (<= (+ v_downsweep_~left_6 aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198 1) (+ aux_mod_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129 aux_div_aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~n~0_32_89_198_129)) (<= 0 aux_mod_aux_div_aux_mod_ULTIMATE.start_main_~n~0_32_89_105)))))) is different from true [2020-12-23 09:29:54,834 WARN L197 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 108 [2020-12-23 09:29:54,909 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 09:29:54,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 09:29:54,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 09:29:54,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 09:29:54,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 19 disjuncts [2020-12-23 09:29:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 13 not checked. [2020-12-23 09:29:55,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:55,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 29] total 38 [2020-12-23 09:29:55,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403884566] [2020-12-23 09:29:55,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-12-23 09:29:55,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:55,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-12-23 09:29:55,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1028, Unknown=14, NotChecked=268, Total=1406 [2020-12-23 09:29:55,095 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 38 states. [2020-12-23 09:30:06,768 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 47 [2020-12-23 09:31:18,562 WARN L197 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 114 [2020-12-23 09:31:29,035 WARN L197 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 118 [2020-12-23 09:31:35,303 WARN L197 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 120 [2020-12-23 09:31:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:39,686 INFO L93 Difference]: Finished difference Result 112 states and 154 transitions. [2020-12-23 09:31:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-12-23 09:31:39,687 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 56 [2020-12-23 09:31:39,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:39,688 INFO L225 Difference]: With dead ends: 112 [2020-12-23 09:31:39,688 INFO L226 Difference]: Without dead ends: 71 [2020-12-23 09:31:39,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 71.0s TimeCoverageRelationStatistics Valid=228, Invalid=2526, Unknown=18, NotChecked=420, Total=3192 [2020-12-23 09:31:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-23 09:31:39,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2020-12-23 09:31:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-23 09:31:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2020-12-23 09:31:39,706 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 56 [2020-12-23 09:31:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:39,707 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2020-12-23 09:31:39,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-12-23 09:31:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2020-12-23 09:31:39,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 09:31:39,708 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:39,709 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:39,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 09:31:39,912 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:39,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:39,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1334063917, now seen corresponding path program 1 times [2020-12-23 09:31:39,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:39,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060618887] [2020-12-23 09:31:39,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:41,537 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2020-12-23 09:31:41,837 WARN L197 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2020-12-23 09:31:45,145 WARN L197 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2020-12-23 09:31:45,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-12-23 09:31:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:45,832 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2020-12-23 09:31:46,283 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 45 [2020-12-23 09:31:46,760 WARN L197 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 34 [2020-12-23 09:31:46,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:31:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:46,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-12-23 09:31:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:47,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-12-23 09:31:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat