./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ldv-regression/test22_true-unreach-call.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_0318818b-e3d5-47e7-ba07-b538dab64c1d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0318818b-e3d5-47e7-ba07-b538dab64c1d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0318818b-e3d5-47e7-ba07-b538dab64c1d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0318818b-e3d5-47e7-ba07-b538dab64c1d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/test22_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0318818b-e3d5-47e7-ba07-b538dab64c1d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0318818b-e3d5-47e7-ba07-b538dab64c1d/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash efd11941ceab8dc56d9aa56f1950f714738654ba ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 01:03:02,416 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 01:03:02,417 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 01:03:02,426 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 01:03:02,427 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 01:03:02,427 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 01:03:02,428 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 01:03:02,430 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 01:03:02,432 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 01:03:02,433 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 01:03:02,433 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 01:03:02,433 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 01:03:02,434 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 01:03:02,435 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 01:03:02,436 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 01:03:02,437 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 01:03:02,437 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 01:03:02,439 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 01:03:02,441 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 01:03:02,442 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 01:03:02,443 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 01:03:02,444 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 01:03:02,446 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 01:03:02,446 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 01:03:02,447 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 01:03:02,447 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 01:03:02,448 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 01:03:02,449 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 01:03:02,449 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 01:03:02,451 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 01:03:02,451 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 01:03:02,452 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 01:03:02,452 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 01:03:02,452 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 01:03:02,453 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 01:03:02,453 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 01:03:02,454 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0318818b-e3d5-47e7-ba07-b538dab64c1d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-27 01:03:02,465 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 01:03:02,465 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 01:03:02,466 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 01:03:02,467 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 01:03:02,467 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 01:03:02,467 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 01:03:02,467 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 01:03:02,467 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 01:03:02,467 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 01:03:02,467 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 01:03:02,468 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 01:03:02,468 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 01:03:02,468 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 01:03:02,469 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 01:03:02,469 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 01:03:02,469 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 01:03:02,469 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 01:03:02,469 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 01:03:02,469 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 01:03:02,469 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 01:03:02,469 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 01:03:02,470 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 01:03:02,470 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 01:03:02,472 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 01:03:02,472 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 01:03:02,472 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 01:03:02,472 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 01:03:02,472 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 01:03:02,473 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 01:03:02,473 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 01:03:02,473 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 01:03:02,473 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 01:03:02,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 01:03:02,473 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 01:03:02,473 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_0318818b-e3d5-47e7-ba07-b538dab64c1d/bin-2019/utaipan 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 -> Taipan 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 -> efd11941ceab8dc56d9aa56f1950f714738654ba [2018-10-27 01:03:02,503 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 01:03:02,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 01:03:02,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 01:03:02,516 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 01:03:02,517 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 01:03:02,517 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0318818b-e3d5-47e7-ba07-b538dab64c1d/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/test22_true-unreach-call.c [2018-10-27 01:03:02,572 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0318818b-e3d5-47e7-ba07-b538dab64c1d/bin-2019/utaipan/data/90ed8ee86/d86aa413ab07446d99c0010cd6089dee/FLAG14da135f9 [2018-10-27 01:03:02,964 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 01:03:02,964 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0318818b-e3d5-47e7-ba07-b538dab64c1d/sv-benchmarks/c/ldv-regression/test22_true-unreach-call.c [2018-10-27 01:03:02,971 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0318818b-e3d5-47e7-ba07-b538dab64c1d/bin-2019/utaipan/data/90ed8ee86/d86aa413ab07446d99c0010cd6089dee/FLAG14da135f9 [2018-10-27 01:03:02,987 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0318818b-e3d5-47e7-ba07-b538dab64c1d/bin-2019/utaipan/data/90ed8ee86/d86aa413ab07446d99c0010cd6089dee [2018-10-27 01:03:02,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 01:03:02,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 01:03:02,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 01:03:02,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 01:03:02,997 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 01:03:02,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 01:03:02" (1/1) ... [2018-10-27 01:03:03,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf504d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:03, skipping insertion in model container [2018-10-27 01:03:03,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 01:03:02" (1/1) ... [2018-10-27 01:03:03,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 01:03:03,035 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 01:03:03,192 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 01:03:03,204 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 01:03:03,221 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 01:03:03,236 INFO L193 MainTranslator]: Completed translation [2018-10-27 01:03:03,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:03 WrapperNode [2018-10-27 01:03:03,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 01:03:03,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 01:03:03,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 01:03:03,238 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 01:03:03,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:03" (1/1) ... [2018-10-27 01:03:03,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:03" (1/1) ... [2018-10-27 01:03:03,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 01:03:03,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 01:03:03,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 01:03:03,282 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 01:03:03,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:03" (1/1) ... [2018-10-27 01:03:03,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:03" (1/1) ... [2018-10-27 01:03:03,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:03" (1/1) ... [2018-10-27 01:03:03,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:03" (1/1) ... [2018-10-27 01:03:03,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:03" (1/1) ... [2018-10-27 01:03:03,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:03" (1/1) ... [2018-10-27 01:03:03,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:03" (1/1) ... [2018-10-27 01:03:03,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 01:03:03,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 01:03:03,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 01:03:03,319 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 01:03:03,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0318818b-e3d5-47e7-ba07-b538dab64c1d/bin-2019/utaipan/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-10-27 01:03:03,418 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-10-27 01:03:03,418 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-10-27 01:03:03,418 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 01:03:03,418 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 01:03:03,418 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-10-27 01:03:03,418 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-10-27 01:03:03,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 01:03:03,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 01:03:03,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 01:03:03,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 01:03:03,419 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-10-27 01:03:03,419 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-10-27 01:03:03,825 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 01:03:03,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 01:03:03 BoogieIcfgContainer [2018-10-27 01:03:03,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 01:03:03,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 01:03:03,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 01:03:03,829 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 01:03:03,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 01:03:02" (1/3) ... [2018-10-27 01:03:03,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2141e601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 01:03:03, skipping insertion in model container [2018-10-27 01:03:03,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:03" (2/3) ... [2018-10-27 01:03:03,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2141e601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 01:03:03, skipping insertion in model container [2018-10-27 01:03:03,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 01:03:03" (3/3) ... [2018-10-27 01:03:03,833 INFO L112 eAbstractionObserver]: Analyzing ICFG test22_true-unreach-call.c [2018-10-27 01:03:03,842 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 01:03:03,849 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 01:03:03,863 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 01:03:03,889 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 01:03:03,889 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 01:03:03,890 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 01:03:03,890 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 01:03:03,890 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 01:03:03,890 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 01:03:03,891 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 01:03:03,891 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 01:03:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-10-27 01:03:03,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 01:03:03,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:03,913 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:03,916 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:03,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:03,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1344427580, now seen corresponding path program 1 times [2018-10-27 01:03:03,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:03,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:03,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:03,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:03,965 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:04,103 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 01:03:04,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 01:03:04,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 01:03:04,105 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 01:03:04,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 01:03:04,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 01:03:04,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 01:03:04,131 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-10-27 01:03:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:04,147 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-10-27 01:03:04,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 01:03:04,148 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-10-27 01:03:04,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:04,156 INFO L225 Difference]: With dead ends: 50 [2018-10-27 01:03:04,156 INFO L226 Difference]: Without dead ends: 32 [2018-10-27 01:03:04,158 INFO L605 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-10-27 01:03:04,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-27 01:03:04,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-27 01:03:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-27 01:03:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-10-27 01:03:04,190 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 37 [2018-10-27 01:03:04,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:04,192 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-10-27 01:03:04,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 01:03:04,192 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-10-27 01:03:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-27 01:03:04,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:04,194 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:04,194 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:04,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:04,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1544381942, now seen corresponding path program 1 times [2018-10-27 01:03:04,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:04,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:04,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:04,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:04,196 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 01:03:04,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:04,702 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:04,703 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-10-27 01:03:04,704 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [9], [13], [14], [17], [19], [21], [24], [30], [34], [36], [39], [46], [49], [56], [59], [60], [61], [62], [63], [65], [66], [67], [68], [69], [70], [71], [72], [73], [74] [2018-10-27 01:03:04,754 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 01:03:04,754 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 01:03:04,942 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 01:03:05,207 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 01:03:05,209 INFO L272 AbstractInterpreter]: Visited 33 different actions 39 times. Never merged. Never widened. Never found a fixpoint. Largest state had 43 variables. [2018-10-27 01:03:05,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:05,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 01:03:05,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:05,232 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0318818b-e3d5-47e7-ba07-b538dab64c1d/bin-2019/utaipan/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-10-27 01:03:05,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:05,239 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 01:03:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:05,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:05,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-10-27 01:03:05,721 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-27 01:03:05,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:05,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:05,796 INFO L477 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 21 treesize of output 17 [2018-10-27 01:03:05,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-27 01:03:05,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:05,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:05,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:05,875 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:43, output treesize:5 [2018-10-27 01:03:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 01:03:05,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:06,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2018-10-27 01:03:06,211 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-10-27 01:03:06,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:06,222 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:06,223 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:06,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-10-27 01:03:06,224 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:06,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:06,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:06,239 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:13, output treesize:7 [2018-10-27 01:03:06,293 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 01:03:06,312 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 01:03:06,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [11] total 17 [2018-10-27 01:03:06,312 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 01:03:06,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 01:03:06,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 01:03:06,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-10-27 01:03:06,313 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2018-10-27 01:03:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:06,458 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-10-27 01:03:06,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 01:03:06,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-10-27 01:03:06,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:06,459 INFO L225 Difference]: With dead ends: 44 [2018-10-27 01:03:06,459 INFO L226 Difference]: Without dead ends: 36 [2018-10-27 01:03:06,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-10-27 01:03:06,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-27 01:03:06,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-10-27 01:03:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-27 01:03:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-10-27 01:03:06,466 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 39 [2018-10-27 01:03:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:06,467 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-10-27 01:03:06,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 01:03:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-10-27 01:03:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-27 01:03:06,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:06,477 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:06,477 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:06,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:06,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1044718339, now seen corresponding path program 1 times [2018-10-27 01:03:06,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:06,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:06,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:06,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:06,479 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 01:03:06,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:06,710 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:06,710 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-10-27 01:03:06,711 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [9], [13], [14], [17], [19], [21], [24], [30], [34], [36], [39], [41], [46], [49], [56], [59], [60], [61], [62], [63], [65], [66], [67], [68], [69], [70], [71], [72], [73], [74] [2018-10-27 01:03:06,713 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 01:03:06,713 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 01:03:06,748 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 01:03:06,949 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 01:03:06,951 INFO L272 AbstractInterpreter]: Visited 34 different actions 42 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 44 variables. [2018-10-27 01:03:07,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:07,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 01:03:07,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:07,003 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0318818b-e3d5-47e7-ba07-b538dab64c1d/bin-2019/utaipan/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-10-27 01:03:07,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:07,017 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 01:03:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:07,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:07,487 INFO L477 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 21 treesize of output 17 [2018-10-27 01:03:07,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-27 01:03:07,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:07,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:07,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-10-27 01:03:07,519 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-27 01:03:07,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:07,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:07,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:07,550 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:43, output treesize:5 [2018-10-27 01:03:07,552 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 01:03:07,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:07,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2018-10-27 01:03:07,626 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-10-27 01:03:07,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:07,633 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:07,633 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:07,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-10-27 01:03:07,635 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:07,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:07,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:07,642 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:13, output treesize:7 [2018-10-27 01:03:07,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 01:03:07,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:03:07,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 20 [2018-10-27 01:03:07,686 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:03:07,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 01:03:07,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 01:03:07,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-10-27 01:03:07,687 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 16 states. [2018-10-27 01:03:08,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:08,447 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2018-10-27 01:03:08,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 01:03:08,449 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-10-27 01:03:08,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:08,451 INFO L225 Difference]: With dead ends: 77 [2018-10-27 01:03:08,451 INFO L226 Difference]: Without dead ends: 69 [2018-10-27 01:03:08,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=217, Invalid=839, Unknown=0, NotChecked=0, Total=1056 [2018-10-27 01:03:08,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-27 01:03:08,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 38. [2018-10-27 01:03:08,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-27 01:03:08,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-10-27 01:03:08,465 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 42 [2018-10-27 01:03:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:08,465 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-10-27 01:03:08,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 01:03:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-10-27 01:03:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 01:03:08,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:08,467 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:08,467 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:08,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:08,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1922969302, now seen corresponding path program 2 times [2018-10-27 01:03:08,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:08,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:08,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:08,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:08,468 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 01:03:08,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:08,705 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:08,705 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 01:03:08,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 01:03:08,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:08,705 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0318818b-e3d5-47e7-ba07-b538dab64c1d/bin-2019/utaipan/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-10-27 01:03:08,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 01:03:08,715 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 01:03:08,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 01:03:08,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 01:03:08,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-27 01:03:09,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:09,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2018-10-27 01:03:09,499 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-10-27 01:03:09,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:09,505 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:09,506 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:09,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-10-27 01:03:09,507 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:09,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:09,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:09,516 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2018-10-27 01:03:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-27 01:03:09,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:03:09,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2018-10-27 01:03:09,615 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:03:09,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 01:03:09,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 01:03:09,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2018-10-27 01:03:09,617 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 22 states. [2018-10-27 01:03:10,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:10,765 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2018-10-27 01:03:10,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-27 01:03:10,766 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-10-27 01:03:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:10,766 INFO L225 Difference]: With dead ends: 79 [2018-10-27 01:03:10,766 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 01:03:10,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=510, Invalid=2460, Unknown=0, NotChecked=0, Total=2970 [2018-10-27 01:03:10,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 01:03:10,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 01:03:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 01:03:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 01:03:10,768 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-10-27 01:03:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:10,768 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 01:03:10,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-27 01:03:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 01:03:10,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 01:03:10,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 01:03:10,917 INFO L425 ceAbstractionStarter]: For program point initEXIT(lines 11 18) no Hoare annotation was computed. [2018-10-27 01:03:10,918 INFO L428 ceAbstractionStarter]: At program point initENTRY(lines 11 18) the Hoare annotation is: true [2018-10-27 01:03:10,918 INFO L425 ceAbstractionStarter]: For program point initFINAL(lines 11 18) no Hoare annotation was computed. [2018-10-27 01:03:10,918 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 01:03:10,918 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-27 01:03:10,918 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 01:03:10,918 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 01:03:10,918 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 01:03:10,918 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 01:03:10,918 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 01:03:10,918 INFO L425 ceAbstractionStarter]: For program point get_dummyFINAL(lines 20 23) no Hoare annotation was computed. [2018-10-27 01:03:10,918 INFO L428 ceAbstractionStarter]: At program point get_dummyENTRY(lines 20 23) the Hoare annotation is: true [2018-10-27 01:03:10,918 INFO L425 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-10-27 01:03:10,919 INFO L425 ceAbstractionStarter]: For program point get_dummyEXIT(lines 20 23) no Hoare annotation was computed. [2018-10-27 01:03:10,919 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-10-27 01:03:10,919 INFO L425 ceAbstractionStarter]: For program point L35-2(lines 35 44) no Hoare annotation was computed. [2018-10-27 01:03:10,919 INFO L428 ceAbstractionStarter]: At program point L33-1(line 33) the Hoare annotation is: true [2018-10-27 01:03:10,919 INFO L425 ceAbstractionStarter]: For program point L33-2(line 33) no Hoare annotation was computed. [2018-10-27 01:03:10,919 INFO L425 ceAbstractionStarter]: For program point L35-4(lines 35 44) no Hoare annotation was computed. [2018-10-27 01:03:10,919 INFO L428 ceAbstractionStarter]: At program point L33-3(line 33) the Hoare annotation is: true [2018-10-27 01:03:10,919 INFO L425 ceAbstractionStarter]: For program point L33-4(line 33) no Hoare annotation was computed. [2018-10-27 01:03:10,919 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 30 50) no Hoare annotation was computed. [2018-10-27 01:03:10,919 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 30 50) no Hoare annotation was computed. [2018-10-27 01:03:10,919 INFO L421 ceAbstractionStarter]: At program point L42(lines 31 50) the Hoare annotation is: false [2018-10-27 01:03:10,919 INFO L425 ceAbstractionStarter]: For program point L38-1(lines 38 40) no Hoare annotation was computed. [2018-10-27 01:03:10,919 INFO L425 ceAbstractionStarter]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2018-10-27 01:03:10,920 INFO L421 ceAbstractionStarter]: At program point L38-4(lines 38 40) the Hoare annotation is: (and (= main_~pd2~0.offset main_~pa~0.offset) (= main_~pd2~0.offset main_~pd1~0.offset) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.base main_~pd1~0.base) (or (not (= 0 main_~pd1~0.base)) (not (= main_~pd1~0.offset 0)))) [2018-10-27 01:03:10,920 INFO L421 ceAbstractionStarter]: At program point L38-5(lines 38 40) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pd2~0.base) main_~pd2~0.offset))) (and (= main_~pd2~0.offset main_~pa~0.offset) (= main_~pd2~0.offset main_~pd1~0.offset) (<= main_~i~0 .cse0) (<= .cse0 main_~i~0) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.base main_~pd1~0.base) (or (not (= 0 main_~pd1~0.base)) (not (= main_~pd1~0.offset 0))))) [2018-10-27 01:03:10,920 INFO L428 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: true [2018-10-27 01:03:10,920 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 30 50) the Hoare annotation is: true [2018-10-27 01:03:10,920 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2018-10-27 01:03:10,920 INFO L425 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-10-27 01:03:10,920 INFO L425 ceAbstractionStarter]: For program point L41-1(lines 41 43) no Hoare annotation was computed. [2018-10-27 01:03:10,920 INFO L425 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-10-27 01:03:10,920 INFO L428 ceAbstractionStarter]: At program point checkENTRY(lines 25 28) the Hoare annotation is: true [2018-10-27 01:03:10,920 INFO L425 ceAbstractionStarter]: For program point checkFINAL(lines 25 28) no Hoare annotation was computed. [2018-10-27 01:03:10,920 INFO L425 ceAbstractionStarter]: For program point checkEXIT(lines 25 28) no Hoare annotation was computed. [2018-10-27 01:03:10,926 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:10,930 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:10,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 01:03:10 BoogieIcfgContainer [2018-10-27 01:03:10,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 01:03:10,933 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 01:03:10,933 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 01:03:10,933 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 01:03:10,933 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 01:03:03" (3/4) ... [2018-10-27 01:03:10,937 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 01:03:10,942 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init [2018-10-27 01:03:10,943 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 01:03:10,943 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2018-10-27 01:03:10,943 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 01:03:10,943 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-10-27 01:03:10,949 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2018-10-27 01:03:10,949 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-10-27 01:03:10,949 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-10-27 01:03:10,949 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-27 01:03:10,995 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0318818b-e3d5-47e7-ba07-b538dab64c1d/bin-2019/utaipan/witness.graphml [2018-10-27 01:03:10,996 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 01:03:10,997 INFO L168 Benchmark]: Toolchain (without parser) took 8005.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 958.1 MB in the beginning and 1.0 GB in the end (delta: -47.3 MB). Peak memory consumption was 149.8 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:11,004 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 01:03:11,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.83 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 946.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:11,005 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.93 ms. Allocated memory is still 1.0 GB. Free memory was 946.2 MB in the beginning and 943.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:11,005 INFO L168 Benchmark]: Boogie Preprocessor took 37.33 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 940.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:11,005 INFO L168 Benchmark]: RCFGBuilder took 506.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:11,006 INFO L168 Benchmark]: TraceAbstraction took 7105.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 122.4 MB). Peak memory consumption was 164.3 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:11,006 INFO L168 Benchmark]: Witness Printer took 62.99 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-10-27 01:03:11,008 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.83 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 946.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.93 ms. Allocated memory is still 1.0 GB. Free memory was 946.2 MB in the beginning and 943.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.33 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 940.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 506.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7105.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 122.4 MB). Peak memory consumption was 164.3 MB. Max. memory is 11.5 GB. * Witness Printer took 62.99 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: 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: 38]: Loop Invariant [2018-10-27 01:03:11,018 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:11,019 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((pd2 == pa && pd2 == pd1) && i <= unknown-#memory_int-unknown[pa][pa]) && pd2 == pa) && pd2 == pd1) && (!(0 == pd1) || !(pd1 == 0)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. SAFE Result, 7.0s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 126 SDtfs, 119 SDslu, 758 SDs, 0 SdLazy, 608 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 226 SyntacticMatches, 6 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.8s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 32 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 23 PreInvPairs, 35 NumberOfFragments, 76 HoareAnnotationTreeSize, 23 FomulaSimplifications, 436 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 379 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 289 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 64379 SizeOfPredicates, 68 NumberOfNonLiveVariables, 709 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 111/156 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...