./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_089d3b01-e212-443f-869f-39ee33f97068/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_089d3b01-e212-443f-869f-39ee33f97068/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_089d3b01-e212-443f-869f-39ee33f97068/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_089d3b01-e212-443f-869f-39ee33f97068/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_089d3b01-e212-443f-869f-39ee33f97068/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_089d3b01-e212-443f-869f-39ee33f97068/bin-2019/uautomizer --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 d80676b9a99131191df12fd74204f331d0509f64 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 08:51:28,418 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:51:28,419 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:51:28,424 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:51:28,425 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:51:28,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:51:28,426 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:51:28,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:51:28,428 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:51:28,429 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:51:28,430 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:51:28,430 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:51:28,430 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:51:28,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:51:28,432 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:51:28,432 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:51:28,433 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:51:28,434 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:51:28,435 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:51:28,437 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:51:28,437 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:51:28,438 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:51:28,440 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:51:28,440 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:51:28,440 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:51:28,441 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:51:28,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:51:28,442 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:51:28,442 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:51:28,443 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:51:28,443 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:51:28,444 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:51:28,444 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:51:28,444 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:51:28,445 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:51:28,445 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:51:28,445 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_089d3b01-e212-443f-869f-39ee33f97068/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 08:51:28,455 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:51:28,455 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:51:28,456 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 08:51:28,456 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 08:51:28,456 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:51:28,456 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:51:28,457 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 08:51:28,457 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:51:28,457 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:51:28,457 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:51:28,457 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:51:28,457 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:51:28,457 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 08:51:28,458 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 08:51:28,458 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 08:51:28,458 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:51:28,458 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:51:28,458 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 08:51:28,458 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:51:28,459 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:51:28,459 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 08:51:28,459 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 08:51:28,459 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:51:28,459 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:51:28,459 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 08:51:28,459 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 08:51:28,460 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 08:51:28,460 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 08:51:28,460 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 08:51:28,460 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_089d3b01-e212-443f-869f-39ee33f97068/bin-2019/uautomizer 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 -> d80676b9a99131191df12fd74204f331d0509f64 [2018-11-10 08:51:28,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:51:28,492 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:51:28,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:51:28,495 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:51:28,495 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:51:28,495 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_089d3b01-e212-443f-869f-39ee33f97068/bin-2019/uautomizer/../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-10 08:51:28,537 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_089d3b01-e212-443f-869f-39ee33f97068/bin-2019/uautomizer/data/9874eb35a/a664ebd09394426b9e0d6f90f08f9689/FLAGa4699319a [2018-11-10 08:51:28,929 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:51:28,929 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_089d3b01-e212-443f-869f-39ee33f97068/sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-10 08:51:28,933 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_089d3b01-e212-443f-869f-39ee33f97068/bin-2019/uautomizer/data/9874eb35a/a664ebd09394426b9e0d6f90f08f9689/FLAGa4699319a [2018-11-10 08:51:28,942 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_089d3b01-e212-443f-869f-39ee33f97068/bin-2019/uautomizer/data/9874eb35a/a664ebd09394426b9e0d6f90f08f9689 [2018-11-10 08:51:28,944 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:51:28,944 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 08:51:28,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:51:28,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:51:28,948 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:51:28,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:51:28" (1/1) ... [2018-11-10 08:51:28,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33296b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:51:28, skipping insertion in model container [2018-11-10 08:51:28,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:51:28" (1/1) ... [2018-11-10 08:51:28,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:51:28,975 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:51:29,080 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:51:29,082 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:51:29,100 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:51:29,111 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:51:29,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:51:29 WrapperNode [2018-11-10 08:51:29,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:51:29,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:51:29,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:51:29,112 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:51:29,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:51:29" (1/1) ... [2018-11-10 08:51:29,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:51:29" (1/1) ... [2018-11-10 08:51:29,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:51:29" (1/1) ... [2018-11-10 08:51:29,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:51:29" (1/1) ... [2018-11-10 08:51:29,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:51:29" (1/1) ... [2018-11-10 08:51:29,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:51:29" (1/1) ... [2018-11-10 08:51:29,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:51:29" (1/1) ... [2018-11-10 08:51:29,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:51:29,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:51:29,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:51:29,136 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:51:29,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:51:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_089d3b01-e212-443f-869f-39ee33f97068/bin-2019/uautomizer/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-10 08:51:29,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 08:51:29,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:51:29,219 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 08:51:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 08:51:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-10 08:51:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 08:51:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-10 08:51:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 08:51:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 08:51:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 08:51:29,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 08:51:29,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 08:51:29,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:51:29,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 08:51:29,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 08:51:29,435 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:51:29,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:51:29 BoogieIcfgContainer [2018-11-10 08:51:29,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:51:29,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 08:51:29,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 08:51:29,438 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 08:51:29,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:51:28" (1/3) ... [2018-11-10 08:51:29,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fef6f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:51:29, skipping insertion in model container [2018-11-10 08:51:29,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:51:29" (2/3) ... [2018-11-10 08:51:29,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fef6f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:51:29, skipping insertion in model container [2018-11-10 08:51:29,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:51:29" (3/3) ... [2018-11-10 08:51:29,441 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-10 08:51:29,450 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 08:51:29,456 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-10 08:51:29,474 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-10 08:51:29,499 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 08:51:29,500 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 08:51:29,500 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 08:51:29,500 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 08:51:29,500 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:51:29,501 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:51:29,501 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 08:51:29,501 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:51:29,501 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 08:51:29,516 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-11-10 08:51:29,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 08:51:29,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:51:29,521 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:51:29,523 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:51:29,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:51:29,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1928124594, now seen corresponding path program 1 times [2018-11-10 08:51:29,529 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:51:29,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:51:29,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:29,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:51:29,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:51:29,672 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-10 08:51:29,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:51:29,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:51:29,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 08:51:29,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:51:29,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:51:29,685 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 4 states. [2018-11-10 08:51:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:51:29,752 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2018-11-10 08:51:29,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:51:29,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-10 08:51:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:51:29,759 INFO L225 Difference]: With dead ends: 108 [2018-11-10 08:51:29,760 INFO L226 Difference]: Without dead ends: 70 [2018-11-10 08:51:29,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:51:29,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-10 08:51:29,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2018-11-10 08:51:29,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 08:51:29,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-10 08:51:29,785 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 15 [2018-11-10 08:51:29,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:51:29,785 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-10 08:51:29,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 08:51:29,785 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-10 08:51:29,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 08:51:29,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:51:29,786 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:51:29,786 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:51:29,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:51:29,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2007100535, now seen corresponding path program 1 times [2018-11-10 08:51:29,786 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:51:29,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:51:29,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:29,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:51:29,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:51:29,822 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-10 08:51:29,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:51:29,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:51:29,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:51:29,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:51:29,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:51:29,824 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-11-10 08:51:29,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:51:29,865 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-11-10 08:51:29,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:51:29,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-10 08:51:29,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:51:29,866 INFO L225 Difference]: With dead ends: 84 [2018-11-10 08:51:29,866 INFO L226 Difference]: Without dead ends: 58 [2018-11-10 08:51:29,867 INFO L605 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-10 08:51:29,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-10 08:51:29,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-11-10 08:51:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 08:51:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-11-10 08:51:29,872 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 15 [2018-11-10 08:51:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:51:29,872 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-11-10 08:51:29,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:51:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-10 08:51:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 08:51:29,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:51:29,872 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:51:29,872 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:51:29,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:51:29,873 INFO L82 PathProgramCache]: Analyzing trace with hash -285230905, now seen corresponding path program 1 times [2018-11-10 08:51:29,873 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:51:29,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:51:29,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:29,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:51:29,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:51:29,922 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-10 08:51:29,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:51:29,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:51:29,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:51:29,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:51:29,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:51:29,923 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 3 states. [2018-11-10 08:51:29,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:51:29,949 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-10 08:51:29,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:51:29,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-10 08:51:29,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:51:29,951 INFO L225 Difference]: With dead ends: 78 [2018-11-10 08:51:29,951 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 08:51:29,951 INFO L605 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-10 08:51:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 08:51:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-11-10 08:51:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 08:51:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-10 08:51:29,956 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-11-10 08:51:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:51:29,956 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-10 08:51:29,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:51:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-10 08:51:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 08:51:29,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:51:29,957 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:51:29,957 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:51:29,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:51:29,957 INFO L82 PathProgramCache]: Analyzing trace with hash -356408398, now seen corresponding path program 1 times [2018-11-10 08:51:29,957 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:51:29,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:51:29,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:29,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:51:29,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:51:29,994 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-10 08:51:29,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:51:29,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:51:29,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:51:29,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:51:29,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:51:29,995 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 3 states. [2018-11-10 08:51:30,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:51:30,003 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-11-10 08:51:30,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:51:30,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-10 08:51:30,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:51:30,004 INFO L225 Difference]: With dead ends: 55 [2018-11-10 08:51:30,004 INFO L226 Difference]: Without dead ends: 39 [2018-11-10 08:51:30,004 INFO L605 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-10 08:51:30,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-10 08:51:30,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-11-10 08:51:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 08:51:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-10 08:51:30,007 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 17 [2018-11-10 08:51:30,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:51:30,008 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-10 08:51:30,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:51:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-10 08:51:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 08:51:30,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:51:30,008 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:51:30,009 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:51:30,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:51:30,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1832093736, now seen corresponding path program 1 times [2018-11-10 08:51:30,009 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:51:30,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:51:30,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:30,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:51:30,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:51:30,059 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-10 08:51:30,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:51:30,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:51:30,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:51:30,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:51:30,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:51:30,060 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 6 states. [2018-11-10 08:51:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:51:30,112 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-11-10 08:51:30,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:51:30,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-10 08:51:30,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:51:30,114 INFO L225 Difference]: With dead ends: 72 [2018-11-10 08:51:30,114 INFO L226 Difference]: Without dead ends: 70 [2018-11-10 08:51:30,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-10 08:51:30,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-10 08:51:30,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 37. [2018-11-10 08:51:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 08:51:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-10 08:51:30,119 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 24 [2018-11-10 08:51:30,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:51:30,119 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-10 08:51:30,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:51:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-10 08:51:30,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 08:51:30,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:51:30,120 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:51:30,120 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:51:30,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:51:30,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1814129763, now seen corresponding path program 1 times [2018-11-10 08:51:30,120 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:51:30,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:51:30,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:30,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:51:30,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:51:30,230 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-10 08:51:30,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:51:30,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:51:30,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:51:30,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:51:30,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:51:30,231 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 6 states. [2018-11-10 08:51:30,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:51:30,726 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-11-10 08:51:30,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 08:51:30,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-10 08:51:30,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:51:30,729 INFO L225 Difference]: With dead ends: 112 [2018-11-10 08:51:30,729 INFO L226 Difference]: Without dead ends: 89 [2018-11-10 08:51:30,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-10 08:51:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-10 08:51:30,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 43. [2018-11-10 08:51:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 08:51:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-10 08:51:30,735 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2018-11-10 08:51:30,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:51:30,736 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-10 08:51:30,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:51:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-10 08:51:30,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 08:51:30,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:51:30,736 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:51:30,737 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:51:30,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:51:30,737 INFO L82 PathProgramCache]: Analyzing trace with hash -948894085, now seen corresponding path program 1 times [2018-11-10 08:51:30,737 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:51:30,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:51:30,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:30,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:51:30,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:51:30,820 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-10 08:51:30,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:51:30,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 08:51:30,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 08:51:30,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:51:30,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:51:30,821 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-11-10 08:51:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:51:30,891 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-11-10 08:51:30,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:51:30,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-10 08:51:30,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:51:30,898 INFO L225 Difference]: With dead ends: 82 [2018-11-10 08:51:30,898 INFO L226 Difference]: Without dead ends: 59 [2018-11-10 08:51:30,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:51:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-10 08:51:30,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2018-11-10 08:51:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 08:51:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-10 08:51:30,903 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 25 [2018-11-10 08:51:30,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:51:30,903 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-10 08:51:30,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 08:51:30,903 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-10 08:51:30,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 08:51:30,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:51:30,904 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:51:30,904 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:51:30,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:51:30,905 INFO L82 PathProgramCache]: Analyzing trace with hash -263889672, now seen corresponding path program 1 times [2018-11-10 08:51:30,905 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:51:30,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:51:30,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:30,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:51:30,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:51:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:51:39,328 WARN L179 SmtUtils]: Spent 4.59 s on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2018-11-10 08:51:41,940 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-10 08:51:41,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:51:41,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-10 08:51:41,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 08:51:41,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 08:51:41,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=156, Unknown=2, NotChecked=0, Total=210 [2018-11-10 08:51:41,942 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 15 states. [2018-11-10 08:51:50,118 WARN L179 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2018-11-10 08:51:55,497 WARN L179 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2018-11-10 08:51:57,419 WARN L179 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2018-11-10 08:52:03,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:03,539 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-11-10 08:52:03,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 08:52:03,539 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-11-10 08:52:03,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:52:03,540 INFO L225 Difference]: With dead ends: 66 [2018-11-10 08:52:03,540 INFO L226 Difference]: Without dead ends: 43 [2018-11-10 08:52:03,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=101, Invalid=317, Unknown=2, NotChecked=0, Total=420 [2018-11-10 08:52:03,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-10 08:52:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-11-10 08:52:03,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 08:52:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-10 08:52:03,546 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 26 [2018-11-10 08:52:03,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:52:03,546 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-10 08:52:03,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 08:52:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-10 08:52:03,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 08:52:03,547 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:52:03,547 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:52:03,547 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:52:03,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:03,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1465291236, now seen corresponding path program 1 times [2018-11-10 08:52:03,548 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:03,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:03,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:03,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:03,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:08,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:52:08,024 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_089d3b01-e212-443f-869f-39ee33f97068/bin-2019/uautomizer/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-10 08:52:08,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:08,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:52:08,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:08,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:52:08,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-10 08:52:08,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 08:52:08,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 08:52:08,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=34, Unknown=2, NotChecked=0, Total=56 [2018-11-10 08:52:08,330 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2018-11-10 08:52:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:14,603 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-10 08:52:14,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:52:14,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-11-10 08:52:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:52:14,604 INFO L225 Difference]: With dead ends: 43 [2018-11-10 08:52:14,604 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 08:52:14,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=28, Invalid=42, Unknown=2, NotChecked=0, Total=72 [2018-11-10 08:52:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 08:52:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 08:52:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 08:52:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 08:52:14,605 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-11-10 08:52:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:52:14,605 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:52:14,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 08:52:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 08:52:14,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 08:52:14,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 08:52:30,605 WARN L179 SmtUtils]: Spent 15.95 s on a formula simplification that was a NOOP. DAG size: 71 [2018-11-10 08:52:48,499 WARN L179 SmtUtils]: Spent 17.89 s on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2018-11-10 08:52:57,212 WARN L179 SmtUtils]: Spent 8.70 s on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2018-11-10 08:52:57,213 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 08:52:57,214 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-10 08:52:57,214 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 08:52:57,214 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 08:52:57,214 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 08:52:57,214 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 08:52:57,214 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 08:52:57,214 INFO L428 ceAbstractionStarter]: At program point L126(lines 92 127) the Hoare annotation is: true [2018-11-10 08:52:57,214 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 191) no Hoare annotation was computed. [2018-11-10 08:52:57,214 INFO L425 ceAbstractionStarter]: For program point L151(lines 151 179) no Hoare annotation was computed. [2018-11-10 08:52:57,214 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2018-11-10 08:52:57,214 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 185) no Hoare annotation was computed. [2018-11-10 08:52:57,214 INFO L425 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,214 INFO L425 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,214 INFO L425 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,214 INFO L425 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,215 INFO L425 ceAbstractionStarter]: For program point L11-4(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,215 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 115) no Hoare annotation was computed. [2018-11-10 08:52:57,215 INFO L425 ceAbstractionStarter]: For program point L11-5(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,215 INFO L425 ceAbstractionStarter]: For program point L11-6(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,215 INFO L425 ceAbstractionStarter]: For program point L11-7(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,215 INFO L425 ceAbstractionStarter]: For program point L11-8(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,215 INFO L425 ceAbstractionStarter]: For program point L11-9(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,215 INFO L425 ceAbstractionStarter]: For program point L11-10(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,215 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 168) no Hoare annotation was computed. [2018-11-10 08:52:57,215 INFO L425 ceAbstractionStarter]: For program point L11-11(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,215 INFO L425 ceAbstractionStarter]: For program point L11-12(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,215 INFO L425 ceAbstractionStarter]: For program point L11-13(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,216 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2018-11-10 08:52:57,216 INFO L425 ceAbstractionStarter]: For program point L11-14(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,216 INFO L425 ceAbstractionStarter]: For program point L11-15(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,216 INFO L425 ceAbstractionStarter]: For program point L11-16(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,216 INFO L425 ceAbstractionStarter]: For program point L11-17(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,216 INFO L425 ceAbstractionStarter]: For program point L11-18(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,216 INFO L425 ceAbstractionStarter]: For program point L11-19(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,216 INFO L425 ceAbstractionStarter]: For program point L11-20(line 11) no Hoare annotation was computed. [2018-11-10 08:52:57,216 INFO L425 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-11-10 08:52:57,216 INFO L425 ceAbstractionStarter]: For program point L45-1(line 45) no Hoare annotation was computed. [2018-11-10 08:52:57,216 INFO L425 ceAbstractionStarter]: For program point L45-2(lines 45 133) no Hoare annotation was computed. [2018-11-10 08:52:57,216 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-10 08:52:57,217 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 174) no Hoare annotation was computed. [2018-11-10 08:52:57,217 INFO L421 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2018-11-10 08:52:57,217 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 180) no Hoare annotation was computed. [2018-11-10 08:52:57,217 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 191) no Hoare annotation was computed. [2018-11-10 08:52:57,217 INFO L425 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2018-11-10 08:52:57,217 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-10 08:52:57,217 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 191) the Hoare annotation is: true [2018-11-10 08:52:57,217 INFO L425 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2018-11-10 08:52:57,217 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2018-11-10 08:52:57,217 INFO L421 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2018-11-10 08:52:57,217 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2018-11-10 08:52:57,218 INFO L421 ceAbstractionStarter]: At program point L114(lines 93 123) the Hoare annotation is: (let ((.cse0 (= main_~__VERIFIER_assert__cond~0 1)) (.cse1 (- main_~main__index2~0))) (or (and (not (= 0 main_~__VERIFIER_assert__cond~2)) .cse0 (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ .cse1 4294967296)) 4294967296)) main_~main__index1~0) 4294967296)) 99999))) (let ((.cse9 (+ main_~main__index1~0 (- 1)))) (let ((.cse8 (div .cse9 4294967296))) (let ((.cse2 (+ main_~main__index1~0 (* 4294967296 (div (+ main_~main__index2~0 4294867297) 4294967296)))) (.cse3 (* 4294967296 .cse8))) (and .cse0 (<= .cse2 (+ .cse3 main_~main__index2~0 1)) (or (let ((.cse6 (select |#memory_int| |main_~#main__array~0.base|)) (.cse7 (* (- 4294967296) .cse8))) (let ((.cse4 (select .cse6 (+ |main_~#main__array~0.offset| (* 4 (+ main_~main__index1~0 .cse7)))))) (<= .cse4 (let ((.cse5 (select .cse6 (+ (* 4 (+ main_~main__index1~0 (+ .cse7 (- 1)))) |main_~#main__array~0.offset|)))) (+ (* 4294967296 (div (+ (- .cse5) .cse4) 4294967296)) .cse5))))) (<= .cse2 (+ .cse3 main_~main__index2~0))) (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse1 (+ main_~main__index1~0 4294967294)) 4294967296)) .cse9) 4294967296)) 99998)))))))) [2018-11-10 08:52:57,218 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-11-10 08:52:57,218 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2018-11-10 08:52:57,218 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2018-11-10 08:52:57,218 INFO L421 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (let ((.cse0 (+ main_~main__index1~0 (- 1)))) (and (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~main____CPAchecker_TMP_0~1)) (<= (+ main_~main__index1~0 (* 4294967296 (div (+ main_~main__index2~0 4294867297) 4294967296))) (+ (* 4294967296 (div .cse0 4294967296)) main_~main__index2~0 1)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)) (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ (- main_~main__index2~0) (+ main_~main__index1~0 4294967294)) 4294967296)) .cse0) 4294967296)) 99998)))) [2018-11-10 08:52:57,219 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 190) no Hoare annotation was computed. [2018-11-10 08:52:57,219 INFO L421 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (let ((.cse1 (= main_~__VERIFIER_assert__cond~0 1))) (or (and (= main_~main____CPAchecker_TMP_0~0 1) (<= main_~main__index2~0 (+ .cse0 99999)) .cse1) (and (and .cse1 (not (= 0 main_~__VERIFIER_assert__cond~1))) (<= (+ main_~main__index1~0 (* 4294967296 (div (+ main_~main__index2~0 4294867297) 4294967296))) (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) main_~main__index2~0 1))))) (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2018-11-10 08:52:57,219 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-11-10 08:52:57,219 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2018-11-10 08:52:57,219 INFO L425 ceAbstractionStarter]: For program point L99-1(line 99) no Hoare annotation was computed. [2018-11-10 08:52:57,219 INFO L425 ceAbstractionStarter]: For program point L99-2(line 99) no Hoare annotation was computed. [2018-11-10 08:52:57,219 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-10 08:52:57,219 INFO L425 ceAbstractionStarter]: For program point L157-1(line 157) no Hoare annotation was computed. [2018-11-10 08:52:57,219 INFO L425 ceAbstractionStarter]: For program point L157-2(line 157) no Hoare annotation was computed. [2018-11-10 08:52:57,219 INFO L421 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (= main_~main____CPAchecker_TMP_0~0 1) (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2018-11-10 08:52:57,219 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 127) no Hoare annotation was computed. [2018-11-10 08:52:57,220 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2018-11-10 08:52:57,220 INFO L421 ceAbstractionStarter]: At program point L167(lines 21 180) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~2)) (= main_~__VERIFIER_assert__cond~0 1) (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ (- main_~main__index2~0) (+ main_~main__index1~0 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998))) [2018-11-10 08:52:57,220 INFO L425 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-11-10 08:52:57,220 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2018-11-10 08:52:57,229 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 08:52:57,230 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 08:52:57,230 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 08:52:57,230 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 08:52:57,231 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 08:52:57,231 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 08:52:57,232 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 08:52:57,232 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 08:52:57,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:52:57 BoogieIcfgContainer [2018-11-10 08:52:57,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 08:52:57,236 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:52:57,236 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:52:57,236 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:52:57,236 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:51:29" (3/4) ... [2018-11-10 08:52:57,241 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 08:52:57,246 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 08:52:57,246 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 08:52:57,250 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-10 08:52:57,251 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-10 08:52:57,251 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 08:52:57,294 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_089d3b01-e212-443f-869f-39ee33f97068/bin-2019/uautomizer/witness.graphml [2018-11-10 08:52:57,294 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:52:57,295 INFO L168 Benchmark]: Toolchain (without parser) took 88351.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 963.0 MB in the beginning and 1.0 GB in the end (delta: -49.7 MB). Peak memory consumption was 81.4 MB. Max. memory is 11.5 GB. [2018-11-10 08:52:57,296 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:52:57,296 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.45 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 946.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 08:52:57,296 INFO L168 Benchmark]: Boogie Preprocessor took 23.76 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:52:57,296 INFO L168 Benchmark]: RCFGBuilder took 299.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:52:57,296 INFO L168 Benchmark]: TraceAbstraction took 87799.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.2 MB). Peak memory consumption was 88.2 MB. Max. memory is 11.5 GB. [2018-11-10 08:52:57,296 INFO L168 Benchmark]: Witness Printer took 58.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-11-10 08:52:57,299 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.45 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 946.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.76 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 299.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 87799.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.2 MB). Peak memory consumption was 88.2 MB. Max. memory is 11.5 GB. * Witness Printer took 58.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (!(0 == __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && main__index2 <= 4294967296 * ((-4294967296 * ((-main__index2 + (main__index1 + 4294967294)) / 4294967296) + (main__index1 + -1)) / 4294967296) + 99998 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant [2018-11-10 08:52:57,302 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 08:52:57,302 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 08:52:57,302 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 08:52:57,303 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 08:52:57,303 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 08:52:57,303 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 08:52:57,303 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 08:52:57,304 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((!(0 == __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && main__index2 <= 4294967296 * ((-4294967296 * ((main__index1 + (-main__index2 + 4294967296)) / 4294967296) + main__index1) / 4294967296) + 99999) || (((__VERIFIER_assert__cond == 1 && main__index1 + 4294967296 * ((main__index2 + 4294867297) / 4294967296) <= 4294967296 * ((main__index1 + -1) / 4294967296) + main__index2 + 1) && (unknown-#memory_int-unknown[main__array][main__array + 4 * (main__index1 + -4294967296 * ((main__index1 + -1) / 4294967296))] <= 4294967296 * ((-unknown-#memory_int-unknown[main__array][4 * (main__index1 + (-4294967296 * ((main__index1 + -1) / 4294967296) + -1)) + main__array] + unknown-#memory_int-unknown[main__array][main__array + 4 * (main__index1 + -4294967296 * ((main__index1 + -1) / 4294967296))]) / 4294967296) + unknown-#memory_int-unknown[main__array][4 * (main__index1 + (-4294967296 * ((main__index1 + -1) / 4294967296) + -1)) + main__array] || main__index1 + 4294967296 * ((main__index2 + 4294867297) / 4294967296) <= 4294967296 * ((main__index1 + -1) / 4294967296) + main__index2)) && main__index2 <= 4294967296 * ((-4294967296 * ((-main__index2 + (main__index1 + 4294967294)) / 4294967296) + (main__index1 + -1)) / 4294967296) + 99998) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((__VERIFIER_assert__cond == 1 && !(0 == main____CPAchecker_TMP_0)) && main__index1 + 4294967296 * ((main__index2 + 4294867297) / 4294967296) <= 4294967296 * ((main__index1 + -1) / 4294967296) + main__index2 + 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) && main__index2 <= 4294967296 * ((-4294967296 * ((-main__index2 + (main__index1 + 4294967294)) / 4294967296) + (main__index1 + -1)) / 4294967296) + 99998 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((main____CPAchecker_TMP_0 == 1 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__loop_entered == 0) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((main____CPAchecker_TMP_0 == 1 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) || ((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && main__index1 + 4294967296 * ((main__index2 + 4294867297) / 4294967296) <= 4294967296 * ((main__index1 + -1) / 4294967296) + main__index2 + 1)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 71 locations, 4 error locations. SAFE Result, 87.7s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 28.6s AutomataDifference, 0.0s DeadEndRemovalTime, 42.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 366 SDtfs, 409 SDslu, 615 SDs, 0 SdLazy, 414 SolverSat, 29 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 18.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 25.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 146 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 20 NumberOfFragments, 374 HoareAnnotationTreeSize, 12 FomulaSimplifications, 1331 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 527 FormulaSimplificationTreeSizeReductionInter, 42.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 48807 SizeOfPredicates, 2 NumberOfNonLiveVariables, 124 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 8/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...