./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0a39eefaccc62f602b71ff7e91e6bcef4799631 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 15:55:03,424 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 15:55:03,429 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 15:55:03,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 15:55:03,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 15:55:03,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 15:55:03,449 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 15:55:03,451 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 15:55:03,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 15:55:03,460 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 15:55:03,461 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 15:55:03,461 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 15:55:03,462 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 15:55:03,463 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 15:55:03,464 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 15:55:03,465 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 15:55:03,466 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 15:55:03,468 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 15:55:03,470 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 15:55:03,472 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 15:55:03,473 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 15:55:03,474 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 15:55:03,477 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 15:55:03,478 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 15:55:03,478 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 15:55:03,479 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 15:55:03,480 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 15:55:03,481 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 15:55:03,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 15:55:03,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 15:55:03,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 15:55:03,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 15:55:03,485 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 15:55:03,485 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 15:55:03,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 15:55:03,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 15:55:03,488 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 15:55:03,503 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 15:55:03,503 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 15:55:03,504 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 15:55:03,504 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 15:55:03,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 15:55:03,505 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 15:55:03,505 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 15:55:03,505 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 15:55:03,506 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 15:55:03,507 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 15:55:03,507 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 15:55:03,507 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 15:55:03,507 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 15:55:03,507 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 15:55:03,508 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 15:55:03,508 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 15:55:03,508 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 15:55:03,508 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 15:55:03,508 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 15:55:03,508 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 15:55:03,510 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 15:55:03,510 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 15:55:03,510 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 15:55:03,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 15:55:03,511 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 15:55:03,511 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 15:55:03,511 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 15:55:03,512 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 15:55:03,512 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 15:55:03,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 15:55:03,512 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0a39eefaccc62f602b71ff7e91e6bcef4799631 [2018-11-28 15:55:03,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 15:55:03,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 15:55:03,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 15:55:03,570 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 15:55:03,571 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 15:55:03,572 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i [2018-11-28 15:55:03,638 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65fe6a2cb/4e5aa88957e3491e9d6d00abe9ff93e7/FLAG9cad5db88 [2018-11-28 15:55:04,110 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 15:55:04,113 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i [2018-11-28 15:55:04,121 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65fe6a2cb/4e5aa88957e3491e9d6d00abe9ff93e7/FLAG9cad5db88 [2018-11-28 15:55:04,448 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65fe6a2cb/4e5aa88957e3491e9d6d00abe9ff93e7 [2018-11-28 15:55:04,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 15:55:04,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 15:55:04,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 15:55:04,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 15:55:04,458 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 15:55:04,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:55:04" (1/1) ... [2018-11-28 15:55:04,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4557bdd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:55:04, skipping insertion in model container [2018-11-28 15:55:04,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:55:04" (1/1) ... [2018-11-28 15:55:04,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 15:55:04,490 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 15:55:04,681 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 15:55:04,688 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 15:55:04,707 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 15:55:04,722 INFO L195 MainTranslator]: Completed translation [2018-11-28 15:55:04,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:55:04 WrapperNode [2018-11-28 15:55:04,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 15:55:04,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 15:55:04,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 15:55:04,723 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 15:55:04,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:55:04" (1/1) ... [2018-11-28 15:55:04,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:55:04" (1/1) ... [2018-11-28 15:55:04,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 15:55:04,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 15:55:04,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 15:55:04,750 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 15:55:04,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:55:04" (1/1) ... [2018-11-28 15:55:04,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:55:04" (1/1) ... [2018-11-28 15:55:04,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:55:04" (1/1) ... [2018-11-28 15:55:04,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:55:04" (1/1) ... [2018-11-28 15:55:04,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:55:04" (1/1) ... [2018-11-28 15:55:04,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:55:04" (1/1) ... [2018-11-28 15:55:04,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:55:04" (1/1) ... [2018-11-28 15:55:04,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 15:55:04,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 15:55:04,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 15:55:04,781 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 15:55:04,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:55:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 15:55:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 15:55:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-28 15:55:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-28 15:55:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 15:55:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 15:55:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 15:55:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 15:55:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 15:55:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 15:55:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 15:55:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 15:55:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 15:55:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 15:55:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 15:55:05,339 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 15:55:05,339 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-28 15:55:05,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:55:05 BoogieIcfgContainer [2018-11-28 15:55:05,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 15:55:05,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 15:55:05,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 15:55:05,347 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 15:55:05,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:55:04" (1/3) ... [2018-11-28 15:55:05,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607fc378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:55:05, skipping insertion in model container [2018-11-28 15:55:05,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:55:04" (2/3) ... [2018-11-28 15:55:05,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607fc378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:55:05, skipping insertion in model container [2018-11-28 15:55:05,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:55:05" (3/3) ... [2018-11-28 15:55:05,352 INFO L112 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init_true-unreach-call.i [2018-11-28 15:55:05,363 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 15:55:05,375 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 15:55:05,393 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 15:55:05,432 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 15:55:05,433 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 15:55:05,433 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 15:55:05,433 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 15:55:05,433 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 15:55:05,433 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 15:55:05,434 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 15:55:05,434 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 15:55:05,434 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 15:55:05,454 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-28 15:55:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 15:55:05,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 15:55:05,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 15:55:05,463 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 15:55:05,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 15:55:05,468 INFO L82 PathProgramCache]: Analyzing trace with hash -850547107, now seen corresponding path program 1 times [2018-11-28 15:55:05,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 15:55:05,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 15:55:05,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:05,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 15:55:05,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 15:55:05,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 15:55:05,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 15:55:05,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 15:55:05,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 15:55:05,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 15:55:05,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 15:55:05,644 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-28 15:55:05,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 15:55:05,667 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2018-11-28 15:55:05,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 15:55:05,669 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-28 15:55:05,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 15:55:05,679 INFO L225 Difference]: With dead ends: 56 [2018-11-28 15:55:05,679 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 15:55:05,684 INFO L631 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 [2018-11-28 15:55:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 15:55:05,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-28 15:55:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 15:55:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-28 15:55:05,729 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2018-11-28 15:55:05,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 15:55:05,730 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-28 15:55:05,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 15:55:05,730 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-28 15:55:05,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 15:55:05,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 15:55:05,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 15:55:05,732 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 15:55:05,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 15:55:05,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1453375688, now seen corresponding path program 1 times [2018-11-28 15:55:05,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 15:55:05,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 15:55:05,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:05,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 15:55:05,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 15:55:05,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 15:55:05,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 15:55:05,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 15:55:05,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 15:55:05,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 15:55:05,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 15:55:05,909 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-28 15:55:06,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 15:55:06,133 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-28 15:55:06,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 15:55:06,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 15:55:06,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 15:55:06,138 INFO L225 Difference]: With dead ends: 48 [2018-11-28 15:55:06,138 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 15:55:06,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 15:55:06,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 15:55:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2018-11-28 15:55:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 15:55:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-28 15:55:06,150 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2018-11-28 15:55:06,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 15:55:06,151 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-28 15:55:06,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 15:55:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-28 15:55:06,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 15:55:06,152 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 15:55:06,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 15:55:06,152 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 15:55:06,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 15:55:06,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1976547036, now seen corresponding path program 1 times [2018-11-28 15:55:06,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 15:55:06,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 15:55:06,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:06,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 15:55:06,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 15:55:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 15:55:06,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 15:55:06,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 15:55:06,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 15:55:06,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 15:55:06,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 15:55:06,229 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-28 15:55:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 15:55:06,285 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-28 15:55:06,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 15:55:06,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 15:55:06,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 15:55:06,286 INFO L225 Difference]: With dead ends: 47 [2018-11-28 15:55:06,287 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 15:55:06,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 15:55:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 15:55:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-28 15:55:06,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 15:55:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-28 15:55:06,293 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 23 [2018-11-28 15:55:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 15:55:06,293 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-28 15:55:06,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 15:55:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-28 15:55:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 15:55:06,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 15:55:06,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 15:55:06,295 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 15:55:06,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 15:55:06,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1583520026, now seen corresponding path program 1 times [2018-11-28 15:55:06,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 15:55:06,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 15:55:06,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:06,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 15:55:06,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 15:55:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 15:55:06,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 15:55:06,408 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 15:55:06,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 15:55:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 15:55:06,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 15:55:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 15:55:06,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 15:55:06,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-11-28 15:55:06,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 15:55:06,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 15:55:06,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 15:55:06,617 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 6 states. [2018-11-28 15:55:06,845 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-28 15:55:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 15:55:06,985 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2018-11-28 15:55:06,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 15:55:06,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-28 15:55:06,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 15:55:06,988 INFO L225 Difference]: With dead ends: 65 [2018-11-28 15:55:06,988 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 15:55:06,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 15:55:06,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 15:55:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 33. [2018-11-28 15:55:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 15:55:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-28 15:55:06,995 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 23 [2018-11-28 15:55:06,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 15:55:06,996 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-28 15:55:06,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 15:55:06,996 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-28 15:55:06,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 15:55:06,997 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 15:55:06,997 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 15:55:06,998 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 15:55:06,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 15:55:06,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1373480502, now seen corresponding path program 1 times [2018-11-28 15:55:06,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 15:55:06,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 15:55:06,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:07,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 15:55:07,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 15:55:07,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 15:55:07,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 15:55:07,131 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 15:55:07,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 15:55:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 15:55:07,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 15:55:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 15:55:07,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 15:55:07,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-28 15:55:07,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 15:55:07,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 15:55:07,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 15:55:07,361 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 8 states. [2018-11-28 15:55:07,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 15:55:07,571 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2018-11-28 15:55:07,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 15:55:07,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-28 15:55:07,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 15:55:07,574 INFO L225 Difference]: With dead ends: 78 [2018-11-28 15:55:07,574 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 15:55:07,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 15:55:07,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 15:55:07,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2018-11-28 15:55:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 15:55:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-28 15:55:07,585 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 28 [2018-11-28 15:55:07,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 15:55:07,585 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-28 15:55:07,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 15:55:07,586 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-28 15:55:07,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 15:55:07,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 15:55:07,587 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 15:55:07,587 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 15:55:07,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 15:55:07,588 INFO L82 PathProgramCache]: Analyzing trace with hash 484904918, now seen corresponding path program 2 times [2018-11-28 15:55:07,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 15:55:07,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 15:55:07,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:07,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 15:55:07,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 15:55:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 15:55:07,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 15:55:07,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 15:55:07,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 15:55:07,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 15:55:07,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 15:55:07,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 15:55:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 15:55:08,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 15:55:08,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-28 15:55:08,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 15:55:08,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 15:55:08,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-28 15:55:08,089 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 10 states. [2018-11-28 15:55:08,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 15:55:08,606 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2018-11-28 15:55:08,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 15:55:08,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-11-28 15:55:08,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 15:55:08,613 INFO L225 Difference]: With dead ends: 91 [2018-11-28 15:55:08,613 INFO L226 Difference]: Without dead ends: 66 [2018-11-28 15:55:08,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-28 15:55:08,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-28 15:55:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2018-11-28 15:55:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 15:55:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-28 15:55:08,630 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 33 [2018-11-28 15:55:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 15:55:08,630 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-28 15:55:08,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 15:55:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-28 15:55:08,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 15:55:08,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 15:55:08,634 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 15:55:08,634 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 15:55:08,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 15:55:08,634 INFO L82 PathProgramCache]: Analyzing trace with hash -913363186, now seen corresponding path program 3 times [2018-11-28 15:55:08,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 15:55:08,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 15:55:08,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:08,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 15:55:08,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 15:55:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 15:55:08,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 15:55:08,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 15:55:08,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 15:55:08,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 15:55:08,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 15:55:08,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 15:55:09,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 15:55:09,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-28 15:55:09,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 15:55:09,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 15:55:09,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 15:55:09,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-28 15:55:09,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 15:55:09,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 15:55:09,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 15:55:09,115 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-28 15:55:09,212 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-28 15:55:09,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 15:55:09,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-11-28 15:55:09,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 15:55:09,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 15:55:09,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-11-28 15:55:09,233 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 15 states. [2018-11-28 15:55:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 15:55:09,827 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2018-11-28 15:55:09,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 15:55:09,830 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-11-28 15:55:09,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 15:55:09,831 INFO L225 Difference]: With dead ends: 89 [2018-11-28 15:55:09,831 INFO L226 Difference]: Without dead ends: 77 [2018-11-28 15:55:09,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-11-28 15:55:09,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-28 15:55:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 53. [2018-11-28 15:55:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 15:55:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-28 15:55:09,844 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 38 [2018-11-28 15:55:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 15:55:09,844 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-28 15:55:09,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 15:55:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-28 15:55:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 15:55:09,846 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 15:55:09,846 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 15:55:09,846 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 15:55:09,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 15:55:09,847 INFO L82 PathProgramCache]: Analyzing trace with hash -448891321, now seen corresponding path program 1 times [2018-11-28 15:55:09,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 15:55:09,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 15:55:09,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:09,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 15:55:09,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 15:55:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-28 15:55:09,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 15:55:09,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 15:55:09,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 15:55:09,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 15:55:09,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 15:55:09,932 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 3 states. [2018-11-28 15:55:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 15:55:09,951 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-11-28 15:55:09,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 15:55:09,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-28 15:55:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 15:55:09,954 INFO L225 Difference]: With dead ends: 64 [2018-11-28 15:55:09,954 INFO L226 Difference]: Without dead ends: 53 [2018-11-28 15:55:09,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 15:55:09,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-28 15:55:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-28 15:55:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 15:55:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-11-28 15:55:09,966 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 44 [2018-11-28 15:55:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 15:55:09,967 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-11-28 15:55:09,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 15:55:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-11-28 15:55:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 15:55:09,970 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 15:55:09,970 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 15:55:09,970 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 15:55:09,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 15:55:09,971 INFO L82 PathProgramCache]: Analyzing trace with hash -828938698, now seen corresponding path program 1 times [2018-11-28 15:55:09,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 15:55:09,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 15:55:09,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:09,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 15:55:09,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 15:55:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 15:55:10,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 15:55:10,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 15:55:10,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 15:55:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 15:55:10,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 15:55:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-28 15:55:10,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 15:55:10,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-28 15:55:10,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 15:55:10,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 15:55:10,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-28 15:55:10,709 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 13 states. [2018-11-28 15:55:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 15:55:10,940 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-11-28 15:55:10,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 15:55:10,941 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-11-28 15:55:10,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 15:55:10,942 INFO L225 Difference]: With dead ends: 126 [2018-11-28 15:55:10,942 INFO L226 Difference]: Without dead ends: 88 [2018-11-28 15:55:10,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-28 15:55:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-28 15:55:10,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 58. [2018-11-28 15:55:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 15:55:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-28 15:55:10,954 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 50 [2018-11-28 15:55:10,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 15:55:10,954 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-28 15:55:10,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 15:55:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-28 15:55:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 15:55:10,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 15:55:10,956 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 15:55:10,956 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 15:55:10,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 15:55:10,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1725951930, now seen corresponding path program 2 times [2018-11-28 15:55:10,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 15:55:10,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 15:55:10,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:10,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 15:55:10,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 15:55:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 15:55:11,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 15:55:11,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 15:55:11,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 15:55:11,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 15:55:11,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 15:55:11,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 15:55:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-28 15:55:11,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 15:55:11,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-28 15:55:11,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 15:55:11,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 15:55:11,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-28 15:55:11,322 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 15 states. [2018-11-28 15:55:11,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 15:55:11,677 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2018-11-28 15:55:11,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 15:55:11,678 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-11-28 15:55:11,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 15:55:11,680 INFO L225 Difference]: With dead ends: 139 [2018-11-28 15:55:11,680 INFO L226 Difference]: Without dead ends: 98 [2018-11-28 15:55:11,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-11-28 15:55:11,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-28 15:55:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 63. [2018-11-28 15:55:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-28 15:55:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-11-28 15:55:11,690 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 55 [2018-11-28 15:55:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 15:55:11,691 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-28 15:55:11,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 15:55:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-28 15:55:11,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 15:55:11,692 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 15:55:11,692 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 15:55:11,692 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 15:55:11,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 15:55:11,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1238942342, now seen corresponding path program 3 times [2018-11-28 15:55:11,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 15:55:11,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 15:55:11,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:11,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 15:55:11,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 15:55:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 15:55:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 2 proven. 70 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 15:55:12,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 15:55:12,080 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 15:55:12,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 15:55:12,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 15:55:12,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 15:55:12,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 15:55:12,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 15:55:12,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 15:55:12,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 15:55:12,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 15:55:12,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 15:55:12,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-28 15:55:12,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-11-28 15:55:12,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2018-11-28 15:55:12,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 15:55:12,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 15:55:12,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 15:55:12,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:20 [2018-11-28 15:55:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-28 15:55:12,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 15:55:12,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-28 15:55:12,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 15:55:12,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 15:55:12,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-11-28 15:55:12,904 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 18 states. [2018-11-28 15:55:13,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 15:55:13,735 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-28 15:55:13,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 15:55:13,736 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-11-28 15:55:13,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 15:55:13,737 INFO L225 Difference]: With dead ends: 70 [2018-11-28 15:55:13,737 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 15:55:13,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2018-11-28 15:55:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 15:55:13,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 15:55:13,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 15:55:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 15:55:13,740 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-11-28 15:55:13,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 15:55:13,740 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 15:55:13,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 15:55:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 15:55:13,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 15:55:13,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 15:55:14,254 WARN L180 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2018-11-28 15:55:14,329 INFO L451 ceAbstractionStarter]: At program point initENTRY(lines 9 16) the Hoare annotation is: true [2018-11-28 15:55:14,330 INFO L448 ceAbstractionStarter]: For program point initEXIT(lines 9 16) no Hoare annotation was computed. [2018-11-28 15:55:14,330 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2018-11-28 15:55:14,330 INFO L444 ceAbstractionStarter]: At program point L12-3(lines 12 15) the Hoare annotation is: (let ((.cse0 (= init_~a.base |init_#in~a.base|)) (.cse1 (= |init_#in~size| init_~size)) (.cse2 (= init_~a.offset |init_#in~a.offset|))) (or (and (exists ((v_init_~i~0_17 Int)) (and (<= init_~i~0 (+ v_init_~i~0_17 1)) (not (= (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* 4 v_init_~i~0_17))) 0)) (< v_init_~i~0_17 init_~size))) .cse0 .cse1 .cse2) (and (<= init_~i~0 0) .cse0 .cse1 .cse2))) [2018-11-28 15:55:14,330 INFO L448 ceAbstractionStarter]: For program point L12-4(lines 9 16) no Hoare annotation was computed. [2018-11-28 15:55:14,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 15:55:14,331 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-28 15:55:14,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 15:55:14,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 15:55:14,331 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 15:55:14,331 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 15:55:14,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 15:55:14,331 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 34) no Hoare annotation was computed. [2018-11-28 15:55:14,331 INFO L448 ceAbstractionStarter]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2018-11-28 15:55:14,331 INFO L444 ceAbstractionStarter]: At program point L31-3(lines 31 35) the Hoare annotation is: (= main_~flag~0 1) [2018-11-28 15:55:14,331 INFO L448 ceAbstractionStarter]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2018-11-28 15:55:14,332 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 17 37) no Hoare annotation was computed. [2018-11-28 15:55:14,332 INFO L444 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (= main_~flag~0 0) (= |main_~#a~0.offset| 0)) [2018-11-28 15:55:14,332 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-28 15:55:14,332 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 17 37) no Hoare annotation was computed. [2018-11-28 15:55:14,332 INFO L444 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: false [2018-11-28 15:55:14,332 INFO L448 ceAbstractionStarter]: For program point L34-1(line 34) no Hoare annotation was computed. [2018-11-28 15:55:14,332 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 17 37) the Hoare annotation is: true [2018-11-28 15:55:14,332 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. [2018-11-28 15:55:14,332 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 30) no Hoare annotation was computed. [2018-11-28 15:55:14,336 INFO L444 ceAbstractionStarter]: At program point L24-3(lines 24 30) the Hoare annotation is: (let ((.cse0 (exists ((v_init_~i~0_17 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_17) |main_~#a~0.offset|)) 0)) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))) (.cse1 (= main_~flag~0 0)) (.cse2 (= |main_~#a~0.offset| 0))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (<= main_~i~1 99999) .cse0 .cse1 (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|) 0) .cse2) (and .cse0 .cse1 (= main_~i~1 0) .cse2) (= main_~flag~0 1))) [2018-11-28 15:55:14,336 INFO L448 ceAbstractionStarter]: For program point L24-4(lines 24 30) no Hoare annotation was computed. [2018-11-28 15:55:14,337 INFO L448 ceAbstractionStarter]: For program point L4-3(line 4) no Hoare annotation was computed. [2018-11-28 15:55:14,337 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 4) the Hoare annotation is: true [2018-11-28 15:55:14,337 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-28 15:55:14,337 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 4) no Hoare annotation was computed. [2018-11-28 15:55:14,337 INFO L448 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-28 15:55:14,337 INFO L448 ceAbstractionStarter]: For program point L4-1(line 4) no Hoare annotation was computed. [2018-11-28 15:55:14,351 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 15:55:14,352 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 15:55:14,352 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,352 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,353 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,353 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 15:55:14,353 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 15:55:14,353 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,354 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,354 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,356 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 15:55:14,357 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 15:55:14,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,358 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 15:55:14,358 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 15:55:14,358 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,358 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,358 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,362 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 15:55:14,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,363 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,364 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 15:55:14,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:55:14 BoogieIcfgContainer [2018-11-28 15:55:14,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 15:55:14,368 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 15:55:14,368 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 15:55:14,368 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 15:55:14,369 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:55:05" (3/4) ... [2018-11-28 15:55:14,372 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 15:55:14,380 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init [2018-11-28 15:55:14,381 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 15:55:14,381 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 15:55:14,381 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-28 15:55:14,388 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-28 15:55:14,388 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-28 15:55:14,388 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 15:55:14,417 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == #memory_$Pointer$[a][a] && i <= 99999) && (\exists v_init_~i~0_17 : int :: (!(#memory_$Pointer$[a][4 * v_init_~i~0_17 + a] == 0) && 99999 <= v_init_~i~0_17) && v_init_~i~0_17 < 100000)) && flag == 0) && #memory_$Pointer$[a][a] == 0) && a == 0) || ((((\exists v_init_~i~0_17 : int :: (!(#memory_$Pointer$[a][4 * v_init_~i~0_17 + a] == 0) && 99999 <= v_init_~i~0_17) && v_init_~i~0_17 < 100000) && flag == 0) && i == 0) && a == 0)) || flag == 1 [2018-11-28 15:55:14,418 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_init_~i~0_17 : int :: (i <= v_init_~i~0_17 + 1 && !(#memory_$Pointer$[a][a + 4 * v_init_~i~0_17] == 0)) && v_init_~i~0_17 < size) && a == a) && \old(size) == size) && a == a) || (((i <= 0 && a == a) && \old(size) == size) && a == a) [2018-11-28 15:55:14,440 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 15:55:14,441 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 15:55:14,442 INFO L168 Benchmark]: Toolchain (without parser) took 9990.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 946.0 MB in the beginning and 946.2 MB in the end (delta: -160.8 kB). Peak memory consumption was 193.8 MB. Max. memory is 11.5 GB. [2018-11-28 15:55:14,443 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 15:55:14,443 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.27 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 15:55:14,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.54 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 15:55:14,444 INFO L168 Benchmark]: Boogie Preprocessor took 30.36 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 15:55:14,445 INFO L168 Benchmark]: RCFGBuilder took 560.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-11-28 15:55:14,446 INFO L168 Benchmark]: TraceAbstraction took 9025.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 953.8 MB in the end (delta: 146.1 MB). Peak memory consumption was 215.8 MB. Max. memory is 11.5 GB. [2018-11-28 15:55:14,446 INFO L168 Benchmark]: Witness Printer took 73.03 ms. Allocated memory is still 1.2 GB. Free memory was 953.8 MB in the beginning and 946.2 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2018-11-28 15:55:14,451 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 269.27 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.54 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.36 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 560.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9025.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 953.8 MB in the end (delta: 146.1 MB). Peak memory consumption was 215.8 MB. Max. memory is 11.5 GB. * Witness Printer took 73.03 ms. Allocated memory is still 1.2 GB. Free memory was 953.8 MB in the beginning and 946.2 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: flag == 1 - InvariantResult [Line: 24]: Loop Invariant [2018-11-28 15:55:14,460 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 15:55:14,461 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 15:55:14,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,462 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 15:55:14,462 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 15:55:14,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,463 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,463 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,463 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,464 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,464 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 15:55:14,464 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 15:55:14,464 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,465 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,465 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,465 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 15:55:14,465 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 15:55:14,465 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,466 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((0 == #memory_$Pointer$[a][a] && i <= 99999) && (\exists v_init_~i~0_17 : int :: (!(#memory_$Pointer$[a][4 * v_init_~i~0_17 + a] == 0) && 99999 <= v_init_~i~0_17) && v_init_~i~0_17 < 100000)) && flag == 0) && #memory_$Pointer$[a][a] == 0) && a == 0) || ((((\exists v_init_~i~0_17 : int :: (!(#memory_$Pointer$[a][4 * v_init_~i~0_17 + a] == 0) && 99999 <= v_init_~i~0_17) && v_init_~i~0_17 < 100000) && flag == 0) && i == 0) && a == 0)) || flag == 1 - InvariantResult [Line: 12]: Loop Invariant [2018-11-28 15:55:14,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,468 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 15:55:14,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,469 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 15:55:14,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,470 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 15:55:14,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-11-28 15:55:14,470 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((\exists v_init_~i~0_17 : int :: (i <= v_init_~i~0_17 + 1 && !(#memory_$Pointer$[a][a + 4 * v_init_~i~0_17] == 0)) && v_init_~i~0_17 < size) && a == a) && \old(size) == size) && a == a) || (((i <= 0 && a == a) && \old(size) == size) && a == a) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. SAFE Result, 8.9s OverallTime, 11 OverallIterations, 7 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 302 SDtfs, 263 SDslu, 1149 SDs, 0 SdLazy, 685 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 150 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 24 PreInvPairs, 41 NumberOfFragments, 141 HoareAnnotationTreeSize, 24 FomulaSimplifications, 152 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 355 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 681 NumberOfCodeBlocks, 652 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 663 ConstructedInterpolants, 23 QuantifiedInterpolants, 89083 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1044 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 336/597 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...