/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/array-crafted/bor5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 10:34:12,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 10:34:12,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 10:34:13,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 10:34:13,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 10:34:13,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 10:34:13,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 10:34:13,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 10:34:13,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 10:34:13,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 10:34:13,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 10:34:13,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 10:34:13,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 10:34:13,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 10:34:13,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 10:34:13,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 10:34:13,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 10:34:13,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 10:34:13,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 10:34:13,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 10:34:13,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 10:34:13,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 10:34:13,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 10:34:13,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 10:34:13,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 10:34:13,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 10:34:13,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 10:34:13,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 10:34:13,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 10:34:13,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 10:34:13,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 10:34:13,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 10:34:13,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 10:34:13,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 10:34:13,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 10:34:13,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 10:34:13,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 10:34:13,143 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 10:34:13,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 10:34:13,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 10:34:13,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 10:34:13,150 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 10:34:13,199 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 10:34:13,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 10:34:13,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 10:34:13,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 10:34:13,205 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 10:34:13,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 10:34:13,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 10:34:13,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 10:34:13,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 10:34:13,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 10:34:13,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 10:34:13,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 10:34:13,208 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 10:34:13,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 10:34:13,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 10:34:13,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 10:34:13,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 10:34:13,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 10:34:13,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 10:34:13,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 10:34:13,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 10:34:13,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 10:34:13,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 10:34:13,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 10:34:13,211 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 10:34:13,211 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 [2021-01-06 10:34:13,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 10:34:13,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 10:34:13,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 10:34:13,624 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 10:34:13,625 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 10:34:13,626 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bor5.i [2021-01-06 10:34:13,724 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cbbb3497c/ec9476ababe149c7b5f77b0602464708/FLAG4bdcd086f [2021-01-06 10:34:14,321 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 10:34:14,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/array-crafted/bor5.i [2021-01-06 10:34:14,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cbbb3497c/ec9476ababe149c7b5f77b0602464708/FLAG4bdcd086f [2021-01-06 10:34:14,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cbbb3497c/ec9476ababe149c7b5f77b0602464708 [2021-01-06 10:34:14,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 10:34:14,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 10:34:14,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 10:34:14,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 10:34:14,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 10:34:14,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 10:34:14" (1/1) ... [2021-01-06 10:34:14,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d4a0001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:34:14, skipping insertion in model container [2021-01-06 10:34:14,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 10:34:14" (1/1) ... [2021-01-06 10:34:14,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 10:34:14,763 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~res~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~N~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IdentifierExpression[~i~1,]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: VariableLHS[~ret2~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IdentifierExpression[~i~2,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[BinaryExpression[ARITHMINUS,IdentifierExpression[~N~0,GLOBAL],IntegerLiteral[1]]]] left hand side expression in assignment: lhs: VariableLHS[~ret5~0,] [2021-01-06 10:34:15,013 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/array-crafted/bor5.i[1364,1377] [2021-01-06 10:34:15,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 10:34:15,026 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~res~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~N~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#x~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~1,]]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],StructAccessExpression[IdentifierExpression[~#x~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#x~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret2~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#x~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~2,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#x~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMINUS,IdentifierExpression[~N~0,GLOBAL],IntegerLiteral[1]]]]]] left hand side expression in assignment: lhs: VariableLHS[~ret5~0,] [2021-01-06 10:34:15,064 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/array-crafted/bor5.i[1364,1377] [2021-01-06 10:34:15,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 10:34:15,089 INFO L208 MainTranslator]: Completed translation [2021-01-06 10:34:15,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:34:15 WrapperNode [2021-01-06 10:34:15,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 10:34:15,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 10:34:15,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 10:34:15,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 10:34:15,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:34:15" (1/1) ... [2021-01-06 10:34:15,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:34:15" (1/1) ... [2021-01-06 10:34:15,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 10:34:15,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 10:34:15,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 10:34:15,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 10:34:15,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:34:15" (1/1) ... [2021-01-06 10:34:15,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:34:15" (1/1) ... [2021-01-06 10:34:15,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:34:15" (1/1) ... [2021-01-06 10:34:15,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:34:15" (1/1) ... [2021-01-06 10:34:15,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:34:15" (1/1) ... [2021-01-06 10:34:15,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:34:15" (1/1) ... [2021-01-06 10:34:15,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:34:15" (1/1) ... [2021-01-06 10:34:15,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 10:34:15,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 10:34:15,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 10:34:15,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 10:34:15,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:34:15" (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 [2021-01-06 10:34:15,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 10:34:15,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 10:34:15,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 10:34:15,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 10:34:15,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 10:34:15,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 10:34:15,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 10:34:15,805 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 10:34:15,808 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-01-06 10:34:15,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 10:34:15 BoogieIcfgContainer [2021-01-06 10:34:15,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 10:34:15,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 10:34:15,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 10:34:15,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 10:34:15,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 10:34:14" (1/3) ... [2021-01-06 10:34:15,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4624a964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 10:34:15, skipping insertion in model container [2021-01-06 10:34:15,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:34:15" (2/3) ... [2021-01-06 10:34:15,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4624a964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 10:34:15, skipping insertion in model container [2021-01-06 10:34:15,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 10:34:15" (3/3) ... [2021-01-06 10:34:15,824 INFO L111 eAbstractionObserver]: Analyzing ICFG bor5.i [2021-01-06 10:34:15,832 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 10:34:15,839 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 10:34:15,861 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 10:34:15,908 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 10:34:15,909 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 10:34:15,909 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 10:34:15,909 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 10:34:15,909 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 10:34:15,909 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 10:34:15,909 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 10:34:15,910 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 10:34:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2021-01-06 10:34:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 10:34:15,941 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:34:15,942 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:34:15,942 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:34:15,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:34:15,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1609849564, now seen corresponding path program 1 times [2021-01-06 10:34:15,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:34:15,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846197619] [2021-01-06 10:34:15,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:34:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 10:34:16,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846197619] [2021-01-06 10:34:16,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 10:34:16,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 10:34:16,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693684471] [2021-01-06 10:34:16,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 10:34:16,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:34:16,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 10:34:16,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 10:34:16,168 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2021-01-06 10:34:16,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:34:16,199 INFO L93 Difference]: Finished difference Result 83 states and 126 transitions. [2021-01-06 10:34:16,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 10:34:16,201 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2021-01-06 10:34:16,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:34:16,212 INFO L225 Difference]: With dead ends: 83 [2021-01-06 10:34:16,212 INFO L226 Difference]: Without dead ends: 39 [2021-01-06 10:34:16,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 10:34:16,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-01-06 10:34:16,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-01-06 10:34:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2021-01-06 10:34:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2021-01-06 10:34:16,256 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 18 [2021-01-06 10:34:16,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:34:16,256 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2021-01-06 10:34:16,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 10:34:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2021-01-06 10:34:16,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 10:34:16,258 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:34:16,258 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:34:16,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 10:34:16,259 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:34:16,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:34:16,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1232465378, now seen corresponding path program 1 times [2021-01-06 10:34:16,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:34:16,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227080654] [2021-01-06 10:34:16,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:34:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 10:34:16,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227080654] [2021-01-06 10:34:16,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 10:34:16,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 10:34:16,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166084951] [2021-01-06 10:34:16,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 10:34:16,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:34:16,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 10:34:16,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 10:34:16,341 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 3 states. [2021-01-06 10:34:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:34:16,419 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2021-01-06 10:34:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 10:34:16,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2021-01-06 10:34:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:34:16,423 INFO L225 Difference]: With dead ends: 75 [2021-01-06 10:34:16,424 INFO L226 Difference]: Without dead ends: 41 [2021-01-06 10:34:16,426 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 10:34:16,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-01-06 10:34:16,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2021-01-06 10:34:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2021-01-06 10:34:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2021-01-06 10:34:16,444 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 18 [2021-01-06 10:34:16,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:34:16,445 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2021-01-06 10:34:16,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 10:34:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2021-01-06 10:34:16,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 10:34:16,447 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:34:16,447 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] [2021-01-06 10:34:16,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 10:34:16,448 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:34:16,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:34:16,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1364850500, now seen corresponding path program 1 times [2021-01-06 10:34:16,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:34:16,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126302522] [2021-01-06 10:34:16,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:34:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 10:34:16,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126302522] [2021-01-06 10:34:16,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 10:34:16,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 10:34:16,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113797103] [2021-01-06 10:34:16,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 10:34:16,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:34:16,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 10:34:16,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 10:34:16,559 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand 4 states. [2021-01-06 10:34:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:34:16,631 INFO L93 Difference]: Finished difference Result 87 states and 128 transitions. [2021-01-06 10:34:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 10:34:16,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2021-01-06 10:34:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:34:16,633 INFO L225 Difference]: With dead ends: 87 [2021-01-06 10:34:16,634 INFO L226 Difference]: Without dead ends: 61 [2021-01-06 10:34:16,634 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 10:34:16,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-01-06 10:34:16,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2021-01-06 10:34:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2021-01-06 10:34:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2021-01-06 10:34:16,643 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 20 [2021-01-06 10:34:16,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:34:16,643 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2021-01-06 10:34:16,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 10:34:16,643 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2021-01-06 10:34:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 10:34:16,645 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:34:16,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:34:16,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 10:34:16,645 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:34:16,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:34:16,646 INFO L82 PathProgramCache]: Analyzing trace with hash -173443593, now seen corresponding path program 1 times [2021-01-06 10:34:16,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:34:16,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459053271] [2021-01-06 10:34:16,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:34:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 10:34:16,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459053271] [2021-01-06 10:34:16,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 10:34:16,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 10:34:16,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841580663] [2021-01-06 10:34:16,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 10:34:16,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:34:16,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 10:34:16,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 10:34:16,761 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand 4 states. [2021-01-06 10:34:16,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:34:16,808 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2021-01-06 10:34:16,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 10:34:16,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2021-01-06 10:34:16,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:34:16,810 INFO L225 Difference]: With dead ends: 59 [2021-01-06 10:34:16,810 INFO L226 Difference]: Without dead ends: 45 [2021-01-06 10:34:16,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 10:34:16,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-01-06 10:34:16,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2021-01-06 10:34:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2021-01-06 10:34:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2021-01-06 10:34:16,819 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 32 [2021-01-06 10:34:16,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:34:16,820 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2021-01-06 10:34:16,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 10:34:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2021-01-06 10:34:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-06 10:34:16,821 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:34:16,821 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:34:16,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 10:34:16,822 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:34:16,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:34:16,823 INFO L82 PathProgramCache]: Analyzing trace with hash -879557547, now seen corresponding path program 1 times [2021-01-06 10:34:16,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:34:16,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781311765] [2021-01-06 10:34:16,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:34:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 10:34:16,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781311765] [2021-01-06 10:34:16,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225228528] [2021-01-06 10:34:16,928 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 [2021-01-06 10:34:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:17,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 10:34:17,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:34:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 10:34:17,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:34:17,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-01-06 10:34:17,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603128008] [2021-01-06 10:34:17,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 10:34:17,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:34:17,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 10:34:17,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-06 10:34:17,210 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 6 states. [2021-01-06 10:34:17,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:34:17,289 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2021-01-06 10:34:17,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 10:34:17,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2021-01-06 10:34:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:34:17,290 INFO L225 Difference]: With dead ends: 85 [2021-01-06 10:34:17,291 INFO L226 Difference]: Without dead ends: 47 [2021-01-06 10:34:17,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-06 10:34:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-01-06 10:34:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2021-01-06 10:34:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-01-06 10:34:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2021-01-06 10:34:17,299 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 34 [2021-01-06 10:34:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:34:17,299 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2021-01-06 10:34:17,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 10:34:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2021-01-06 10:34:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 10:34:17,301 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:34:17,301 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, 1, 1, 1, 1] [2021-01-06 10:34:17,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:34:17,516 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:34:17,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:34:17,518 INFO L82 PathProgramCache]: Analyzing trace with hash 836370163, now seen corresponding path program 2 times [2021-01-06 10:34:17,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:34:17,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932574543] [2021-01-06 10:34:17,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:34:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 10:34:18,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932574543] [2021-01-06 10:34:18,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 10:34:18,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 10:34:18,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052172560] [2021-01-06 10:34:18,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 10:34:18,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:34:18,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 10:34:18,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-01-06 10:34:18,103 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand 11 states. [2021-01-06 10:34:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:34:18,427 INFO L93 Difference]: Finished difference Result 191 states and 266 transitions. [2021-01-06 10:34:18,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 10:34:18,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2021-01-06 10:34:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:34:18,434 INFO L225 Difference]: With dead ends: 191 [2021-01-06 10:34:18,434 INFO L226 Difference]: Without dead ends: 152 [2021-01-06 10:34:18,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-01-06 10:34:18,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-01-06 10:34:18,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 105. [2021-01-06 10:34:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2021-01-06 10:34:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2021-01-06 10:34:18,474 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 36 [2021-01-06 10:34:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:34:18,475 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2021-01-06 10:34:18,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 10:34:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2021-01-06 10:34:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 10:34:18,482 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:34:18,482 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, 1, 1, 1, 1, 1] [2021-01-06 10:34:18,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 10:34:18,483 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:34:18,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:34:18,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1865103948, now seen corresponding path program 1 times [2021-01-06 10:34:18,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:34:18,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943349342] [2021-01-06 10:34:18,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:34:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 10:34:18,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943349342] [2021-01-06 10:34:18,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216424489] [2021-01-06 10:34:18,887 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 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 [2021-01-06 10:34:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:18,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 42 conjunts are in the unsatisfiable core [2021-01-06 10:34:18,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:34:19,137 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 37 treesize of output 21 [2021-01-06 10:34:19,139 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:19,150 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:19,151 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:34:19,151 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:28 [2021-01-06 10:34:19,205 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:19,206 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2021-01-06 10:34:19,210 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:19,214 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:19,215 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:34:19,216 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:7 [2021-01-06 10:34:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 10:34:19,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:34:19,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-01-06 10:34:19,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592167693] [2021-01-06 10:34:19,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 10:34:19,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:34:19,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 10:34:19,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-01-06 10:34:19,267 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand 16 states. [2021-01-06 10:34:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:34:20,182 INFO L93 Difference]: Finished difference Result 321 states and 470 transitions. [2021-01-06 10:34:20,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 10:34:20,183 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2021-01-06 10:34:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:34:20,184 INFO L225 Difference]: With dead ends: 321 [2021-01-06 10:34:20,185 INFO L226 Difference]: Without dead ends: 246 [2021-01-06 10:34:20,186 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2021-01-06 10:34:20,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-01-06 10:34:20,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 131. [2021-01-06 10:34:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2021-01-06 10:34:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2021-01-06 10:34:20,200 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 37 [2021-01-06 10:34:20,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:34:20,201 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2021-01-06 10:34:20,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 10:34:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2021-01-06 10:34:20,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 10:34:20,203 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:34:20,203 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, 1, 1, 1, 1, 1] [2021-01-06 10:34:20,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:34:20,418 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:34:20,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:34:20,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1149771322, now seen corresponding path program 1 times [2021-01-06 10:34:20,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:34:20,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70926553] [2021-01-06 10:34:20,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:34:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:21,116 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 10:34:21,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70926553] [2021-01-06 10:34:21,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556572784] [2021-01-06 10:34:21,117 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 [2021-01-06 10:34:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:21,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 48 conjunts are in the unsatisfiable core [2021-01-06 10:34:21,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:34:21,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:21,374 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 22 treesize of output 17 [2021-01-06 10:34:21,376 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:21,388 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:21,390 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:34:21,391 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:27 [2021-01-06 10:34:21,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:34:21,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:34:21,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:21,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:21,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:34:21,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:34:21,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:34:21,611 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-01-06 10:34:21,613 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:21,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:21,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:21,621 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:34:21,627 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:34:21,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:34:21,630 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-01-06 10:34:21,633 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:21,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:21,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:21,640 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:34:21,642 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-01-06 10:34:21,646 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:21,677 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:21,678 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-01-06 10:34:21,679 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:148, output treesize:107 [2021-01-06 10:34:21,761 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 5, 1] term [2021-01-06 10:34:21,761 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 10:34:21,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:21,780 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:34:21,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 44 treesize of output 23 [2021-01-06 10:34:21,786 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:21,889 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2021-01-06 10:34:21,891 INFO L625 ElimStorePlain]: treesize reduction 19, result has 88.4 percent of original size [2021-01-06 10:34:21,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:21,899 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:34:21,902 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 43 treesize of output 23 [2021-01-06 10:34:21,904 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:21,948 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:21,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:21,957 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:34:21,960 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 45 treesize of output 23 [2021-01-06 10:34:21,968 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:22,010 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:22,011 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-01-06 10:34:22,012 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:191, output treesize:91 [2021-01-06 10:34:22,081 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 5, 1] term [2021-01-06 10:34:22,081 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 10:34:22,098 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:22,098 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2021-01-06 10:34:22,100 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:22,117 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:22,120 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:22,121 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2021-01-06 10:34:22,123 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:22,136 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:22,139 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:22,140 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2021-01-06 10:34:22,142 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:22,152 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:22,153 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-01-06 10:34:22,154 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:88, output treesize:22 [2021-01-06 10:34:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 10:34:22,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:34:22,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 28 [2021-01-06 10:34:22,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335055979] [2021-01-06 10:34:22,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-01-06 10:34:22,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:34:22,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-01-06 10:34:22,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2021-01-06 10:34:22,274 INFO L87 Difference]: Start difference. First operand 131 states and 188 transitions. Second operand 28 states. [2021-01-06 10:34:23,543 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2021-01-06 10:34:23,859 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2021-01-06 10:34:24,208 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2021-01-06 10:34:24,554 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2021-01-06 10:34:25,183 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2021-01-06 10:34:25,418 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2021-01-06 10:34:25,903 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2021-01-06 10:34:26,231 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2021-01-06 10:34:26,840 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2021-01-06 10:34:27,012 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2021-01-06 10:34:27,306 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2021-01-06 10:34:27,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:34:27,745 INFO L93 Difference]: Finished difference Result 741 states and 1010 transitions. [2021-01-06 10:34:27,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-01-06 10:34:27,746 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 37 [2021-01-06 10:34:27,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:34:27,750 INFO L225 Difference]: With dead ends: 741 [2021-01-06 10:34:27,750 INFO L226 Difference]: Without dead ends: 666 [2021-01-06 10:34:27,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=831, Invalid=3459, Unknown=0, NotChecked=0, Total=4290 [2021-01-06 10:34:27,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-01-06 10:34:27,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 225. [2021-01-06 10:34:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2021-01-06 10:34:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 325 transitions. [2021-01-06 10:34:27,783 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 325 transitions. Word has length 37 [2021-01-06 10:34:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:34:27,783 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 325 transitions. [2021-01-06 10:34:27,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2021-01-06 10:34:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 325 transitions. [2021-01-06 10:34:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-06 10:34:27,786 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:34:27,786 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, 1, 1, 1, 1, 1, 1] [2021-01-06 10:34:27,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:34:28,000 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:34:28,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:34:28,001 INFO L82 PathProgramCache]: Analyzing trace with hash -691304413, now seen corresponding path program 1 times [2021-01-06 10:34:28,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:34:28,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109332777] [2021-01-06 10:34:28,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:34:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 10:34:28,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109332777] [2021-01-06 10:34:28,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741020321] [2021-01-06 10:34:28,662 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 [2021-01-06 10:34:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:28,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 59 conjunts are in the unsatisfiable core [2021-01-06 10:34:28,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:34:28,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:28,858 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 34 treesize of output 20 [2021-01-06 10:34:28,859 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:28,866 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:28,868 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:34:28,869 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:27 [2021-01-06 10:34:29,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:29,004 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:29,004 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 1 case distinctions, treesize of input 41 treesize of output 26 [2021-01-06 10:34:29,011 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:29,019 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:29,020 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:34:29,020 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:30 [2021-01-06 10:34:29,086 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 26 treesize of output 21 [2021-01-06 10:34:29,088 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:29,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:29,097 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:34:29,097 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:28 [2021-01-06 10:34:29,136 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:29,136 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2021-01-06 10:34:29,138 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:29,141 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:29,146 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:34:29,149 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:7 [2021-01-06 10:34:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 10:34:29,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:34:29,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 28 [2021-01-06 10:34:29,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139407058] [2021-01-06 10:34:29,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-01-06 10:34:29,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:34:29,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-01-06 10:34:29,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2021-01-06 10:34:29,183 INFO L87 Difference]: Start difference. First operand 225 states and 325 transitions. Second operand 28 states. [2021-01-06 10:34:32,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:34:32,688 INFO L93 Difference]: Finished difference Result 806 states and 1184 transitions. [2021-01-06 10:34:32,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-01-06 10:34:32,689 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2021-01-06 10:34:32,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:34:32,694 INFO L225 Difference]: With dead ends: 806 [2021-01-06 10:34:32,694 INFO L226 Difference]: Without dead ends: 773 [2021-01-06 10:34:32,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1014, Invalid=3276, Unknown=0, NotChecked=0, Total=4290 [2021-01-06 10:34:32,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2021-01-06 10:34:32,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 338. [2021-01-06 10:34:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2021-01-06 10:34:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 493 transitions. [2021-01-06 10:34:32,732 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 493 transitions. Word has length 38 [2021-01-06 10:34:32,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:34:32,733 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 493 transitions. [2021-01-06 10:34:32,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2021-01-06 10:34:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 493 transitions. [2021-01-06 10:34:32,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-06 10:34:32,736 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:34:32,736 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, 1, 1, 1, 1, 1, 1] [2021-01-06 10:34:32,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:34:32,952 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:34:32,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:34:32,952 INFO L82 PathProgramCache]: Analyzing trace with hash 443643566, now seen corresponding path program 1 times [2021-01-06 10:34:32,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:34:32,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504265295] [2021-01-06 10:34:32,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:34:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 10:34:32,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504265295] [2021-01-06 10:34:32,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 10:34:32,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 10:34:32,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254456149] [2021-01-06 10:34:32,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 10:34:32,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:34:32,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 10:34:32,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 10:34:32,991 INFO L87 Difference]: Start difference. First operand 338 states and 493 transitions. Second operand 4 states. [2021-01-06 10:34:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:34:33,100 INFO L93 Difference]: Finished difference Result 686 states and 990 transitions. [2021-01-06 10:34:33,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 10:34:33,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2021-01-06 10:34:33,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:34:33,103 INFO L225 Difference]: With dead ends: 686 [2021-01-06 10:34:33,103 INFO L226 Difference]: Without dead ends: 366 [2021-01-06 10:34:33,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 10:34:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-01-06 10:34:33,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 338. [2021-01-06 10:34:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2021-01-06 10:34:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 462 transitions. [2021-01-06 10:34:33,129 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 462 transitions. Word has length 38 [2021-01-06 10:34:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:34:33,130 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 462 transitions. [2021-01-06 10:34:33,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 10:34:33,130 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 462 transitions. [2021-01-06 10:34:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 10:34:33,131 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:34:33,132 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, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:34:33,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 10:34:33,132 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:34:33,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:34:33,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1036499722, now seen corresponding path program 1 times [2021-01-06 10:34:33,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:34:33,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350850811] [2021-01-06 10:34:33,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:34:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 10:34:33,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350850811] [2021-01-06 10:34:33,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 10:34:33,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 10:34:33,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445364376] [2021-01-06 10:34:33,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 10:34:33,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:34:33,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 10:34:33,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-01-06 10:34:33,396 INFO L87 Difference]: Start difference. First operand 338 states and 462 transitions. Second operand 14 states. [2021-01-06 10:34:33,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:34:33,838 INFO L93 Difference]: Finished difference Result 683 states and 928 transitions. [2021-01-06 10:34:33,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 10:34:33,838 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2021-01-06 10:34:33,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:34:33,843 INFO L225 Difference]: With dead ends: 683 [2021-01-06 10:34:33,843 INFO L226 Difference]: Without dead ends: 678 [2021-01-06 10:34:33,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2021-01-06 10:34:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2021-01-06 10:34:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 520. [2021-01-06 10:34:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2021-01-06 10:34:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 720 transitions. [2021-01-06 10:34:33,882 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 720 transitions. Word has length 39 [2021-01-06 10:34:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:34:33,882 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 720 transitions. [2021-01-06 10:34:33,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 10:34:33,883 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 720 transitions. [2021-01-06 10:34:33,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 10:34:33,886 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:34:33,886 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, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:34:33,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 10:34:33,886 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:34:33,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:34:33,887 INFO L82 PathProgramCache]: Analyzing trace with hash -844528497, now seen corresponding path program 1 times [2021-01-06 10:34:33,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:34:33,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644863615] [2021-01-06 10:34:33,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:34:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 10:34:34,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644863615] [2021-01-06 10:34:34,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424078658] [2021-01-06 10:34:34,491 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 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 [2021-01-06 10:34:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:34,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 43 conjunts are in the unsatisfiable core [2021-01-06 10:34:34,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:34:34,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:34:34,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:34:34,716 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:34:34,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:34:34,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:34:34,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:34:34,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:34:34,732 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:34:34,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:34,788 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:34,789 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 1 case distinctions, treesize of input 34 treesize of output 20 [2021-01-06 10:34:34,790 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:34,795 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:34,796 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:34:34,796 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:16 [2021-01-06 10:34:34,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:34,887 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 27 treesize of output 20 [2021-01-06 10:34:34,888 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:34,896 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:34,897 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:34:34,897 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2021-01-06 10:34:34,962 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2021-01-06 10:34:34,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:34,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:34,971 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 10 [2021-01-06 10:34:34,972 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:34,973 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:34,974 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:34:34,978 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:34,979 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:34:34,980 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:3 [2021-01-06 10:34:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 10:34:35,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:34:35,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2021-01-06 10:34:35,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861320084] [2021-01-06 10:34:35,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-01-06 10:34:35,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:34:35,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-01-06 10:34:35,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2021-01-06 10:34:35,029 INFO L87 Difference]: Start difference. First operand 520 states and 720 transitions. Second operand 24 states. [2021-01-06 10:34:36,431 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2021-01-06 10:34:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:34:38,754 INFO L93 Difference]: Finished difference Result 2001 states and 2783 transitions. [2021-01-06 10:34:38,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-01-06 10:34:38,755 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 39 [2021-01-06 10:34:38,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:34:38,764 INFO L225 Difference]: With dead ends: 2001 [2021-01-06 10:34:38,764 INFO L226 Difference]: Without dead ends: 1449 [2021-01-06 10:34:38,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=629, Invalid=2563, Unknown=0, NotChecked=0, Total=3192 [2021-01-06 10:34:38,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2021-01-06 10:34:38,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 732. [2021-01-06 10:34:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2021-01-06 10:34:38,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1007 transitions. [2021-01-06 10:34:38,834 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1007 transitions. Word has length 39 [2021-01-06 10:34:38,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:34:38,834 INFO L481 AbstractCegarLoop]: Abstraction has 732 states and 1007 transitions. [2021-01-06 10:34:38,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-01-06 10:34:38,834 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1007 transitions. [2021-01-06 10:34:38,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 10:34:38,836 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:34:38,836 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:34:39,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-06 10:34:39,050 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:34:39,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:34:39,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1651422940, now seen corresponding path program 2 times [2021-01-06 10:34:39,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:34:39,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301687963] [2021-01-06 10:34:39,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:34:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:39,137 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 10:34:39,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301687963] [2021-01-06 10:34:39,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850408116] [2021-01-06 10:34:39,138 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 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 [2021-01-06 10:34:39,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 10:34:39,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:34:39,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-06 10:34:39,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:34:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 10:34:39,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:34:39,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-01-06 10:34:39,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080764591] [2021-01-06 10:34:39,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 10:34:39,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:34:39,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 10:34:39,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-01-06 10:34:39,301 INFO L87 Difference]: Start difference. First operand 732 states and 1007 transitions. Second operand 11 states. [2021-01-06 10:34:39,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:34:39,532 INFO L93 Difference]: Finished difference Result 1702 states and 2321 transitions. [2021-01-06 10:34:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 10:34:39,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2021-01-06 10:34:39,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:34:39,540 INFO L225 Difference]: With dead ends: 1702 [2021-01-06 10:34:39,541 INFO L226 Difference]: Without dead ends: 1458 [2021-01-06 10:34:39,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-01-06 10:34:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2021-01-06 10:34:39,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1126. [2021-01-06 10:34:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126 states. [2021-01-06 10:34:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1516 transitions. [2021-01-06 10:34:39,630 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1516 transitions. Word has length 39 [2021-01-06 10:34:39,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:34:39,630 INFO L481 AbstractCegarLoop]: Abstraction has 1126 states and 1516 transitions. [2021-01-06 10:34:39,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 10:34:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1516 transitions. [2021-01-06 10:34:39,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-06 10:34:39,633 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:34:39,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:34:39,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:34:39,843 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:34:39,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:34:39,844 INFO L82 PathProgramCache]: Analyzing trace with hash -841232401, now seen corresponding path program 1 times [2021-01-06 10:34:39,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:34:39,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545236754] [2021-01-06 10:34:39,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:34:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 10:34:40,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545236754] [2021-01-06 10:34:40,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052979767] [2021-01-06 10:34:40,125 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 [2021-01-06 10:34:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:40,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjunts are in the unsatisfiable core [2021-01-06 10:34:40,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:34:40,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:34:40,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:34:40,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:34:40,326 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 35 treesize of output 23 [2021-01-06 10:34:40,328 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:40,335 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 35 treesize of output 23 [2021-01-06 10:34:40,337 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:40,359 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:40,361 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 10:34:40,361 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:47 [2021-01-06 10:34:40,394 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2021-01-06 10:34:40,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:34:40,403 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:40,403 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2021-01-06 10:34:40,406 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:40,415 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:40,418 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:40,419 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2021-01-06 10:34:40,421 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:40,424 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:40,425 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 10:34:40,425 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:11 [2021-01-06 10:34:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 10:34:40,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:34:40,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2021-01-06 10:34:40,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023388949] [2021-01-06 10:34:40,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 10:34:40,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:34:40,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 10:34:40,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-01-06 10:34:40,458 INFO L87 Difference]: Start difference. First operand 1126 states and 1516 transitions. Second operand 14 states. [2021-01-06 10:34:41,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:34:41,326 INFO L93 Difference]: Finished difference Result 1776 states and 2389 transitions. [2021-01-06 10:34:41,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 10:34:41,327 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2021-01-06 10:34:41,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:34:41,333 INFO L225 Difference]: With dead ends: 1776 [2021-01-06 10:34:41,333 INFO L226 Difference]: Without dead ends: 1446 [2021-01-06 10:34:41,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2021-01-06 10:34:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2021-01-06 10:34:41,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1123. [2021-01-06 10:34:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2021-01-06 10:34:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1507 transitions. [2021-01-06 10:34:41,433 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1507 transitions. Word has length 42 [2021-01-06 10:34:41,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:34:41,434 INFO L481 AbstractCegarLoop]: Abstraction has 1123 states and 1507 transitions. [2021-01-06 10:34:41,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 10:34:41,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1507 transitions. [2021-01-06 10:34:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-06 10:34:41,437 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:34:41,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:34:41,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-06 10:34:41,652 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:34:41,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:34:41,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1764791153, now seen corresponding path program 1 times [2021-01-06 10:34:41,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:34:41,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133918588] [2021-01-06 10:34:41,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:34:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 10:34:42,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133918588] [2021-01-06 10:34:42,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809572753] [2021-01-06 10:34:42,727 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 [2021-01-06 10:34:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:42,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 61 conjunts are in the unsatisfiable core [2021-01-06 10:34:42,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:34:42,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:42,911 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 26 treesize of output 17 [2021-01-06 10:34:42,913 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:42,921 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:42,922 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:34:42,922 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:29 [2021-01-06 10:34:43,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:34:43,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:34:43,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:34:43,171 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:34:43,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:43,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:34:43,178 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2021-01-06 10:34:43,183 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:43,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:43,188 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 41 treesize of output 28 [2021-01-06 10:34:43,189 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:43,209 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:43,211 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 10:34:43,211 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:103, output treesize:77 [2021-01-06 10:34:43,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:34:43,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:43,317 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:34:43,320 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2021-01-06 10:34:43,321 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:43,400 INFO L625 ElimStorePlain]: treesize reduction 13, result has 88.6 percent of original size [2021-01-06 10:34:43,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:43,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:34:43,406 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 56 treesize of output 28 [2021-01-06 10:34:43,407 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:43,435 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:43,437 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 10:34:43,437 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:139, output treesize:65 [2021-01-06 10:34:43,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2021-01-06 10:34:43,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:34:43,521 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:43,521 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2021-01-06 10:34:43,523 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:43,534 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:43,537 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:43,538 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2021-01-06 10:34:43,540 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:43,547 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:43,548 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 10:34:43,548 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:19 [2021-01-06 10:34:43,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 10:34:43,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:34:43,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 30 [2021-01-06 10:34:43,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623250182] [2021-01-06 10:34:43,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-01-06 10:34:43,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:34:43,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-01-06 10:34:43,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2021-01-06 10:34:43,600 INFO L87 Difference]: Start difference. First operand 1123 states and 1507 transitions. Second operand 30 states. [2021-01-06 10:34:44,082 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2021-01-06 10:34:44,303 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 40 [2021-01-06 10:34:44,577 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2021-01-06 10:34:44,733 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2021-01-06 10:34:45,249 WARN L197 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 65 [2021-01-06 10:34:45,724 WARN L197 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2021-01-06 10:34:46,169 WARN L197 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2021-01-06 10:34:46,589 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2021-01-06 10:34:46,977 WARN L197 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2021-01-06 10:34:47,422 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2021-01-06 10:34:47,750 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2021-01-06 10:34:48,098 WARN L197 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2021-01-06 10:34:48,380 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2021-01-06 10:34:48,574 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2021-01-06 10:34:48,804 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2021-01-06 10:34:49,262 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2021-01-06 10:34:49,526 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2021-01-06 10:34:49,737 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2021-01-06 10:34:50,532 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2021-01-06 10:34:50,877 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2021-01-06 10:34:51,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:34:51,854 INFO L93 Difference]: Finished difference Result 1754 states and 2347 transitions. [2021-01-06 10:34:51,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-01-06 10:34:51,855 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2021-01-06 10:34:51,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:34:51,861 INFO L225 Difference]: With dead ends: 1754 [2021-01-06 10:34:51,861 INFO L226 Difference]: Without dead ends: 1664 [2021-01-06 10:34:51,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=744, Invalid=3162, Unknown=0, NotChecked=0, Total=3906 [2021-01-06 10:34:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2021-01-06 10:34:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1047. [2021-01-06 10:34:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2021-01-06 10:34:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1398 transitions. [2021-01-06 10:34:51,959 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1398 transitions. Word has length 42 [2021-01-06 10:34:51,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:34:51,959 INFO L481 AbstractCegarLoop]: Abstraction has 1047 states and 1398 transitions. [2021-01-06 10:34:51,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-01-06 10:34:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1398 transitions. [2021-01-06 10:34:51,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-06 10:34:51,962 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:34:51,963 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:34:52,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-06 10:34:52,175 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:34:52,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:34:52,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1568665061, now seen corresponding path program 1 times [2021-01-06 10:34:52,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:34:52,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932384385] [2021-01-06 10:34:52,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:34:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 10:34:52,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932384385] [2021-01-06 10:34:52,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227333874] [2021-01-06 10:34:52,246 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:34:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:52,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-06 10:34:52,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:34:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 10:34:52,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:34:52,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-01-06 10:34:52,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797628574] [2021-01-06 10:34:52,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 10:34:52,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:34:52,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 10:34:52,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-01-06 10:34:52,385 INFO L87 Difference]: Start difference. First operand 1047 states and 1398 transitions. Second operand 11 states. [2021-01-06 10:34:52,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:34:52,549 INFO L93 Difference]: Finished difference Result 1240 states and 1642 transitions. [2021-01-06 10:34:52,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 10:34:52,549 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2021-01-06 10:34:52,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:34:52,552 INFO L225 Difference]: With dead ends: 1240 [2021-01-06 10:34:52,552 INFO L226 Difference]: Without dead ends: 668 [2021-01-06 10:34:52,553 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-01-06 10:34:52,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-01-06 10:34:52,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 656. [2021-01-06 10:34:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2021-01-06 10:34:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 854 transitions. [2021-01-06 10:34:52,606 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 854 transitions. Word has length 43 [2021-01-06 10:34:52,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:34:52,607 INFO L481 AbstractCegarLoop]: Abstraction has 656 states and 854 transitions. [2021-01-06 10:34:52,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 10:34:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 854 transitions. [2021-01-06 10:34:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 10:34:52,609 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:34:52,609 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:34:52,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-06 10:34:52,824 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:34:52,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:34:52,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1113684699, now seen corresponding path program 1 times [2021-01-06 10:34:52,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:34:52,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778021721] [2021-01-06 10:34:52,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:34:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:54,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 10:34:54,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778021721] [2021-01-06 10:34:54,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382034152] [2021-01-06 10:34:54,144 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:34:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:34:54,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 69 conjunts are in the unsatisfiable core [2021-01-06 10:34:54,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:34:54,368 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:34:54,370 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:34:54,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:34:54,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:54,525 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 58 treesize of output 30 [2021-01-06 10:34:54,527 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:54,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:54,534 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 60 treesize of output 32 [2021-01-06 10:34:54,536 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:54,596 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:54,606 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 10:34:54,606 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:163, output treesize:119 [2021-01-06 10:34:54,746 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 9, 1] term [2021-01-06 10:34:54,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:34:54,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:34:54,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:34:54,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:34:55,029 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2021-01-06 10:34:55,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:34:55,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:34:55,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:34:55,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:34:55,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:55,426 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 88 treesize of output 47 [2021-01-06 10:34:55,435 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:55,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:55,452 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 86 treesize of output 45 [2021-01-06 10:34:55,463 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:55,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:55,476 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 86 treesize of output 45 [2021-01-06 10:34:55,481 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:55,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:55,491 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 84 treesize of output 43 [2021-01-06 10:34:55,502 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:55,728 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2021-01-06 10:34:55,729 INFO L625 ElimStorePlain]: treesize reduction 273, result has 36.7 percent of original size [2021-01-06 10:34:55,731 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 10:34:55,732 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:369, output treesize:158 [2021-01-06 10:34:55,965 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 1] term [2021-01-06 10:34:55,965 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:34:56,006 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 57 [2021-01-06 10:34:56,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:56,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:56,017 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 50 treesize of output 36 [2021-01-06 10:34:56,019 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:56,028 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:56,029 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:34:56,104 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:56,108 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2021-01-06 10:34:56,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:56,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:34:56,118 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 51 treesize of output 39 [2021-01-06 10:34:56,124 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 10:34:56,131 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:56,131 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:34:56,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:34:56,172 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 10:34:56,173 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:162, output treesize:78 [2021-01-06 10:34:56,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:34:56,393 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 10:34:56,419 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 10:34:56,449 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 10:34:57,054 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2021-01-06 10:34:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 10:34:57,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:34:57,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 35 [2021-01-06 10:34:57,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255389426] [2021-01-06 10:34:57,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-01-06 10:34:57,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:34:57,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-01-06 10:34:57,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1089, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 10:34:57,292 INFO L87 Difference]: Start difference. First operand 656 states and 854 transitions. Second operand 35 states. [2021-01-06 10:34:58,808 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2021-01-06 10:34:59,159 WARN L197 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2021-01-06 10:34:59,797 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 34 [2021-01-06 10:35:00,076 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2021-01-06 10:35:00,322 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 31 [2021-01-06 10:35:00,823 WARN L197 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 34 [2021-01-06 10:35:01,404 WARN L197 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 43 [2021-01-06 10:35:02,152 WARN L197 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 61 [2021-01-06 10:35:02,611 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2021-01-06 10:35:03,362 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2021-01-06 10:35:03,939 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2021-01-06 10:35:04,148 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-01-06 10:35:04,598 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2021-01-06 10:35:05,148 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2021-01-06 10:35:05,638 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-01-06 10:35:06,311 WARN L197 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 54 [2021-01-06 10:35:07,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:35:07,490 INFO L93 Difference]: Finished difference Result 951 states and 1238 transitions. [2021-01-06 10:35:07,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-01-06 10:35:07,491 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2021-01-06 10:35:07,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:35:07,494 INFO L225 Difference]: With dead ends: 951 [2021-01-06 10:35:07,495 INFO L226 Difference]: Without dead ends: 943 [2021-01-06 10:35:07,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=608, Invalid=4362, Unknown=0, NotChecked=0, Total=4970 [2021-01-06 10:35:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-01-06 10:35:07,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 709. [2021-01-06 10:35:07,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2021-01-06 10:35:07,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 916 transitions. [2021-01-06 10:35:07,562 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 916 transitions. Word has length 45 [2021-01-06 10:35:07,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:35:07,562 INFO L481 AbstractCegarLoop]: Abstraction has 709 states and 916 transitions. [2021-01-06 10:35:07,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2021-01-06 10:35:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 916 transitions. [2021-01-06 10:35:07,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 10:35:07,564 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:35:07,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:35:07,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 10:35:07,779 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:35:07,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:35:07,780 INFO L82 PathProgramCache]: Analyzing trace with hash 304338073, now seen corresponding path program 1 times [2021-01-06 10:35:07,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:35:07,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627615313] [2021-01-06 10:35:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:35:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:35:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 10:35:08,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627615313] [2021-01-06 10:35:08,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912715732] [2021-01-06 10:35:08,725 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:35:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:35:08,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 56 conjunts are in the unsatisfiable core [2021-01-06 10:35:08,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:35:08,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:35:08,923 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:35:08,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:35:08,979 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 37 treesize of output 23 [2021-01-06 10:35:08,981 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:35:08,991 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:35:08,992 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:35:08,992 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:27 [2021-01-06 10:35:09,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:35:09,112 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:35:09,112 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 1 case distinctions, treesize of input 41 treesize of output 26 [2021-01-06 10:35:09,114 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:35:09,126 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:35:09,127 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:35:09,127 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:34 [2021-01-06 10:35:09,201 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 30 treesize of output 21 [2021-01-06 10:35:09,202 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:35:09,214 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:35:09,216 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:35:09,216 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:28 [2021-01-06 10:35:09,262 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:35:09,262 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2021-01-06 10:35:09,263 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:35:09,267 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:35:09,268 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:35:09,268 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:7 [2021-01-06 10:35:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 10:35:09,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:35:09,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 30 [2021-01-06 10:35:09,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735251402] [2021-01-06 10:35:09,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-01-06 10:35:09,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:35:09,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-01-06 10:35:09,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2021-01-06 10:35:09,311 INFO L87 Difference]: Start difference. First operand 709 states and 916 transitions. Second operand 30 states. [2021-01-06 10:35:11,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:35:11,837 INFO L93 Difference]: Finished difference Result 774 states and 981 transitions. [2021-01-06 10:35:11,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-01-06 10:35:11,840 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 45 [2021-01-06 10:35:11,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:35:11,843 INFO L225 Difference]: With dead ends: 774 [2021-01-06 10:35:11,843 INFO L226 Difference]: Without dead ends: 746 [2021-01-06 10:35:11,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=531, Invalid=1631, Unknown=0, NotChecked=0, Total=2162 [2021-01-06 10:35:11,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2021-01-06 10:35:11,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 711. [2021-01-06 10:35:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2021-01-06 10:35:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 916 transitions. [2021-01-06 10:35:11,912 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 916 transitions. Word has length 45 [2021-01-06 10:35:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:35:11,912 INFO L481 AbstractCegarLoop]: Abstraction has 711 states and 916 transitions. [2021-01-06 10:35:11,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-01-06 10:35:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 916 transitions. [2021-01-06 10:35:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 10:35:11,914 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:35:11,914 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:35:12,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 10:35:12,127 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:35:12,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:35:12,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1607299031, now seen corresponding path program 1 times [2021-01-06 10:35:12,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:35:12,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090604841] [2021-01-06 10:35:12,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:35:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:35:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 10:35:12,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090604841] [2021-01-06 10:35:12,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646749416] [2021-01-06 10:35:12,657 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:35:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:35:12,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 56 conjunts are in the unsatisfiable core [2021-01-06 10:35:12,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:35:12,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:35:12,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:35:12,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:35:12,975 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 37 treesize of output 23 [2021-01-06 10:35:12,977 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:35:12,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:35:12,989 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 23 [2021-01-06 10:35:12,991 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:35:13,013 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:35:13,015 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 10:35:13,016 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:39 [2021-01-06 10:35:13,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:35:13,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:35:13,123 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 34 treesize of output 23 [2021-01-06 10:35:13,124 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:35:13,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:35:13,130 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 32 treesize of output 23 [2021-01-06 10:35:13,133 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:35:13,154 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:35:13,155 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 10:35:13,155 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:87, output treesize:61 [2021-01-06 10:35:13,222 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:35:13,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:35:13,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:35:13,240 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 35 treesize of output 20 [2021-01-06 10:35:13,246 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:35:13,326 INFO L625 ElimStorePlain]: treesize reduction 13, result has 86.7 percent of original size [2021-01-06 10:35:13,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:35:13,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 10:35:13,333 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 45 treesize of output 23 [2021-01-06 10:35:13,335 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:35:13,361 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:35:13,364 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 10:35:13,365 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:123, output treesize:45 [2021-01-06 10:35:13,419 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2021-01-06 10:35:13,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:35:13,429 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:35:13,429 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-01-06 10:35:13,431 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:35:13,441 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:35:13,445 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:35:13,445 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-01-06 10:35:13,447 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:35:13,452 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:35:13,453 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-06 10:35:13,453 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:7 [2021-01-06 10:35:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 10:35:13,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:35:13,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2021-01-06 10:35:13,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675125211] [2021-01-06 10:35:13,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-01-06 10:35:13,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:35:13,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-01-06 10:35:13,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2021-01-06 10:35:13,534 INFO L87 Difference]: Start difference. First operand 711 states and 916 transitions. Second operand 24 states. [2021-01-06 10:35:14,258 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2021-01-06 10:35:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:35:15,083 INFO L93 Difference]: Finished difference Result 734 states and 936 transitions. [2021-01-06 10:35:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 10:35:15,084 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2021-01-06 10:35:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:35:15,086 INFO L225 Difference]: With dead ends: 734 [2021-01-06 10:35:15,086 INFO L226 Difference]: Without dead ends: 726 [2021-01-06 10:35:15,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=227, Invalid=895, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 10:35:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2021-01-06 10:35:15,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 711. [2021-01-06 10:35:15,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2021-01-06 10:35:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 915 transitions. [2021-01-06 10:35:15,149 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 915 transitions. Word has length 45 [2021-01-06 10:35:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:35:15,149 INFO L481 AbstractCegarLoop]: Abstraction has 711 states and 915 transitions. [2021-01-06 10:35:15,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-01-06 10:35:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 915 transitions. [2021-01-06 10:35:15,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 10:35:15,151 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:35:15,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:35:15,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:35:15,366 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:35:15,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:35:15,367 INFO L82 PathProgramCache]: Analyzing trace with hash 797952405, now seen corresponding path program 1 times [2021-01-06 10:35:15,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:35:15,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094624892] [2021-01-06 10:35:15,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:35:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 10:35:15,399 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 10:35:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 10:35:15,427 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 10:35:15,483 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 10:35:15,484 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 10:35:15,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 10:35:15,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 10:35:15 BoogieIcfgContainer [2021-01-06 10:35:15,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 10:35:15,585 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 10:35:15,585 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 10:35:15,585 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 10:35:15,586 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 10:34:15" (3/4) ... [2021-01-06 10:35:15,588 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 10:35:15,654 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/array-crafted/bor5.i-witness.graphml [2021-01-06 10:35:15,654 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 10:35:15,658 INFO L168 Benchmark]: Toolchain (without parser) took 60945.73 ms. Allocated memory was 167.8 MB in the beginning and 420.5 MB in the end (delta: 252.7 MB). Free memory was 142.7 MB in the beginning and 393.9 MB in the end (delta: -251.2 MB). Peak memory consumption was 2.5 MB. Max. memory is 8.0 GB. [2021-01-06 10:35:15,658 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 167.8 MB. Free memory is still 139.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 10:35:15,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.46 ms. Allocated memory is still 167.8 MB. Free memory was 142.5 MB in the beginning and 132.1 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-01-06 10:35:15,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.63 ms. Allocated memory is still 167.8 MB. Free memory was 131.8 MB in the beginning and 130.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 10:35:15,659 INFO L168 Benchmark]: Boogie Preprocessor took 74.77 ms. Allocated memory is still 167.8 MB. Free memory was 130.0 MB in the beginning and 128.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 10:35:15,659 INFO L168 Benchmark]: RCFGBuilder took 587.00 ms. Allocated memory is still 167.8 MB. Free memory was 128.1 MB in the beginning and 141.3 MB in the end (delta: -13.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 8.0 GB. [2021-01-06 10:35:15,660 INFO L168 Benchmark]: TraceAbstraction took 59769.50 ms. Allocated memory was 167.8 MB in the beginning and 420.5 MB in the end (delta: 252.7 MB). Free memory was 140.8 MB in the beginning and 398.1 MB in the end (delta: -257.3 MB). Peak memory consumption was 244.4 MB. Max. memory is 8.0 GB. [2021-01-06 10:35:15,660 INFO L168 Benchmark]: Witness Printer took 69.67 ms. Allocated memory is still 420.5 MB. Free memory was 398.1 MB in the beginning and 393.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 10:35:15,662 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 167.8 MB. Free memory is still 139.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 374.46 ms. Allocated memory is still 167.8 MB. Free memory was 142.5 MB in the beginning and 132.1 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 48.63 ms. Allocated memory is still 167.8 MB. Free memory was 131.8 MB in the beginning and 130.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 74.77 ms. Allocated memory is still 167.8 MB. Free memory was 130.0 MB in the beginning and 128.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 587.00 ms. Allocated memory is still 167.8 MB. Free memory was 128.1 MB in the beginning and 141.3 MB in the end (delta: -13.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 59769.50 ms. Allocated memory was 167.8 MB in the beginning and 420.5 MB in the end (delta: 252.7 MB). Free memory was 140.8 MB in the beginning and 398.1 MB in the end (delta: -257.3 MB). Peak memory consumption was 244.4 MB. Max. memory is 8.0 GB. * Witness Printer took 69.67 ms. Allocated memory is still 420.5 MB. Free memory was 398.1 MB in the beginning and 393.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 57]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int N; VAL [N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; [L35] int temp; [L36] int ret; [L37] int ret2; [L38] int ret5; [L40] int i = 0; VAL [N=2] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [N=2] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [N=2] [L40] COND FALSE !(i < N) VAL [N=2] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [N=2] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] EXPR x[i] VAL [N=2] [L25] res = res | x[i] VAL [N=2] [L24] i++ VAL [N=2] [L24] COND FALSE !(i < N) VAL [N=2] [L27] return res; VAL [N=2] [L45] ret = bor(x) [L47] EXPR x[0] [L47] temp=x[0] [L47] EXPR x[1] [L47] x[0] = x[1] [L47] x[1] = temp [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [N=2] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] EXPR x[i] VAL [N=2] [L25] res = res | x[i] VAL [N=2] [L24] i++ VAL [N=2] [L24] COND FALSE !(i < N) VAL [N=2] [L27] return res; VAL [N=2] [L48] ret2 = bor(x) [L49] EXPR x[0] [L49] temp=x[0] [L50] int i =0 ; VAL [N=2] [L50] COND TRUE i