/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/ldv-regression/test23-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 16:12:21,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 16:12:21,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 16:12:21,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 16:12:21,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 16:12:21,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 16:12:21,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 16:12:21,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 16:12:21,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 16:12:21,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 16:12:21,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 16:12:21,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 16:12:21,237 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 16:12:21,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 16:12:21,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 16:12:21,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 16:12:21,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 16:12:21,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 16:12:21,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 16:12:21,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 16:12:21,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 16:12:21,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 16:12:21,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 16:12:21,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 16:12:21,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 16:12:21,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 16:12:21,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 16:12:21,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 16:12:21,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 16:12:21,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 16:12:21,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 16:12:21,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 16:12:21,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 16:12:21,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 16:12:21,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 16:12:21,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 16:12:21,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 16:12:21,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 16:12:21,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 16:12:21,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 16:12:21,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 16:12:21,320 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 16:12:21,363 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 16:12:21,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 16:12:21,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 16:12:21,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 16:12:21,368 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 16:12:21,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 16:12:21,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 16:12:21,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 16:12:21,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 16:12:21,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 16:12:21,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 16:12:21,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 16:12:21,371 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 16:12:21,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 16:12:21,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 16:12:21,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 16:12:21,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 16:12:21,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:12:21,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 16:12:21,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 16:12:21,373 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 16:12:21,373 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 16:12:21,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 16:12:21,374 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 16:12:21,374 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 16:12:21,374 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 16:12:21,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 16:12:21,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 16:12:21,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 16:12:21,856 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 16:12:21,857 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 16:12:21,858 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test23-2.c [2021-01-06 16:12:21,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b2f4c3863/a4b20f39ff69401887c0041df5c1560f/FLAGa0155625e [2021-01-06 16:12:22,537 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 16:12:22,538 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-regression/test23-2.c [2021-01-06 16:12:22,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b2f4c3863/a4b20f39ff69401887c0041df5c1560f/FLAGa0155625e [2021-01-06 16:12:22,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b2f4c3863/a4b20f39ff69401887c0041df5c1560f [2021-01-06 16:12:22,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 16:12:22,907 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 16:12:22,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 16:12:22,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 16:12:22,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 16:12:22,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:12:22" (1/1) ... [2021-01-06 16:12:22,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d861f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:22, skipping insertion in model container [2021-01-06 16:12:22,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:12:22" (1/1) ... [2021-01-06 16:12:22,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 16:12:22,947 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: StructLHS[VariableLHS[~d1~0,GLOBAL],a] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~d1~0,GLOBAL],b] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~d2~0,GLOBAL],a] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~d2~0,GLOBAL],b] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pd2~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~pd2~0,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-06 16:12:23,135 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/ldv-regression/test23-2.c[1070,1083] [2021-01-06 16:12:23,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:12:23,155 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#d1~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~#d1~0,GLOBAL],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#d1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#d1~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#d2~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~#d2~0,GLOBAL],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#d2~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#d2~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pd2~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~pd2~0,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-06 16:12:23,180 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/ldv-regression/test23-2.c[1070,1083] [2021-01-06 16:12:23,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:12:23,200 INFO L208 MainTranslator]: Completed translation [2021-01-06 16:12:23,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:23 WrapperNode [2021-01-06 16:12:23,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 16:12:23,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 16:12:23,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 16:12:23,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 16:12:23,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:23" (1/1) ... [2021-01-06 16:12:23,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:23" (1/1) ... [2021-01-06 16:12:23,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 16:12:23,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 16:12:23,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 16:12:23,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 16:12:23,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:23" (1/1) ... [2021-01-06 16:12:23,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:23" (1/1) ... [2021-01-06 16:12:23,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:23" (1/1) ... [2021-01-06 16:12:23,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:23" (1/1) ... [2021-01-06 16:12:23,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:23" (1/1) ... [2021-01-06 16:12:23,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:23" (1/1) ... [2021-01-06 16:12:23,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:23" (1/1) ... [2021-01-06 16:12:23,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 16:12:23,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 16:12:23,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 16:12:23,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 16:12:23,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:23" (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 16:12:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 16:12:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 16:12:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 16:12:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 16:12:23,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 16:12:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 16:12:24,095 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 16:12:24,095 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2021-01-06 16:12:24,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:12:24 BoogieIcfgContainer [2021-01-06 16:12:24,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 16:12:24,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 16:12:24,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 16:12:24,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 16:12:24,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 04:12:22" (1/3) ... [2021-01-06 16:12:24,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd3dfbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:12:24, skipping insertion in model container [2021-01-06 16:12:24,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:23" (2/3) ... [2021-01-06 16:12:24,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd3dfbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:12:24, skipping insertion in model container [2021-01-06 16:12:24,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:12:24" (3/3) ... [2021-01-06 16:12:24,107 INFO L111 eAbstractionObserver]: Analyzing ICFG test23-2.c [2021-01-06 16:12:24,115 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 16:12:24,120 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 16:12:24,142 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 16:12:24,171 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 16:12:24,172 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 16:12:24,172 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 16:12:24,172 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 16:12:24,172 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 16:12:24,173 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 16:12:24,173 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 16:12:24,173 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 16:12:24,188 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2021-01-06 16:12:24,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 16:12:24,194 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:24,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:24,195 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:24,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:24,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2100293056, now seen corresponding path program 1 times [2021-01-06 16:12:24,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:24,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818342836] [2021-01-06 16:12:24,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:24,430 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 16:12:24,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818342836] [2021-01-06 16:12:24,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:12:24,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 16:12:24,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760770048] [2021-01-06 16:12:24,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 16:12:24,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:24,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 16:12:24,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 16:12:24,464 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2021-01-06 16:12:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:24,502 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2021-01-06 16:12:24,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 16:12:24,504 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2021-01-06 16:12:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:24,519 INFO L225 Difference]: With dead ends: 30 [2021-01-06 16:12:24,519 INFO L226 Difference]: Without dead ends: 17 [2021-01-06 16:12:24,523 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 16:12:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-01-06 16:12:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-01-06 16:12:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-01-06 16:12:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-01-06 16:12:24,561 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2021-01-06 16:12:24,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:24,562 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-01-06 16:12:24,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 16:12:24,563 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-01-06 16:12:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 16:12:24,564 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:24,564 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:24,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 16:12:24,566 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:24,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:24,569 INFO L82 PathProgramCache]: Analyzing trace with hash 478567452, now seen corresponding path program 1 times [2021-01-06 16:12:24,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:24,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843266730] [2021-01-06 16:12:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:25,071 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 16:12:25,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843266730] [2021-01-06 16:12:25,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:12:25,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 16:12:25,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352413168] [2021-01-06 16:12:25,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 16:12:25,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:25,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 16:12:25,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-06 16:12:25,082 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2021-01-06 16:12:25,605 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2021-01-06 16:12:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:26,008 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2021-01-06 16:12:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 16:12:26,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2021-01-06 16:12:26,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:26,010 INFO L225 Difference]: With dead ends: 59 [2021-01-06 16:12:26,011 INFO L226 Difference]: Without dead ends: 54 [2021-01-06 16:12:26,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-01-06 16:12:26,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-01-06 16:12:26,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 25. [2021-01-06 16:12:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-01-06 16:12:26,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-01-06 16:12:26,022 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2021-01-06 16:12:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:26,023 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-01-06 16:12:26,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 16:12:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-01-06 16:12:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 16:12:26,024 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:26,024 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:26,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 16:12:26,025 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:26,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:26,026 INFO L82 PathProgramCache]: Analyzing trace with hash -108238562, now seen corresponding path program 1 times [2021-01-06 16:12:26,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:26,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779127637] [2021-01-06 16:12:26,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:26,189 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 16:12:26,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779127637] [2021-01-06 16:12:26,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:12:26,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 16:12:26,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012990213] [2021-01-06 16:12:26,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 16:12:26,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:26,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 16:12:26,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-06 16:12:26,192 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 9 states. [2021-01-06 16:12:26,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:26,516 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2021-01-06 16:12:26,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 16:12:26,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2021-01-06 16:12:26,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:26,518 INFO L225 Difference]: With dead ends: 54 [2021-01-06 16:12:26,519 INFO L226 Difference]: Without dead ends: 44 [2021-01-06 16:12:26,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-01-06 16:12:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-01-06 16:12:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 25. [2021-01-06 16:12:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-01-06 16:12:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-01-06 16:12:26,527 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2021-01-06 16:12:26,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:26,528 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-01-06 16:12:26,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 16:12:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2021-01-06 16:12:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 16:12:26,529 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:26,529 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:26,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 16:12:26,529 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:26,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:26,530 INFO L82 PathProgramCache]: Analyzing trace with hash -501265572, now seen corresponding path program 1 times [2021-01-06 16:12:26,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:26,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324737747] [2021-01-06 16:12:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:26,829 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 16:12:26,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324737747] [2021-01-06 16:12:26,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:12:26,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 16:12:26,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811438261] [2021-01-06 16:12:26,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 16:12:26,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:26,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 16:12:26,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-06 16:12:26,832 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 11 states. [2021-01-06 16:12:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:27,394 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2021-01-06 16:12:27,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 16:12:27,395 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2021-01-06 16:12:27,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:27,396 INFO L225 Difference]: With dead ends: 51 [2021-01-06 16:12:27,396 INFO L226 Difference]: Without dead ends: 46 [2021-01-06 16:12:27,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-01-06 16:12:27,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-01-06 16:12:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 22. [2021-01-06 16:12:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-01-06 16:12:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-01-06 16:12:27,404 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2021-01-06 16:12:27,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:27,404 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-01-06 16:12:27,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 16:12:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-01-06 16:12:27,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 16:12:27,405 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:27,406 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:27,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 16:12:27,406 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:27,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:27,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1851619425, now seen corresponding path program 1 times [2021-01-06 16:12:27,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:27,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770646653] [2021-01-06 16:12:27,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:12:27,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770646653] [2021-01-06 16:12:27,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293663726] [2021-01-06 16:12:27,701 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 16:12:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:27,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 35 conjunts are in the unsatisfiable core [2021-01-06 16:12:27,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:12:27,984 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-01-06 16:12:27,985 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:28,009 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:28,012 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:28,012 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2021-01-06 16:12:28,278 INFO L348 Elim1Store]: treesize reduction 43, result has 39.4 percent of original size [2021-01-06 16:12:28,278 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 39 [2021-01-06 16:12:28,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:12:28,290 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-06 16:12:28,324 INFO L625 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2021-01-06 16:12:28,331 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 16:12:28,332 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:5 [2021-01-06 16:12:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:12:28,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:12:28,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2021-01-06 16:12:28,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009525335] [2021-01-06 16:12:28,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 16:12:28,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:28,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 16:12:28,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-01-06 16:12:28,374 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 16 states. [2021-01-06 16:12:29,092 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2021-01-06 16:12:29,259 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2021-01-06 16:12:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:29,863 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2021-01-06 16:12:29,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 16:12:29,864 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2021-01-06 16:12:29,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:29,867 INFO L225 Difference]: With dead ends: 55 [2021-01-06 16:12:29,868 INFO L226 Difference]: Without dead ends: 50 [2021-01-06 16:12:29,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2021-01-06 16:12:29,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-01-06 16:12:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 27. [2021-01-06 16:12:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-01-06 16:12:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2021-01-06 16:12:29,892 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2021-01-06 16:12:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:29,893 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-01-06 16:12:29,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 16:12:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2021-01-06 16:12:29,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 16:12:29,899 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:29,899 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:30,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:12:30,115 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:30,116 INFO L82 PathProgramCache]: Analyzing trace with hash 829921185, now seen corresponding path program 1 times [2021-01-06 16:12:30,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:30,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516013030] [2021-01-06 16:12:30,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:12:30,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516013030] [2021-01-06 16:12:30,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114551507] [2021-01-06 16:12:30,423 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 16:12:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:30,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 35 conjunts are in the unsatisfiable core [2021-01-06 16:12:30,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:12:30,583 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-01-06 16:12:30,584 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:30,597 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:30,598 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:30,599 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2021-01-06 16:12:30,773 INFO L348 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2021-01-06 16:12:30,774 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 34 [2021-01-06 16:12:30,779 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:12:30,782 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-06 16:12:30,814 INFO L625 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2021-01-06 16:12:30,820 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 16:12:30,821 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:5 [2021-01-06 16:12:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:12:30,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:12:30,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2021-01-06 16:12:30,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100932690] [2021-01-06 16:12:30,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 16:12:30,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:30,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 16:12:30,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-01-06 16:12:30,857 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 16 states. [2021-01-06 16:12:31,540 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2021-01-06 16:12:31,801 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2021-01-06 16:12:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:31,885 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2021-01-06 16:12:31,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 16:12:31,889 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2021-01-06 16:12:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:31,889 INFO L225 Difference]: With dead ends: 57 [2021-01-06 16:12:31,890 INFO L226 Difference]: Without dead ends: 52 [2021-01-06 16:12:31,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2021-01-06 16:12:31,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-01-06 16:12:31,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 24. [2021-01-06 16:12:31,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-01-06 16:12:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2021-01-06 16:12:31,897 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 18 [2021-01-06 16:12:31,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:31,898 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-01-06 16:12:31,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 16:12:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2021-01-06 16:12:31,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 16:12:31,899 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:31,899 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:32,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:12:32,113 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:32,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:32,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1495361690, now seen corresponding path program 2 times [2021-01-06 16:12:32,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:32,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015131336] [2021-01-06 16:12:32,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:12:32,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015131336] [2021-01-06 16:12:32,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531978889] [2021-01-06 16:12:32,464 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 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 16:12:32,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 16:12:32,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:12:32,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 44 conjunts are in the unsatisfiable core [2021-01-06 16:12:32,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:12:32,651 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2021-01-06 16:12:32,653 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:32,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:32,671 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:32,671 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2021-01-06 16:12:32,940 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:32,941 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 86 [2021-01-06 16:12:32,948 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:12:32,949 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:12:32,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:12:32,954 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:12:32,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:12:32,958 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:12:32,963 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2021-01-06 16:12:33,025 INFO L625 ElimStorePlain]: treesize reduction 47, result has 33.8 percent of original size [2021-01-06 16:12:33,034 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 16:12:33,034 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:9 [2021-01-06 16:12:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:12:33,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:12:33,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 17 [2021-01-06 16:12:33,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491472346] [2021-01-06 16:12:33,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 16:12:33,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:33,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 16:12:33,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-01-06 16:12:33,082 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 18 states. [2021-01-06 16:12:33,552 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2021-01-06 16:12:33,871 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2021-01-06 16:12:34,007 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2021-01-06 16:12:34,227 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2021-01-06 16:12:34,944 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2021-01-06 16:12:35,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:35,167 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2021-01-06 16:12:35,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-01-06 16:12:35,167 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2021-01-06 16:12:35,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:35,168 INFO L225 Difference]: With dead ends: 63 [2021-01-06 16:12:35,168 INFO L226 Difference]: Without dead ends: 58 [2021-01-06 16:12:35,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=359, Invalid=1201, Unknown=0, NotChecked=0, Total=1560 [2021-01-06 16:12:35,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-01-06 16:12:35,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 26. [2021-01-06 16:12:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-01-06 16:12:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2021-01-06 16:12:35,176 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2021-01-06 16:12:35,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:35,176 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-01-06 16:12:35,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 16:12:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2021-01-06 16:12:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 16:12:35,177 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:35,178 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:35,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:12:35,393 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:35,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:35,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1013708501, now seen corresponding path program 3 times [2021-01-06 16:12:35,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:35,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355252393] [2021-01-06 16:12:35,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:35,793 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:12:35,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355252393] [2021-01-06 16:12:35,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226713518] [2021-01-06 16:12:35,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 16:12:35,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-06 16:12:35,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:12:35,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 54 conjunts are in the unsatisfiable core [2021-01-06 16:12:35,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:12:35,994 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2021-01-06 16:12:35,995 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:36,039 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:36,040 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:36,041 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2021-01-06 16:12:36,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:12:36,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:12:36,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:12:36,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 16:12:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:12:36,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:12:36,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 21 [2021-01-06 16:12:36,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270039903] [2021-01-06 16:12:36,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-06 16:12:36,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:36,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-06 16:12:36,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2021-01-06 16:12:36,558 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 22 states. [2021-01-06 16:12:37,124 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2021-01-06 16:12:37,482 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-01-06 16:12:37,644 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 41 [2021-01-06 16:12:37,874 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2021-01-06 16:12:38,279 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2021-01-06 16:12:38,468 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2021-01-06 16:12:38,673 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2021-01-06 16:12:39,100 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2021-01-06 16:12:39,295 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2021-01-06 16:12:39,515 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2021-01-06 16:12:39,926 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2021-01-06 16:12:40,118 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2021-01-06 16:12:40,344 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2021-01-06 16:12:40,648 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2021-01-06 16:12:40,834 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2021-01-06 16:12:41,053 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2021-01-06 16:12:41,417 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2021-01-06 16:12:41,777 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2021-01-06 16:12:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:41,915 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2021-01-06 16:12:41,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-01-06 16:12:41,916 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2021-01-06 16:12:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:41,917 INFO L225 Difference]: With dead ends: 65 [2021-01-06 16:12:41,917 INFO L226 Difference]: Without dead ends: 25 [2021-01-06 16:12:41,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=659, Invalid=2763, Unknown=0, NotChecked=0, Total=3422 [2021-01-06 16:12:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-01-06 16:12:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-01-06 16:12:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-01-06 16:12:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2021-01-06 16:12:41,925 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2021-01-06 16:12:41,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:41,925 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2021-01-06 16:12:41,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-06 16:12:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2021-01-06 16:12:41,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 16:12:41,926 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:41,926 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:42,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:12:42,141 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:42,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:42,142 INFO L82 PathProgramCache]: Analyzing trace with hash 722062576, now seen corresponding path program 2 times [2021-01-06 16:12:42,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:42,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045307276] [2021-01-06 16:12:42,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:12:42,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045307276] [2021-01-06 16:12:42,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331762196] [2021-01-06 16:12:42,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:12:42,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 16:12:42,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:12:42,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 38 conjunts are in the unsatisfiable core [2021-01-06 16:12:42,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:12:42,764 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-01-06 16:12:42,765 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:42,777 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:42,781 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:42,781 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2021-01-06 16:12:43,197 INFO L348 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2021-01-06 16:12:43,198 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 34 [2021-01-06 16:12:43,204 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:12:43,207 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-06 16:12:43,243 INFO L625 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2021-01-06 16:12:43,246 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 16:12:43,247 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:5 [2021-01-06 16:12:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:12:43,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:12:43,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 21 [2021-01-06 16:12:43,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366780052] [2021-01-06 16:12:43,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-06 16:12:43,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:43,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-06 16:12:43,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2021-01-06 16:12:43,302 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2021-01-06 16:12:43,811 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2021-01-06 16:12:43,961 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2021-01-06 16:12:44,235 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2021-01-06 16:12:44,808 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2021-01-06 16:12:45,119 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2021-01-06 16:12:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:45,163 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2021-01-06 16:12:45,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 16:12:45,164 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2021-01-06 16:12:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:45,165 INFO L225 Difference]: With dead ends: 32 [2021-01-06 16:12:45,165 INFO L226 Difference]: Without dead ends: 27 [2021-01-06 16:12:45,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 16:12:45,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-01-06 16:12:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-01-06 16:12:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-01-06 16:12:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2021-01-06 16:12:45,172 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2021-01-06 16:12:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:45,173 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2021-01-06 16:12:45,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-06 16:12:45,173 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2021-01-06 16:12:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 16:12:45,174 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:45,174 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:45,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:12:45,388 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:45,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:45,388 INFO L82 PathProgramCache]: Analyzing trace with hash -372767691, now seen corresponding path program 3 times [2021-01-06 16:12:45,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:45,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143829274] [2021-01-06 16:12:45,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:12:45,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143829274] [2021-01-06 16:12:45,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508132389] [2021-01-06 16:12:45,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 16:12:45,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-06 16:12:45,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:12:45,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 54 conjunts are in the unsatisfiable core [2021-01-06 16:12:45,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:12:46,020 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-01-06 16:12:46,021 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:46,040 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:46,042 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:46,042 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2021-01-06 16:12:46,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:12:46,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:12:46,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:12:46,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 16:12:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 16:12:46,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:12:46,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 23 [2021-01-06 16:12:46,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379747063] [2021-01-06 16:12:46,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-01-06 16:12:46,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:46,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-01-06 16:12:46,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2021-01-06 16:12:46,590 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2021-01-06 16:12:47,185 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2021-01-06 16:12:47,381 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 41 [2021-01-06 16:12:47,570 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2021-01-06 16:12:47,796 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2021-01-06 16:12:47,966 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2021-01-06 16:12:48,189 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2021-01-06 16:12:48,380 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2021-01-06 16:12:48,612 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2021-01-06 16:12:48,799 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2021-01-06 16:12:49,043 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2021-01-06 16:12:49,227 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2021-01-06 16:12:49,454 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2021-01-06 16:12:49,633 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2021-01-06 16:12:49,855 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2021-01-06 16:12:50,095 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2021-01-06 16:12:50,348 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2021-01-06 16:12:50,604 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2021-01-06 16:12:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:50,605 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2021-01-06 16:12:50,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-01-06 16:12:50,606 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2021-01-06 16:12:50,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:50,606 INFO L225 Difference]: With dead ends: 32 [2021-01-06 16:12:50,606 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 16:12:50,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=423, Invalid=1469, Unknown=0, NotChecked=0, Total=1892 [2021-01-06 16:12:50,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 16:12:50,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 16:12:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 16:12:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 16:12:50,609 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2021-01-06 16:12:50,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:50,609 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 16:12:50,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-01-06 16:12:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 16:12:50,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 16:12:50,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:12:50,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 16:12:51,132 WARN L197 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 135 [2021-01-06 16:12:52,171 WARN L197 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 60 [2021-01-06 16:12:52,449 WARN L197 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2021-01-06 16:12:52,916 WARN L197 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2021-01-06 16:12:52,922 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 16:12:52,923 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 16:12:52,923 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 16:12:52,923 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) no Hoare annotation was computed. [2021-01-06 16:12:52,923 INFO L192 CegarLoopUtils]: At program point L53(lines 33 54) the Hoare annotation is: true [2021-01-06 16:12:52,923 INFO L189 CegarLoopUtils]: For program point L45(lines 45 47) no Hoare annotation was computed. [2021-01-06 16:12:52,924 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 16:12:52,924 INFO L189 CegarLoopUtils]: For program point L25(line 25) no Hoare annotation was computed. [2021-01-06 16:12:52,924 INFO L189 CegarLoopUtils]: For program point L25-2(line 25) no Hoare annotation was computed. [2021-01-06 16:12:52,924 INFO L185 CegarLoopUtils]: At program point L25-3(lines 23 26) the Hoare annotation is: (let ((.cse0 (= |~#d2~0.offset| 0)) (.cse1 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse2 (= |ULTIMATE.start_get_dummy_#res.offset| 0)) (.cse3 (= |~#d1~0.offset| 0))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_get_dummy_#res.base| |~#d2~0.base|) .cse3) (and .cse0 .cse1 (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|) .cse2 .cse3))) [2021-01-06 16:12:52,924 INFO L189 CegarLoopUtils]: For program point L25-4(line 25) no Hoare annotation was computed. [2021-01-06 16:12:52,924 INFO L189 CegarLoopUtils]: For program point L25-6(line 25) no Hoare annotation was computed. [2021-01-06 16:12:52,924 INFO L185 CegarLoopUtils]: At program point L25-7(lines 23 26) the Hoare annotation is: (let ((.cse0 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse1 (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|)) (.cse2 (= |~#d1~0.offset| 0))) (or (and .cse0 (not .cse1) (not (= ULTIMATE.start_main_~pd1~0.base |ULTIMATE.start_get_dummy_#res.base|)) .cse2) (and (= ULTIMATE.start_main_~pd1~0.offset 0) (let ((.cse3 (= |~#d2~0.offset| 0))) (or (and .cse3 .cse0 .cse1) (and .cse3 (= |ULTIMATE.start_get_dummy_#res.offset| 0) (not (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|)) (= |ULTIMATE.start_get_dummy_#res.base| |~#d2~0.base|)))) .cse2))) [2021-01-06 16:12:52,925 INFO L185 CegarLoopUtils]: At program point L46(lines 34 54) the Hoare annotation is: false [2021-01-06 16:12:52,925 INFO L189 CegarLoopUtils]: For program point L42-1(lines 42 44) no Hoare annotation was computed. [2021-01-06 16:12:52,925 INFO L185 CegarLoopUtils]: At program point L42-3(lines 42 44) the Hoare annotation is: (let ((.cse6 (= |~#d2~0.offset| 0)) (.cse0 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse3 (= ULTIMATE.start_main_~pd1~0.offset 0)) (.cse7 (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base)) (.cse8 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse9 (= ULTIMATE.start_main_~pd2~0.offset 0)) (.cse2 (select |#memory_int| ULTIMATE.start_main_~pd2~0.base)) (.cse4 (= |~#d1~0.offset| 0)) (.cse5 (< ULTIMATE.start_main_~i~0 (+ (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset) 1)))) (or (and .cse0 (let ((.cse1 (div (+ ULTIMATE.start_main_~pa~0.offset (- 8)) 4))) (= .cse1 (select .cse2 (+ (* .cse1 4) ULTIMATE.start_main_~pd2~0.offset 8)))) (= (mod ULTIMATE.start_main_~pa~0.offset 4) 0) .cse3 (= |ULTIMATE.start_get_dummy_#res.offset| 0) (= |ULTIMATE.start_get_dummy_#res.base| |~#d2~0.base|) (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse6 .cse0 .cse3 .cse7 .cse8 (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse9 (let ((.cse10 (div (+ (* ULTIMATE.start_main_~pa~0.offset (- 1)) 8) (- 4)))) (= (select .cse2 (+ (* .cse10 4) ULTIMATE.start_main_~pd2~0.offset 8)) .cse10)) .cse4 .cse5 (= (mod (* ULTIMATE.start_main_~pa~0.offset 3) (- 4)) 0)))) [2021-01-06 16:12:52,925 INFO L189 CegarLoopUtils]: For program point L38(lines 38 48) no Hoare annotation was computed. [2021-01-06 16:12:52,925 INFO L189 CegarLoopUtils]: For program point L42-4(lines 42 44) no Hoare annotation was computed. [2021-01-06 16:12:52,925 INFO L189 CegarLoopUtils]: For program point L38-2(lines 38 48) no Hoare annotation was computed. [2021-01-06 16:12:52,926 INFO L185 CegarLoopUtils]: At program point L30(lines 28 31) the Hoare annotation is: (let ((.cse0 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse13 (select |#memory_int| ULTIMATE.start_main_~pd2~0.base)) (.cse1 (= |ULTIMATE.start_check_#res| 1)) (.cse2 (= ULTIMATE.start_main_~pd1~0.offset 0)) (.cse3 (= |~#d1~0.offset| 0)) (.cse4 (< ULTIMATE.start_main_~i~0 (+ (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset) 1))) (.cse5 (= |~#d2~0.offset| 0)) (.cse10 (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base)) (.cse11 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse12 (= ULTIMATE.start_main_~pd2~0.offset 0))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse3 .cse4 .cse5 (exists ((aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55 Int) (aux_div_ULTIMATE.start_main_~pa~0.offset_60 Int)) (let ((.cse8 (select |#memory_int| ULTIMATE.start_main_~pd2~0.base)) (.cse9 (* aux_div_ULTIMATE.start_main_~pa~0.offset_60 4))) (let ((.cse6 (* 4 aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55)) (.cse7 (select .cse8 (+ (* aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55 4) .cse9 8)))) (and (< 0 (+ .cse6 4)) (< ULTIMATE.start_main_~i~0 (+ .cse7 1)) (<= .cse6 0) (= aux_div_ULTIMATE.start_main_~pa~0.offset_60 (select .cse8 (+ ULTIMATE.start_main_~pd2~0.offset .cse9 8))) (<= .cse7 ULTIMATE.start_main_~i~0))))) .cse10 .cse11 .cse12 (let ((.cse14 (div (+ (* ULTIMATE.start_main_~pa~0.offset (- 1)) 8) (- 4)))) (= (select .cse13 (+ (* .cse14 4) ULTIMATE.start_main_~pd2~0.offset 8)) .cse14)) (= (mod (* ULTIMATE.start_main_~pa~0.offset 3) (- 4)) 0)) (and .cse0 (let ((.cse15 (div (+ ULTIMATE.start_main_~pa~0.offset (- 8)) 4))) (= .cse15 (select .cse13 (+ (* .cse15 4) ULTIMATE.start_main_~pd2~0.offset 8)))) (= (mod ULTIMATE.start_main_~pa~0.offset 4) 0) .cse1 (exists ((aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51 Int) (aux_div_ULTIMATE.start_main_~pa~0.offset_50 Int)) (let ((.cse17 (select |#memory_int| ULTIMATE.start_main_~pd2~0.base)) (.cse18 (* aux_div_ULTIMATE.start_main_~pa~0.offset_50 4))) (let ((.cse19 (select .cse17 (+ (* aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51 4) .cse18 8))) (.cse16 (* 4 aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51))) (and (<= 0 .cse16) (= aux_div_ULTIMATE.start_main_~pa~0.offset_50 (select .cse17 (+ .cse18 ULTIMATE.start_main_~pd2~0.offset 8))) (<= .cse19 ULTIMATE.start_main_~i~0) (< ULTIMATE.start_main_~i~0 (+ .cse19 1)) (< .cse16 4))))) .cse2 (= |ULTIMATE.start_get_dummy_#res.offset| 0) (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|) .cse3 .cse4 .cse5 (= ULTIMATE.start_main_~pd1~0.base |ULTIMATE.start_get_dummy_#res.base|) .cse10 .cse11 .cse12))) [2021-01-06 16:12:52,926 INFO L189 CegarLoopUtils]: For program point L14(lines 14 21) no Hoare annotation was computed. [2021-01-06 16:12:52,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] [2021-01-06 16:12:52,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] [2021-01-06 16:12:52,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] [2021-01-06 16:12:52,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] [2021-01-06 16:12:52,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] [2021-01-06 16:12:52,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] [2021-01-06 16:12:52,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] [2021-01-06 16:12:52,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] [2021-01-06 16:12:52,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] [2021-01-06 16:12:52,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] [2021-01-06 16:12:52,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] [2021-01-06 16:12:52,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] [2021-01-06 16:12:52,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] [2021-01-06 16:12:52,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] [2021-01-06 16:12:52,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] [2021-01-06 16:12:52,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] [2021-01-06 16:12:52,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] [2021-01-06 16:12:52,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] [2021-01-06 16:12:52,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] [2021-01-06 16:12:52,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] [2021-01-06 16:12:52,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] [2021-01-06 16:12:52,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] [2021-01-06 16:12:52,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] [2021-01-06 16:12:52,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] [2021-01-06 16:12:52,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] [2021-01-06 16:12:52,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] [2021-01-06 16:12:52,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] [2021-01-06 16:12:52,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] [2021-01-06 16:12:52,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] [2021-01-06 16:12:52,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] [2021-01-06 16:12:52,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] [2021-01-06 16:12:52,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] [2021-01-06 16:12:52,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 04:12:52 BoogieIcfgContainer [2021-01-06 16:12:52,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 16:12:52,978 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 16:12:52,978 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 16:12:52,978 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 16:12:52,979 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:12:24" (3/4) ... [2021-01-06 16:12:52,982 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 16:12:52,995 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-01-06 16:12:52,996 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-01-06 16:12:52,996 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 16:12:52,996 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 16:12:53,030 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((d2 == 0 && !(d1 == d2)) && \result == 0) && \result == d2) && d1 == 0) || ((((d2 == 0 && !(d1 == d2)) && d1 == \result) && \result == 0) && d1 == 0) [2021-01-06 16:12:53,031 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(d1 == d2) && !(pd1 == d1)) && !(pd1 == \result)) && d1 == 0) || ((pd1 == 0 && (((d2 == 0 && !(d1 == d2)) && pd1 == d1) || (((d2 == 0 && \result == 0) && !(d1 == \result)) && \result == d2))) && d1 == 0) [2021-01-06 16:12:53,031 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(d1 == d2) && (pa + -8) / 4 == unknown-#memory_int-unknown[pd2][(pa + -8) / 4 * 4 + pd2 + 8]) && pa % 4 == 0) && pd1 == 0) && \result == 0) && \result == d2) && pd1 == d2) && d1 == 0) && i < unknown-#memory_int-unknown[pa][pa] + 1) && d2 == 0) && pd1 == pd2) && pd2 == pa) && pd2 == 0) || ((((((((((d2 == 0 && !(d1 == d2)) && pd1 == 0) && pd1 == pd2) && pd2 == pa) && pd1 == d1) && pd2 == 0) && unknown-#memory_int-unknown[pd2][(pa * -1 + 8) / -4 * 4 + pd2 + 8] == (pa * -1 + 8) / -4) && d1 == 0) && i < unknown-#memory_int-unknown[pa][pa] + 1) && pa * 3 % -4 == 0) [2021-01-06 16:12:53,032 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(d1 == d2) && \result == 1) && pd1 == 0) && pd1 == d1) && d1 == 0) && i < unknown-#memory_int-unknown[pa][pa] + 1) && d2 == 0) && (\exists aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55 : int, aux_div_ULTIMATE.start_main_~pa~0.offset_60 : int :: (((0 < 4 * aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55 + 4 && i < unknown-#memory_int-unknown[pd2][aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55 * 4 + aux_div_ULTIMATE.start_main_~pa~0.offset_60 * 4 + 8] + 1) && 4 * aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55 <= 0) && aux_div_ULTIMATE.start_main_~pa~0.offset_60 == unknown-#memory_int-unknown[pd2][pd2 + aux_div_ULTIMATE.start_main_~pa~0.offset_60 * 4 + 8]) && unknown-#memory_int-unknown[pd2][aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55 * 4 + aux_div_ULTIMATE.start_main_~pa~0.offset_60 * 4 + 8] <= i)) && pd1 == pd2) && pd2 == pa) && pd2 == 0) && unknown-#memory_int-unknown[pd2][(pa * -1 + 8) / -4 * 4 + pd2 + 8] == (pa * -1 + 8) / -4) && pa * 3 % -4 == 0) || ((((((((((((((!(d1 == d2) && (pa + -8) / 4 == unknown-#memory_int-unknown[pd2][(pa + -8) / 4 * 4 + pd2 + 8]) && pa % 4 == 0) && \result == 1) && (\exists aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51 : int, aux_div_ULTIMATE.start_main_~pa~0.offset_50 : int :: (((0 <= 4 * aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51 && aux_div_ULTIMATE.start_main_~pa~0.offset_50 == unknown-#memory_int-unknown[pd2][aux_div_ULTIMATE.start_main_~pa~0.offset_50 * 4 + pd2 + 8]) && unknown-#memory_int-unknown[pd2][aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51 * 4 + aux_div_ULTIMATE.start_main_~pa~0.offset_50 * 4 + 8] <= i) && i < unknown-#memory_int-unknown[pd2][aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51 * 4 + aux_div_ULTIMATE.start_main_~pa~0.offset_50 * 4 + 8] + 1) && 4 * aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51 < 4)) && pd1 == 0) && \result == 0) && pd1 == d2) && d1 == 0) && i < unknown-#memory_int-unknown[pa][pa] + 1) && d2 == 0) && pd1 == \result) && pd1 == pd2) && pd2 == pa) && pd2 == 0) [2021-01-06 16:12:53,067 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test23-2.c-witness.graphml [2021-01-06 16:12:53,070 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 16:12:53,072 INFO L168 Benchmark]: Toolchain (without parser) took 30164.58 ms. Allocated memory was 156.2 MB in the beginning and 270.5 MB in the end (delta: 114.3 MB). Free memory was 131.5 MB in the beginning and 201.6 MB in the end (delta: -70.0 MB). Peak memory consumption was 45.8 MB. Max. memory is 8.0 GB. [2021-01-06 16:12:53,072 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 156.2 MB. Free memory is still 128.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 16:12:53,073 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.22 ms. Allocated memory is still 156.2 MB. Free memory was 131.3 MB in the beginning and 121.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-01-06 16:12:53,074 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.97 ms. Allocated memory is still 156.2 MB. Free memory was 120.9 MB in the beginning and 119.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 16:12:53,074 INFO L168 Benchmark]: Boogie Preprocessor took 32.73 ms. Allocated memory is still 156.2 MB. Free memory was 119.2 MB in the beginning and 118.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 16:12:53,074 INFO L168 Benchmark]: RCFGBuilder took 812.48 ms. Allocated memory is still 156.2 MB. Free memory was 118.0 MB in the beginning and 134.6 MB in the end (delta: -16.7 MB). Peak memory consumption was 16.2 MB. Max. memory is 8.0 GB. [2021-01-06 16:12:53,075 INFO L168 Benchmark]: TraceAbstraction took 28878.25 ms. Allocated memory was 156.2 MB in the beginning and 270.5 MB in the end (delta: 114.3 MB). Free memory was 134.6 MB in the beginning and 204.7 MB in the end (delta: -70.1 MB). Peak memory consumption was 158.7 MB. Max. memory is 8.0 GB. [2021-01-06 16:12:53,075 INFO L168 Benchmark]: Witness Printer took 92.61 ms. Allocated memory is still 270.5 MB. Free memory was 204.7 MB in the beginning and 201.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:12:53,079 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.21 ms. Allocated memory is still 156.2 MB. Free memory is still 128.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 287.22 ms. Allocated memory is still 156.2 MB. Free memory was 131.3 MB in the beginning and 121.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 47.97 ms. Allocated memory is still 156.2 MB. Free memory was 120.9 MB in the beginning and 119.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 32.73 ms. Allocated memory is still 156.2 MB. Free memory was 119.2 MB in the beginning and 118.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 812.48 ms. Allocated memory is still 156.2 MB. Free memory was 118.0 MB in the beginning and 134.6 MB in the end (delta: -16.7 MB). Peak memory consumption was 16.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 28878.25 ms. Allocated memory was 156.2 MB in the beginning and 270.5 MB in the end (delta: 114.3 MB). Free memory was 134.6 MB in the beginning and 204.7 MB in the end (delta: -70.1 MB). Peak memory consumption was 158.7 MB. Max. memory is 8.0 GB. * Witness Printer took 92.61 ms. Allocated memory is still 270.5 MB. Free memory was 204.7 MB in the beginning and 201.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 52]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((d2 == 0 && !(d1 == d2)) && \result == 0) && \result == d2) && d1 == 0) || ((((d2 == 0 && !(d1 == d2)) && d1 == \result) && \result == 0) && d1 == 0) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((((((((((((!(d1 == d2) && (pa + -8) / 4 == unknown-#memory_int-unknown[pd2][(pa + -8) / 4 * 4 + pd2 + 8]) && pa % 4 == 0) && pd1 == 0) && \result == 0) && \result == d2) && pd1 == d2) && d1 == 0) && i < unknown-#memory_int-unknown[pa][pa] + 1) && d2 == 0) && pd1 == pd2) && pd2 == pa) && pd2 == 0) || ((((((((((d2 == 0 && !(d1 == d2)) && pd1 == 0) && pd1 == pd2) && pd2 == pa) && pd1 == d1) && pd2 == 0) && unknown-#memory_int-unknown[pd2][(pa * -1 + 8) / -4 * 4 + pd2 + 8] == (pa * -1 + 8) / -4) && d1 == 0) && i < unknown-#memory_int-unknown[pa][pa] + 1) && pa * 3 % -4 == 0) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((!(d1 == d2) && !(pd1 == d1)) && !(pd1 == \result)) && d1 == 0) || ((pd1 == 0 && (((d2 == 0 && !(d1 == d2)) && pd1 == d1) || (((d2 == 0 && \result == 0) && !(d1 == \result)) && \result == d2))) && d1 == 0) - InvariantResult [Line: 28]: Loop Invariant [2021-01-06 16:12:53,112 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] [2021-01-06 16:12:53,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] [2021-01-06 16:12:53,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] [2021-01-06 16:12:53,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] [2021-01-06 16:12:53,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] [2021-01-06 16:12:53,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] [2021-01-06 16:12:53,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] [2021-01-06 16:12:53,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] [2021-01-06 16:12:53,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] [2021-01-06 16:12:53,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] [2021-01-06 16:12:53,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] [2021-01-06 16:12:53,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] [2021-01-06 16:12:53,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] [2021-01-06 16:12:53,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] [2021-01-06 16:12:53,116 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] [2021-01-06 16:12:53,116 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] [2021-01-06 16:12:53,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] [2021-01-06 16:12:53,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] [2021-01-06 16:12:53,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] [2021-01-06 16:12:53,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] [2021-01-06 16:12:53,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] [2021-01-06 16:12:53,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] [2021-01-06 16:12:53,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55,QUANTIFIED] [2021-01-06 16:12:53,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_60,QUANTIFIED] [2021-01-06 16:12:53,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] [2021-01-06 16:12:53,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] [2021-01-06 16:12:53,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] [2021-01-06 16:12:53,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] [2021-01-06 16:12:53,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] [2021-01-06 16:12:53,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] [2021-01-06 16:12:53,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~pa~0.offset_50,QUANTIFIED] [2021-01-06 16:12:53,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51,QUANTIFIED] Derived loop invariant: ((((((((((((!(d1 == d2) && \result == 1) && pd1 == 0) && pd1 == d1) && d1 == 0) && i < unknown-#memory_int-unknown[pa][pa] + 1) && d2 == 0) && (\exists aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55 : int, aux_div_ULTIMATE.start_main_~pa~0.offset_60 : int :: (((0 < 4 * aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55 + 4 && i < unknown-#memory_int-unknown[pd2][aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55 * 4 + aux_div_ULTIMATE.start_main_~pa~0.offset_60 * 4 + 8] + 1) && 4 * aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55 <= 0) && aux_div_ULTIMATE.start_main_~pa~0.offset_60 == unknown-#memory_int-unknown[pd2][pd2 + aux_div_ULTIMATE.start_main_~pa~0.offset_60 * 4 + 8]) && unknown-#memory_int-unknown[pd2][aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_60_55 * 4 + aux_div_ULTIMATE.start_main_~pa~0.offset_60 * 4 + 8] <= i)) && pd1 == pd2) && pd2 == pa) && pd2 == 0) && unknown-#memory_int-unknown[pd2][(pa * -1 + 8) / -4 * 4 + pd2 + 8] == (pa * -1 + 8) / -4) && pa * 3 % -4 == 0) || ((((((((((((((!(d1 == d2) && (pa + -8) / 4 == unknown-#memory_int-unknown[pd2][(pa + -8) / 4 * 4 + pd2 + 8]) && pa % 4 == 0) && \result == 1) && (\exists aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51 : int, aux_div_ULTIMATE.start_main_~pa~0.offset_50 : int :: (((0 <= 4 * aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51 && aux_div_ULTIMATE.start_main_~pa~0.offset_50 == unknown-#memory_int-unknown[pd2][aux_div_ULTIMATE.start_main_~pa~0.offset_50 * 4 + pd2 + 8]) && unknown-#memory_int-unknown[pd2][aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51 * 4 + aux_div_ULTIMATE.start_main_~pa~0.offset_50 * 4 + 8] <= i) && i < unknown-#memory_int-unknown[pd2][aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51 * 4 + aux_div_ULTIMATE.start_main_~pa~0.offset_50 * 4 + 8] + 1) && 4 * aux_div_aux_mod_ULTIMATE.start_main_~pa~0.offset_50_51 < 4)) && pd1 == 0) && \result == 0) && pd1 == d2) && d1 == 0) && i < unknown-#memory_int-unknown[pa][pa] + 1) && d2 == 0) && pd1 == \result) && pd1 == pd2) && pd2 == pa) && pd2 == 0) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 26.6s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 147 SDtfs, 758 SDslu, 854 SDs, 0 SdLazy, 1627 SolverSat, 246 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 105 SyntacticMatches, 6 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1752 ImplicationChecksByTransitivity, 18.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 155 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 31 NumberOfFragments, 469 HoareAnnotationTreeSize, 6 FomulaSimplifications, 320223 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 6 FomulaSimplificationsInter, 10707 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 319 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 303 ConstructedInterpolants, 4 QuantifiedInterpolants, 73759 SizeOfPredicates, 81 NumberOfNonLiveVariables, 798 ConjunctsInSsa, 260 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 34/144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...