./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test22_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test22_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/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 efd11941ceab8dc56d9aa56f1950f714738654ba .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 15:25:44,207 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:25:44,208 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:25:44,214 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:25:44,214 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:25:44,215 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:25:44,215 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:25:44,217 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:25:44,218 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:25:44,218 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:25:44,219 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:25:44,219 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:25:44,220 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:25:44,220 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:25:44,220 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:25:44,221 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:25:44,221 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:25:44,222 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:25:44,223 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:25:44,224 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:25:44,224 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:25:44,225 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:25:44,226 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:25:44,227 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:25:44,227 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:25:44,227 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:25:44,228 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:25:44,228 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:25:44,229 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:25:44,229 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:25:44,229 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:25:44,230 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:25:44,230 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:25:44,230 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:25:44,231 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:25:44,231 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:25:44,231 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 15:25:44,239 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:25:44,239 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:25:44,239 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 15:25:44,239 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 15:25:44,240 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 15:25:44,240 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 15:25:44,240 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 15:25:44,240 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:25:44,240 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 15:25:44,240 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:25:44,241 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 15:25:44,241 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:25:44,241 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 15:25:44,241 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 15:25:44,241 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 15:25:44,241 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 15:25:44,242 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 15:25:44,242 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 15:25:44,242 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 15:25:44,242 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:25:44,242 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 15:25:44,242 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 15:25:44,242 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 15:25:44,243 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:25:44,243 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:25:44,243 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 15:25:44,243 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 15:25:44,243 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 15:25:44,243 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 15:25:44,243 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 15:25:44,243 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_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/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 -> efd11941ceab8dc56d9aa56f1950f714738654ba [2018-12-02 15:25:44,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:25:44,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:25:44,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:25:44,279 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:25:44,279 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:25:44,280 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test22_true-unreach-call.c [2018-12-02 15:25:44,325 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/bin-2019/uautomizer/data/2c8d63e06/84c08a5ad07d425e9328f956e23da301/FLAGccfe641a4 [2018-12-02 15:25:44,710 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:25:44,710 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/sv-benchmarks/c/ldv-regression/test22_true-unreach-call.c [2018-12-02 15:25:44,714 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/bin-2019/uautomizer/data/2c8d63e06/84c08a5ad07d425e9328f956e23da301/FLAGccfe641a4 [2018-12-02 15:25:44,722 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/bin-2019/uautomizer/data/2c8d63e06/84c08a5ad07d425e9328f956e23da301 [2018-12-02 15:25:44,724 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:25:44,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 15:25:44,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:25:44,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:25:44,727 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:25:44,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:25:44" (1/1) ... [2018-12-02 15:25:44,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28bd7f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:25:44, skipping insertion in model container [2018-12-02 15:25:44,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:25:44" (1/1) ... [2018-12-02 15:25:44,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:25:44,743 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:25:44,832 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:25:44,838 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:25:44,849 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:25:44,858 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:25:44,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:25:44 WrapperNode [2018-12-02 15:25:44,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:25:44,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 15:25:44,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 15:25:44,858 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 15:25:44,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:25:44" (1/1) ... [2018-12-02 15:25:44,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:25:44" (1/1) ... [2018-12-02 15:25:44,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 15:25:44,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:25:44,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:25:44,872 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:25:44,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:25:44" (1/1) ... [2018-12-02 15:25:44,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:25:44" (1/1) ... [2018-12-02 15:25:44,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:25:44" (1/1) ... [2018-12-02 15:25:44,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:25:44" (1/1) ... [2018-12-02 15:25:44,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:25:44" (1/1) ... [2018-12-02 15:25:44,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:25:44" (1/1) ... [2018-12-02 15:25:44,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:25:44" (1/1) ... [2018-12-02 15:25:44,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:25:44,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:25:44,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:25:44,918 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:25:44,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:25:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/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-12-02 15:25:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-12-02 15:25:44,948 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-12-02 15:25:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 15:25:44,948 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 15:25:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-02 15:25:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-12-02 15:25:44,948 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-12-02 15:25:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 15:25:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 15:25:44,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 15:25:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 15:25:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-12-02 15:25:44,949 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-12-02 15:25:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:25:44,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:25:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 15:25:45,071 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:25:45,071 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 15:25:45,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:25:45 BoogieIcfgContainer [2018-12-02 15:25:45,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:25:45,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 15:25:45,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 15:25:45,073 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 15:25:45,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:25:44" (1/3) ... [2018-12-02 15:25:45,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d6a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:25:45, skipping insertion in model container [2018-12-02 15:25:45,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:25:44" (2/3) ... [2018-12-02 15:25:45,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d6a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:25:45, skipping insertion in model container [2018-12-02 15:25:45,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:25:45" (3/3) ... [2018-12-02 15:25:45,075 INFO L112 eAbstractionObserver]: Analyzing ICFG test22_true-unreach-call.c [2018-12-02 15:25:45,081 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 15:25:45,085 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 15:25:45,094 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 15:25:45,111 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 15:25:45,111 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 15:25:45,112 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 15:25:45,112 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 15:25:45,112 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:25:45,112 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:25:45,112 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 15:25:45,112 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:25:45,112 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 15:25:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-12-02 15:25:45,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 15:25:45,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:25:45,127 INFO L402 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-12-02 15:25:45,128 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:25:45,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:25:45,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1838243936, now seen corresponding path program 1 times [2018-12-02 15:25:45,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:25:45,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:25:45,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:45,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:25:45,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:25:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 15:25:45,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:25:45,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 15:25:45,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 15:25:45,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 15:25:45,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 15:25:45,246 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-12-02 15:25:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:25:45,258 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-12-02 15:25:45,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 15:25:45,259 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-12-02 15:25:45,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:25:45,264 INFO L225 Difference]: With dead ends: 49 [2018-12-02 15:25:45,264 INFO L226 Difference]: Without dead ends: 31 [2018-12-02 15:25:45,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 15:25:45,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-02 15:25:45,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-02 15:25:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 15:25:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-12-02 15:25:45,289 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2018-12-02 15:25:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:25:45,290 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-02 15:25:45,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 15:25:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-12-02 15:25:45,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 15:25:45,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:25:45,291 INFO L402 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] [2018-12-02 15:25:45,292 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:25:45,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:25:45,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1291679579, now seen corresponding path program 1 times [2018-12-02 15:25:45,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:25:45,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:25:45,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:45,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:25:45,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:25:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:25:45,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:25:45,443 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/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-12-02 15:25:45,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:25:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:25:45,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:25:45,597 INFO L478 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-12-02 15:25:45,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-02 15:25:45,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:25:45,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:45,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-02 15:25:45,621 INFO L478 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-12-02 15:25:45,621 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 15:25:45,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:45,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:45,630 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:43, output treesize:5 [2018-12-02 15:25:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 15:25:45,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 15:25:45,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2018-12-02 15:25:45,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 15:25:45,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 15:25:45,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-02 15:25:45,651 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 13 states. [2018-12-02 15:25:46,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:25:46,001 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2018-12-02 15:25:46,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 15:25:46,001 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-12-02 15:25:46,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:25:46,004 INFO L225 Difference]: With dead ends: 67 [2018-12-02 15:25:46,004 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 15:25:46,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-02 15:25:46,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 15:25:46,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 33. [2018-12-02 15:25:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 15:25:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-02 15:25:46,013 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 38 [2018-12-02 15:25:46,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:25:46,014 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-02 15:25:46,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 15:25:46,014 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-02 15:25:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 15:25:46,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:25:46,015 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-12-02 15:25:46,015 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:25:46,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:25:46,016 INFO L82 PathProgramCache]: Analyzing trace with hash -142788074, now seen corresponding path program 1 times [2018-12-02 15:25:46,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:25:46,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:25:46,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:46,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:25:46,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:25:46,164 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:25:46,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:25:46,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/bin-2019/uautomizer/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-12-02 15:25:46,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:25:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:25:46,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:25:46,267 INFO L478 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-12-02 15:25:46,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-02 15:25:46,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:25:46,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:46,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-02 15:25:46,288 INFO L478 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-12-02 15:25:46,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 15:25:46,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:46,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:46,297 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:43, output treesize:5 [2018-12-02 15:25:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 15:25:46,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:25:46,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2018-12-02 15:25:46,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 15:25:46,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 15:25:46,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-12-02 15:25:46,315 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 16 states. [2018-12-02 15:25:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:25:46,702 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2018-12-02 15:25:46,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 15:25:46,702 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-12-02 15:25:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:25:46,703 INFO L225 Difference]: With dead ends: 71 [2018-12-02 15:25:46,703 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 15:25:46,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2018-12-02 15:25:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 15:25:46,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 35. [2018-12-02 15:25:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 15:25:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-12-02 15:25:46,708 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 40 [2018-12-02 15:25:46,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:25:46,708 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-12-02 15:25:46,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 15:25:46,708 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-12-02 15:25:46,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 15:25:46,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:25:46,709 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 15:25:46,709 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:25:46,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:25:46,709 INFO L82 PathProgramCache]: Analyzing trace with hash 18299409, now seen corresponding path program 2 times [2018-12-02 15:25:46,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:25:46,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:25:46,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:46,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:25:46,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:25:46,851 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:25:46,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:25:46,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/bin-2019/uautomizer/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-12-02 15:25:46,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 15:25:46,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:25:46,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:25:46,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:25:47,006 INFO L478 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-12-02 15:25:47,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-02 15:25:47,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:25:47,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:47,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-02 15:25:47,018 INFO L478 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-12-02 15:25:47,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 15:25:47,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:47,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:47,026 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:43, output treesize:5 [2018-12-02 15:25:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:25:47,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:25:47,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2018-12-02 15:25:47,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 15:25:47,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 15:25:47,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-12-02 15:25:47,043 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 22 states. [2018-12-02 15:25:47,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:25:47,508 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2018-12-02 15:25:47,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 15:25:47,508 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-12-02 15:25:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:25:47,509 INFO L225 Difference]: With dead ends: 75 [2018-12-02 15:25:47,509 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 15:25:47,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=260, Invalid=1222, Unknown=0, NotChecked=0, Total=1482 [2018-12-02 15:25:47,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 15:25:47,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2018-12-02 15:25:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 15:25:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-12-02 15:25:47,514 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 42 [2018-12-02 15:25:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:25:47,514 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-02 15:25:47,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 15:25:47,514 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-12-02 15:25:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 15:25:47,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:25:47,515 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 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-12-02 15:25:47,515 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:25:47,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:25:47,515 INFO L82 PathProgramCache]: Analyzing trace with hash 204547916, now seen corresponding path program 3 times [2018-12-02 15:25:47,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:25:47,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:25:47,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:47,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:25:47,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:25:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:25:47,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:25:47,644 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:25:47,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 15:25:47,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 15:25:47,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:25:47,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:25:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 15:25:47,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:25:47,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2018-12-02 15:25:47,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 15:25:47,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 15:25:47,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2018-12-02 15:25:47,882 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 28 states. [2018-12-02 15:25:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:25:48,749 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2018-12-02 15:25:48,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 15:25:48,749 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 44 [2018-12-02 15:25:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:25:48,750 INFO L225 Difference]: With dead ends: 86 [2018-12-02 15:25:48,750 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 15:25:48,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=1517, Unknown=0, NotChecked=0, Total=1806 [2018-12-02 15:25:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 15:25:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2018-12-02 15:25:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 15:25:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-12-02 15:25:48,756 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 44 [2018-12-02 15:25:48,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:25:48,756 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-12-02 15:25:48,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 15:25:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-12-02 15:25:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 15:25:48,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:25:48,756 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 1] [2018-12-02 15:25:48,757 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:25:48,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:25:48,757 INFO L82 PathProgramCache]: Analyzing trace with hash -304925174, now seen corresponding path program 1 times [2018-12-02 15:25:48,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:25:48,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:25:48,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:48,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:25:48,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:25:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 15:25:48,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:25:48,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:25:48,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:25:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:25:48,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:25:48,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-12-02 15:25:48,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-02 15:25:48,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:25:48,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:48,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:48,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-02 15:25:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-02 15:25:48,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:25:48,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-12-02 15:25:48,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 15:25:48,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 15:25:48,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-02 15:25:48,908 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 16 states. [2018-12-02 15:25:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:25:49,042 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-12-02 15:25:49,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 15:25:49,042 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-12-02 15:25:49,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:25:49,043 INFO L225 Difference]: With dead ends: 65 [2018-12-02 15:25:49,043 INFO L226 Difference]: Without dead ends: 40 [2018-12-02 15:25:49,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-12-02 15:25:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-02 15:25:49,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-02 15:25:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 15:25:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-02 15:25:49,047 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 44 [2018-12-02 15:25:49,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:25:49,047 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-02 15:25:49,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 15:25:49,047 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-12-02 15:25:49,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 15:25:49,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:25:49,048 INFO L402 BasicCegarLoop]: trace histogram [4, 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, 1] [2018-12-02 15:25:49,048 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:25:49,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:25:49,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2039435382, now seen corresponding path program 2 times [2018-12-02 15:25:49,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:25:49,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:25:49,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:49,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:25:49,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:25:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 15:25:49,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:25:49,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:25:49,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 15:25:49,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:25:49,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:25:49,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:25:49,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-12-02 15:25:49,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 36 treesize of output 35 [2018-12-02 15:25:49,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:25:49,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2018-12-02 15:25:49,153 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 15:25:49,159 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:49,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-12-02 15:25:49,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:25:49,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 44 [2018-12-02 15:25:49,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:25:49,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:25:49,188 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:25:49,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2018-12-02 15:25:49,191 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 15:25:49,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:25:49,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:25:49,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 59 [2018-12-02 15:25:49,231 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-02 15:25:49,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:25:49,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:25:49,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:25:49,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 47 [2018-12-02 15:25:49,282 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 15:25:49,302 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 15:25:49,319 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 15:25:49,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 15:25:49,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2018-12-02 15:25:49,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 [2018-12-02 15:25:49,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:25:49,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 15:25:49,351 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 15:25:49,357 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:49,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-02 15:25:49,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 [2018-12-02 15:25:49,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:25:49,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 15:25:49,374 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 15:25:49,377 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:49,384 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:49,389 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:49,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:49,416 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:42, output treesize:1 [2018-12-02 15:25:49,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-02 15:25:49,505 INFO L478 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-12-02 15:25:49,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:25:49,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:49,514 INFO L478 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-12-02 15:25:49,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-02 15:25:49,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 15:25:49,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:49,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:25:49,523 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:43, output treesize:5 [2018-12-02 15:25:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:25:49,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:25:49,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-12-02 15:25:49,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 15:25:49,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 15:25:49,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-12-02 15:25:49,550 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 19 states. [2018-12-02 15:25:49,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:25:49,948 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-12-02 15:25:49,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 15:25:49,948 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-12-02 15:25:49,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:25:49,948 INFO L225 Difference]: With dead ends: 63 [2018-12-02 15:25:49,949 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 15:25:49,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=1205, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 15:25:49,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 15:25:49,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 15:25:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 15:25:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-12-02 15:25:49,955 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 44 [2018-12-02 15:25:49,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:25:49,955 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-12-02 15:25:49,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 15:25:49,955 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-12-02 15:25:49,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 15:25:49,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:25:49,956 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 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, 1] [2018-12-02 15:25:49,956 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:25:49,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:25:49,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1570997821, now seen corresponding path program 3 times [2018-12-02 15:25:49,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:25:49,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:25:49,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:49,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:25:49,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:25:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:25:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:25:50,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:25:50,145 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:25:50,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 15:25:50,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 15:25:50,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:25:50,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:25:50,357 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-02 15:25:50,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:25:50,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-12-02 15:25:50,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-02 15:25:50,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-02 15:25:50,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2018-12-02 15:25:50,372 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 29 states. [2018-12-02 15:25:51,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:25:51,151 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-12-02 15:25:51,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 15:25:51,151 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 46 [2018-12-02 15:25:51,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:25:51,151 INFO L225 Difference]: With dead ends: 50 [2018-12-02 15:25:51,151 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 15:25:51,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=345, Invalid=1725, Unknown=0, NotChecked=0, Total=2070 [2018-12-02 15:25:51,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 15:25:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 15:25:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 15:25:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 15:25:51,152 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-12-02 15:25:51,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:25:51,152 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:25:51,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-02 15:25:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 15:25:51,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 15:25:51,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 15:25:51,404 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 37 [2018-12-02 15:25:51,460 INFO L448 ceAbstractionStarter]: For program point initEXIT(lines 11 18) no Hoare annotation was computed. [2018-12-02 15:25:51,460 INFO L451 ceAbstractionStarter]: At program point initENTRY(lines 11 18) the Hoare annotation is: true [2018-12-02 15:25:51,460 INFO L448 ceAbstractionStarter]: For program point initFINAL(lines 11 18) no Hoare annotation was computed. [2018-12-02 15:25:51,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 15:25:51,460 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-02 15:25:51,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 15:25:51,460 INFO L448 ceAbstractionStarter]: For program point get_dummyFINAL(lines 20 23) no Hoare annotation was computed. [2018-12-02 15:25:51,460 INFO L451 ceAbstractionStarter]: At program point get_dummyENTRY(lines 20 23) the Hoare annotation is: true [2018-12-02 15:25:51,460 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-12-02 15:25:51,460 INFO L448 ceAbstractionStarter]: For program point get_dummyEXIT(lines 20 23) no Hoare annotation was computed. [2018-12-02 15:25:51,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 15:25:51,460 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 |~#d2~0.offset|) (not (= |~#d1~0.base| |~#d2~0.base|)) (= 0 |~#d1~0.offset|)) [2018-12-02 15:25:51,460 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 15:25:51,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 15:25:51,461 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-12-02 15:25:51,461 INFO L448 ceAbstractionStarter]: For program point L35-2(lines 35 44) no Hoare annotation was computed. [2018-12-02 15:25:51,461 INFO L444 ceAbstractionStarter]: At program point L33-1(line 33) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (and (= |~#d2~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d2~0.offset|)) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|)) (and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))) [2018-12-02 15:25:51,461 INFO L448 ceAbstractionStarter]: For program point L33-2(line 33) no Hoare annotation was computed. [2018-12-02 15:25:51,461 INFO L448 ceAbstractionStarter]: For program point L35-4(lines 35 44) no Hoare annotation was computed. [2018-12-02 15:25:51,461 INFO L444 ceAbstractionStarter]: At program point L33-3(line 33) the Hoare annotation is: (or (and (= main_~pd2~0.offset 0) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|)) (= |~#d1~0.base| |~#d2~0.base|) (not (= main_~pd2~0.base main_~pd1~0.base)) (and (= main_~pd2~0.offset main_~pd1~0.offset) (= |~#d2~0.base| main_~pd1~0.base) (= main_~pd1~0.offset 0)) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|))) [2018-12-02 15:25:51,461 INFO L448 ceAbstractionStarter]: For program point L33-4(line 33) no Hoare annotation was computed. [2018-12-02 15:25:51,461 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 30 50) no Hoare annotation was computed. [2018-12-02 15:25:51,461 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 30 50) no Hoare annotation was computed. [2018-12-02 15:25:51,461 INFO L444 ceAbstractionStarter]: At program point L42(lines 31 50) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|))) [2018-12-02 15:25:51,461 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 38 40) no Hoare annotation was computed. [2018-12-02 15:25:51,461 INFO L444 ceAbstractionStarter]: At program point L38-3(lines 38 40) the Hoare annotation is: (let ((.cse5 (= main_~pd1~0.offset 0))) (let ((.cse0 (or (not (= 0 main_~pd1~0.base)) (not .cse5))) (.cse1 (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (.cse2 (= main_~pd2~0.base main_~pa~0.base)) (.cse3 (= main_~pd2~0.offset 0)) (.cse4 (= main_~pd2~0.base main_~pd1~0.base))) (or (not (= |~#d2~0.offset| 0)) (= |~#d1~0.base| |~#d2~0.base|) (and .cse0 .cse1 (= 0 main_~pa~0.offset) .cse2 .cse3 .cse4 (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|)) (and (= main_~pd2~0.offset main_~pa~0.offset) (= |~#d2~0.base| main_~pd1~0.base) .cse0 .cse1 .cse2 .cse3 .cse5 .cse4) (not (= 0 |~#d1~0.offset|))))) [2018-12-02 15:25:51,461 INFO L444 ceAbstractionStarter]: At program point L38-4(lines 38 40) the Hoare annotation is: (let ((.cse0 (not (= 0 main_~pd1~0.base))) (.cse2 (= main_~pd2~0.base main_~pa~0.base)) (.cse3 (= main_~pd2~0.offset 0)) (.cse4 (= main_~pd2~0.base main_~pd1~0.base)) (.cse5 (select |#memory_int| main_~pd2~0.base))) (or (= |~#d1~0.base| |~#d2~0.base|) (let ((.cse1 (select .cse5 main_~pd2~0.offset))) (and (= main_~pd2~0.offset main_~pa~0.offset) .cse0 (<= main_~i~0 .cse1) (<= .cse1 main_~i~0) .cse2 .cse3 (= main_~pd1~0.offset 0) (= |~#d2~0.base| main_~pd1~0.base) .cse4)) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|)) (let ((.cse6 (select .cse5 0))) (and .cse0 (<= .cse6 main_~i~0) (<= main_~i~0 .cse6) (= 0 main_~pa~0.offset) .cse2 .cse3 .cse4 (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))))) [2018-12-02 15:25:51,461 INFO L451 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: true [2018-12-02 15:25:51,461 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 30 50) the Hoare annotation is: true [2018-12-02 15:25:51,461 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-12-02 15:25:51,462 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 41 43) no Hoare annotation was computed. [2018-12-02 15:25:51,462 INFO L448 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-12-02 15:25:51,462 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2018-12-02 15:25:51,462 INFO L451 ceAbstractionStarter]: At program point checkENTRY(lines 25 28) the Hoare annotation is: true [2018-12-02 15:25:51,462 INFO L448 ceAbstractionStarter]: For program point checkFINAL(lines 25 28) no Hoare annotation was computed. [2018-12-02 15:25:51,462 INFO L448 ceAbstractionStarter]: For program point checkEXIT(lines 25 28) no Hoare annotation was computed. [2018-12-02 15:25:51,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 15:25:51,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 15:25:51,471 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 15:25:51,471 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 15:25:51,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:25:51 BoogieIcfgContainer [2018-12-02 15:25:51,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 15:25:51,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 15:25:51,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 15:25:51,474 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 15:25:51,474 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:25:45" (3/4) ... [2018-12-02 15:25:51,477 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 15:25:51,481 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init [2018-12-02 15:25:51,481 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 15:25:51,481 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2018-12-02 15:25:51,481 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 15:25:51,481 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-12-02 15:25:51,484 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-12-02 15:25:51,484 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-02 15:25:51,484 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 15:25:51,484 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 15:25:51,518 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ccd8c91a-f96c-4660-8aed-e7aacc3aeedb/bin-2019/uautomizer/witness.graphml [2018-12-02 15:25:51,518 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 15:25:51,519 INFO L168 Benchmark]: Toolchain (without parser) took 6794.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -106.0 MB). Peak memory consumption was 92.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:25:51,519 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:25:51,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 132.97 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-02 15:25:51,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.52 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:25:51,520 INFO L168 Benchmark]: Boogie Preprocessor took 45.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-02 15:25:51,520 INFO L168 Benchmark]: RCFGBuilder took 153.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:25:51,521 INFO L168 Benchmark]: TraceAbstraction took 6401.75 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.6 MB). Peak memory consumption was 109.9 MB. Max. memory is 11.5 GB. [2018-12-02 15:25:51,521 INFO L168 Benchmark]: Witness Printer took 44.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:25:51,523 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 132.97 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.6 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 13.52 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 153.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6401.75 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.6 MB). Peak memory consumption was 109.9 MB. Max. memory is 11.5 GB. * Witness Printer took 44.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 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 * 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-12-02 15:25:51,526 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 15:25:51,526 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 15:25:51,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 15:25:51,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((!(d2 == 0) || d1 == d2) || ((((((((!(0 == pd1) || !(pd1 == 0)) && i <= unknown-#memory_int-unknown[pa][pa]) && 0 == pa) && pd2 == pa) && pd2 == 0) && pd2 == pd1) && d1 == pd1) && pd1 == d1)) || (((((((pd2 == pa && d2 == pd1) && (!(0 == pd1) || !(pd1 == 0))) && i <= unknown-#memory_int-unknown[pa][pa]) && pd2 == pa) && pd2 == 0) && pd1 == 0) && pd2 == pd1)) || !(0 == d1) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (d1 == d2 || !(d2 == 0)) || !(0 == d1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. SAFE Result, 6.3s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 232 SDtfs, 312 SDslu, 2110 SDs, 0 SdLazy, 2384 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 497 GetRequests, 253 SyntacticMatches, 19 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=5, 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, 8 MinimizatonAttempts, 102 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 28 PreInvPairs, 45 NumberOfFragments, 260 HoareAnnotationTreeSize, 28 FomulaSimplifications, 6035 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 1265 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 633 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 618 ConstructedInterpolants, 0 QuantifiedInterpolants, 108453 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1329 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 154/308 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...