./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test23_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_0f275e67-134d-4104-afc1-8e7b2feaa78b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/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 308e43cca528a064aecd41d099b341627e43bb71 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:06:43,057 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 09:06:43,058 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 09:06:43,064 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 09:06:43,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 09:06:43,065 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 09:06:43,066 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 09:06:43,067 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 09:06:43,067 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 09:06:43,068 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 09:06:43,068 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 09:06:43,068 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 09:06:43,069 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 09:06:43,069 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 09:06:43,070 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 09:06:43,070 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 09:06:43,071 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 09:06:43,071 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 09:06:43,072 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 09:06:43,073 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 09:06:43,074 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 09:06:43,074 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 09:06:43,075 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 09:06:43,075 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 09:06:43,076 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 09:06:43,076 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 09:06:43,077 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 09:06:43,077 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 09:06:43,077 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 09:06:43,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 09:06:43,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 09:06:43,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 09:06:43,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 09:06:43,079 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 09:06:43,079 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 09:06:43,079 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 09:06:43,080 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 09:06:43,086 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 09:06:43,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 09:06:43,087 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 09:06:43,087 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 09:06:43,088 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 09:06:43,088 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 09:06:43,088 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 09:06:43,088 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 09:06:43,088 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 09:06:43,088 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 09:06:43,088 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 09:06:43,088 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 09:06:43,088 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 09:06:43,088 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 09:06:43,088 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 09:06:43,089 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 09:06:43,089 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 09:06:43,089 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 09:06:43,089 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 09:06:43,089 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 09:06:43,089 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 09:06:43,089 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 09:06:43,089 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 09:06:43,089 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 09:06:43,089 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 09:06:43,089 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 09:06:43,090 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 09:06:43,090 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 09:06:43,090 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 09:06:43,090 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 09:06:43,090 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_0f275e67-134d-4104-afc1-8e7b2feaa78b/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 -> 308e43cca528a064aecd41d099b341627e43bb71 [2018-12-02 09:06:43,106 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 09:06:43,113 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 09:06:43,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 09:06:43,116 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 09:06:43,116 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 09:06:43,117 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c [2018-12-02 09:06:43,150 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/bin-2019/uautomizer/data/bcc96c963/0ddc6a8e23ae4462820506e11b3c3403/FLAGc318e407f [2018-12-02 09:06:43,524 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 09:06:43,524 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c [2018-12-02 09:06:43,528 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/bin-2019/uautomizer/data/bcc96c963/0ddc6a8e23ae4462820506e11b3c3403/FLAGc318e407f [2018-12-02 09:06:43,535 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/bin-2019/uautomizer/data/bcc96c963/0ddc6a8e23ae4462820506e11b3c3403 [2018-12-02 09:06:43,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 09:06:43,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 09:06:43,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 09:06:43,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 09:06:43,540 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 09:06:43,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:06:43" (1/1) ... [2018-12-02 09:06:43,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2133b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:43, skipping insertion in model container [2018-12-02 09:06:43,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:06:43" (1/1) ... [2018-12-02 09:06:43,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 09:06:43,556 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 09:06:43,647 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:06:43,655 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 09:06:43,666 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:06:43,677 INFO L195 MainTranslator]: Completed translation [2018-12-02 09:06:43,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:43 WrapperNode [2018-12-02 09:06:43,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 09:06:43,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 09:06:43,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 09:06:43,678 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 09:06:43,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:43" (1/1) ... [2018-12-02 09:06:43,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:43" (1/1) ... [2018-12-02 09:06:43,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 09:06:43,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 09:06:43,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 09:06:43,692 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 09:06:43,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:43" (1/1) ... [2018-12-02 09:06:43,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:43" (1/1) ... [2018-12-02 09:06:43,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:43" (1/1) ... [2018-12-02 09:06:43,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:43" (1/1) ... [2018-12-02 09:06:43,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:43" (1/1) ... [2018-12-02 09:06:43,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:43" (1/1) ... [2018-12-02 09:06:43,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:43" (1/1) ... [2018-12-02 09:06:43,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 09:06:43,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 09:06:43,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 09:06:43,737 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 09:06:43,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/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 09:06:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 09:06:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-12-02 09:06:43,769 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-12-02 09:06:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 09:06:43,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 09:06:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 09:06:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-12-02 09:06:43,770 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-12-02 09:06:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 09:06:43,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 09:06:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 09:06:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 09:06:43,770 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 09:06:43,770 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-12-02 09:06:43,770 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-12-02 09:06:43,913 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 09:06:43,913 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 09:06:43,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:06:43 BoogieIcfgContainer [2018-12-02 09:06:43,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 09:06:43,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 09:06:43,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 09:06:43,917 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 09:06:43,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:06:43" (1/3) ... [2018-12-02 09:06:43,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54032917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:06:43, skipping insertion in model container [2018-12-02 09:06:43,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:43" (2/3) ... [2018-12-02 09:06:43,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54032917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:06:43, skipping insertion in model container [2018-12-02 09:06:43,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:06:43" (3/3) ... [2018-12-02 09:06:43,920 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_true-unreach-call.c [2018-12-02 09:06:43,928 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 09:06:43,934 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 09:06:43,948 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 09:06:43,973 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 09:06:43,974 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 09:06:43,974 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 09:06:43,974 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 09:06:43,974 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 09:06:43,974 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 09:06:43,975 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 09:06:43,975 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 09:06:43,975 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 09:06:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-02 09:06:43,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 09:06:43,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:06:43,994 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:06:43,997 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:06:44,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:06:44,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1787337799, now seen corresponding path program 1 times [2018-12-02 09:06:44,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:06:44,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:06:44,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:44,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:06:44,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:06:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 09:06:44,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:06:44,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 09:06:44,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 09:06:44,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 09:06:44,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 09:06:44,118 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-12-02 09:06:44,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:06:44,132 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-12-02 09:06:44,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 09:06:44,133 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-12-02 09:06:44,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:06:44,138 INFO L225 Difference]: With dead ends: 46 [2018-12-02 09:06:44,138 INFO L226 Difference]: Without dead ends: 28 [2018-12-02 09:06:44,140 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 09:06:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-02 09:06:44,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-02 09:06:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 09:06:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-02 09:06:44,166 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 30 [2018-12-02 09:06:44,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:06:44,167 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-02 09:06:44,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 09:06:44,167 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-02 09:06:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 09:06:44,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:06:44,168 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:06:44,168 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:06:44,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:06:44,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1425990092, now seen corresponding path program 1 times [2018-12-02 09:06:44,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:06:44,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:06:44,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:44,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:06:44,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:06:44,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 09:06:44,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:06:44,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 09:06:44,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 09:06:44,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 09:06:44,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-02 09:06:44,355 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 11 states. [2018-12-02 09:06:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:06:44,531 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-12-02 09:06:44,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 09:06:44,531 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-12-02 09:06:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:06:44,533 INFO L225 Difference]: With dead ends: 54 [2018-12-02 09:06:44,533 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 09:06:44,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-12-02 09:06:44,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 09:06:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2018-12-02 09:06:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 09:06:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-12-02 09:06:44,540 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 31 [2018-12-02 09:06:44,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:06:44,540 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-12-02 09:06:44,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 09:06:44,540 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-12-02 09:06:44,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 09:06:44,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:06:44,541 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:06:44,541 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:06:44,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:06:44,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1848691918, now seen corresponding path program 1 times [2018-12-02 09:06:44,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:06:44,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:06:44,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:44,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:06:44,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:06:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:06:44,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:06:44,618 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/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 09:06:44,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:06:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:06:44,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:06:44,671 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 09:06:44,679 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 09:06:44,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:06:44,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:06:44,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:06:44,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-02 09:06:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:06:44,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:06:44,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-12-02 09:06:44,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 09:06:44,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 09:06:44,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-02 09:06:44,731 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 13 states. [2018-12-02 09:06:44,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:06:44,879 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-12-02 09:06:44,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 09:06:44,880 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-12-02 09:06:44,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:06:44,880 INFO L225 Difference]: With dead ends: 56 [2018-12-02 09:06:44,880 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 09:06:44,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-12-02 09:06:44,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 09:06:44,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-12-02 09:06:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 09:06:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-12-02 09:06:44,886 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2018-12-02 09:06:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:06:44,886 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-02 09:06:44,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 09:06:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-12-02 09:06:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 09:06:44,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:06:44,887 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:06:44,887 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:06:44,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:06:44,887 INFO L82 PathProgramCache]: Analyzing trace with hash 568828240, now seen corresponding path program 1 times [2018-12-02 09:06:44,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:06:44,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:06:44,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:44,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:06:44,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:06:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 09:06:45,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:06:45,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 09:06:45,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 09:06:45,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 09:06:45,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-02 09:06:45,030 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 11 states. [2018-12-02 09:06:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:06:45,222 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-12-02 09:06:45,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 09:06:45,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-12-02 09:06:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:06:45,223 INFO L225 Difference]: With dead ends: 54 [2018-12-02 09:06:45,223 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 09:06:45,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-12-02 09:06:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 09:06:45,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-12-02 09:06:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 09:06:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-12-02 09:06:45,229 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 31 [2018-12-02 09:06:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:06:45,229 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-12-02 09:06:45,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 09:06:45,229 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-12-02 09:06:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 09:06:45,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:06:45,230 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:06:45,230 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:06:45,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:06:45,230 INFO L82 PathProgramCache]: Analyzing trace with hash -957154489, now seen corresponding path program 1 times [2018-12-02 09:06:45,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:06:45,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:06:45,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:45,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:06:45,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:06:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 09:06:45,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:06:45,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/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 09:06:45,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:06:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:06:45,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:06:45,503 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 16 treesize of output 13 [2018-12-02 09:06:45,505 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 09:06:45,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:06:45,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:06:45,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 09:06:45,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-12-02 09:06:45,560 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 38 treesize of output 32 [2018-12-02 09:06:45,563 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:06:45,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-12-02 09:06:45,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:06:45,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:06:45,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:06:45,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:5 [2018-12-02 09:06:45,588 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:06:45,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:06:45,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2018-12-02 09:06:45,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 09:06:45,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 09:06:45,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-12-02 09:06:45,603 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 22 states. [2018-12-02 09:06:45,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:06:45,969 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-12-02 09:06:45,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 09:06:45,969 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2018-12-02 09:06:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:06:45,970 INFO L225 Difference]: With dead ends: 62 [2018-12-02 09:06:45,970 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 09:06:45,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 09:06:45,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 09:06:45,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2018-12-02 09:06:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 09:06:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-12-02 09:06:45,976 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 33 [2018-12-02 09:06:45,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:06:45,976 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-12-02 09:06:45,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 09:06:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-12-02 09:06:45,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 09:06:45,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:06:45,977 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:06:45,977 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:06:45,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:06:45,977 INFO L82 PathProgramCache]: Analyzing trace with hash 805044102, now seen corresponding path program 1 times [2018-12-02 09:06:45,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:06:45,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:06:45,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:45,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:06:45,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:06:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 09:06:46,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:06:46,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/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 09:06:46,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:06:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:06:46,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:06:46,248 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 16 treesize of output 13 [2018-12-02 09:06:46,249 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 09:06:46,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:06:46,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:06:46,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 09:06:46,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-12-02 09:06:46,316 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 38 treesize of output 32 [2018-12-02 09:06:46,317 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:06:46,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-12-02 09:06:46,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:06:46,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:06:46,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:06:46,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:5 [2018-12-02 09:06:46,338 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:06:46,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:06:46,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 24 [2018-12-02 09:06:46,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 09:06:46,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 09:06:46,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-12-02 09:06:46,354 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 24 states. [2018-12-02 09:06:46,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:06:46,786 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-12-02 09:06:46,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 09:06:46,786 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-12-02 09:06:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:06:46,787 INFO L225 Difference]: With dead ends: 66 [2018-12-02 09:06:46,787 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 09:06:46,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 09:06:46,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 09:06:46,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2018-12-02 09:06:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 09:06:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-12-02 09:06:46,793 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 35 [2018-12-02 09:06:46,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:06:46,793 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-02 09:06:46,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 09:06:46,793 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-12-02 09:06:46,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 09:06:46,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:06:46,794 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:06:46,794 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:06:46,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:06:46,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1263240701, now seen corresponding path program 2 times [2018-12-02 09:06:46,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:06:46,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:06:46,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:46,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:06:46,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:06:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 09:06:46,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:06:46,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/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 09:06:46,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 09:06:46,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 09:06:46,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:06:46,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:06:47,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-02 09:06:47,018 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 09:06:47,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:06:47,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:06:47,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:06:47,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-12-02 09:06:47,098 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 36 treesize of output 30 [2018-12-02 09:06:47,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-12-02 09:06:47,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:06:47,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:06:47,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:06:47,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-12-02 09:06:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:06:47,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:06:47,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2018-12-02 09:06:47,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 09:06:47,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 09:06:47,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-12-02 09:06:47,131 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 24 states. [2018-12-02 09:06:47,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:06:47,652 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-12-02 09:06:47,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-02 09:06:47,653 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-12-02 09:06:47,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:06:47,653 INFO L225 Difference]: With dead ends: 76 [2018-12-02 09:06:47,653 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 09:06:47,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=464, Invalid=1792, Unknown=0, NotChecked=0, Total=2256 [2018-12-02 09:06:47,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 09:06:47,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2018-12-02 09:06:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 09:06:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-12-02 09:06:47,663 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 37 [2018-12-02 09:06:47,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:06:47,663 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-12-02 09:06:47,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 09:06:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-12-02 09:06:47,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 09:06:47,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:06:47,664 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:06:47,664 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:06:47,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:06:47,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1199181769, now seen corresponding path program 2 times [2018-12-02 09:06:47,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:06:47,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:06:47,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:47,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:06:47,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:06:47,868 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 09:06:47,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:06:47,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/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 09:06:47,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 09:06:47,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 09:06:47,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:06:47,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:06:47,935 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 16 treesize of output 13 [2018-12-02 09:06:47,937 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 09:06:47,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:06:47,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:06:47,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:06:47,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-12-02 09:06:48,065 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 39 treesize of output 33 [2018-12-02 09:06:48,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2018-12-02 09:06:48,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:06:48,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:06:48,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:06:48,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:9 [2018-12-02 09:06:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:06:48,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:06:48,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 28 [2018-12-02 09:06:48,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 09:06:48,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 09:06:48,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2018-12-02 09:06:48,100 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 28 states. [2018-12-02 09:06:49,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:06:49,974 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2018-12-02 09:06:49,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-02 09:06:49,974 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 41 [2018-12-02 09:06:49,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:06:49,975 INFO L225 Difference]: With dead ends: 113 [2018-12-02 09:06:49,975 INFO L226 Difference]: Without dead ends: 105 [2018-12-02 09:06:49,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1555 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1238, Invalid=4018, Unknown=0, NotChecked=0, Total=5256 [2018-12-02 09:06:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-02 09:06:49,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 55. [2018-12-02 09:06:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 09:06:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-12-02 09:06:49,985 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 41 [2018-12-02 09:06:49,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:06:49,985 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-12-02 09:06:49,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 09:06:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-12-02 09:06:49,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 09:06:49,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:06:49,986 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:06:49,986 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:06:49,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:06:49,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2133408361, now seen corresponding path program 3 times [2018-12-02 09:06:49,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:06:49,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:06:49,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:49,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:06:49,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:06:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:06:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 09:06:50,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:06:50,194 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/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 09:06:50,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 09:06:50,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 09:06:50,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:06:50,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:06:50,259 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 16 treesize of output 13 [2018-12-02 09:06:50,261 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 09:06:50,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:06:50,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:06:50,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:06:50,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2018-12-02 09:06:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-02 09:06:52,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:06:52,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2018-12-02 09:06:52,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-02 09:06:52,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-02 09:06:52,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2018-12-02 09:06:52,628 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 31 states. [2018-12-02 09:06:58,354 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-02 09:07:14,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:07:14,328 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-12-02 09:07:14,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-02 09:07:14,328 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-12-02 09:07:14,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:07:14,329 INFO L225 Difference]: With dead ends: 109 [2018-12-02 09:07:14,329 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 09:07:14,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=917, Invalid=4333, Unknown=6, NotChecked=0, Total=5256 [2018-12-02 09:07:14,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 09:07:14,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-02 09:07:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 09:07:14,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-02 09:07:14,337 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 45 [2018-12-02 09:07:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:07:14,337 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-02 09:07:14,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-02 09:07:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-02 09:07:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 09:07:14,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:07:14,338 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:07:14,338 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:07:14,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:07:14,338 INFO L82 PathProgramCache]: Analyzing trace with hash 712510046, now seen corresponding path program 3 times [2018-12-02 09:07:14,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:07:14,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:07:14,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:07:14,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:07:14,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:07:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:07:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:07:14,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:07:14,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/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 09:07:14,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 09:07:14,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 09:07:14,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:07:14,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:07:14,618 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 16 treesize of output 13 [2018-12-02 09:07:14,619 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 09:07:14,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:07:14,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:07:14,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:07:14,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2018-12-02 09:07:17,121 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 28 [2018-12-02 09:07:17,151 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-02 09:07:17,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:07:17,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 28 [2018-12-02 09:07:17,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 09:07:17,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 09:07:17,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2018-12-02 09:07:17,168 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 28 states. [2018-12-02 09:07:25,025 WARN L180 SmtUtils]: Spent 4.01 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-02 09:07:25,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:07:25,068 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-12-02 09:07:25,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-02 09:07:25,068 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2018-12-02 09:07:25,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:07:25,069 INFO L225 Difference]: With dead ends: 50 [2018-12-02 09:07:25,069 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 09:07:25,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=430, Invalid=2762, Unknown=0, NotChecked=0, Total=3192 [2018-12-02 09:07:25,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 09:07:25,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 09:07:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 09:07:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 09:07:25,070 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2018-12-02 09:07:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:07:25,070 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 09:07:25,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 09:07:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 09:07:25,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 09:07:25,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 09:07:25,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:07:25,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:07:25,243 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 324 DAG size of output: 221 [2018-12-02 09:07:29,255 WARN L180 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2018-12-02 09:07:31,623 WARN L180 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2018-12-02 09:07:33,794 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2018-12-02 09:07:35,945 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2018-12-02 09:07:36,421 WARN L180 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 43 [2018-12-02 09:07:36,422 INFO L448 ceAbstractionStarter]: For program point initEXIT(lines 12 19) no Hoare annotation was computed. [2018-12-02 09:07:36,422 INFO L444 ceAbstractionStarter]: At program point initENTRY(lines 12 19) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|)) (forall ((v_main_~pd2~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (not (= v_main_~i~0_BEFORE_CALL_2 (select (select |old(#memory_int)| v_main_~pd2~0.base_BEFORE_CALL_2) (+ (* 4 v_main_~i~0_BEFORE_CALL_2) 8))))) (exists ((v_main_~pd2~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (= v_main_~i~0_BEFORE_CALL_2 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_2) (+ (* 4 v_main_~i~0_BEFORE_CALL_2) 8))))) [2018-12-02 09:07:36,423 INFO L448 ceAbstractionStarter]: For program point initFINAL(lines 12 19) no Hoare annotation was computed. [2018-12-02 09:07:36,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 09:07:36,423 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-02 09:07:36,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 09:07:36,423 INFO L448 ceAbstractionStarter]: For program point get_dummyFINAL(lines 21 24) no Hoare annotation was computed. [2018-12-02 09:07:36,423 INFO L451 ceAbstractionStarter]: At program point get_dummyENTRY(lines 21 24) the Hoare annotation is: true [2018-12-02 09:07:36,423 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-12-02 09:07:36,423 INFO L448 ceAbstractionStarter]: For program point get_dummyEXIT(lines 21 24) no Hoare annotation was computed. [2018-12-02 09:07:36,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 09:07:36,423 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|) (exists ((v_main_~pd2~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (= v_main_~i~0_BEFORE_CALL_2 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_2) (+ (* 4 v_main_~i~0_BEFORE_CALL_2) 8))))) [2018-12-02 09:07:36,423 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 09:07:36,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 09:07:36,423 INFO L451 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: true [2018-12-02 09:07:36,423 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2018-12-02 09:07:36,423 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 31 52) no Hoare annotation was computed. [2018-12-02 09:07:36,423 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 31 52) no Hoare annotation was computed. [2018-12-02 09:07:36,423 INFO L444 ceAbstractionStarter]: At program point L44(lines 32 52) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|)) (forall ((v_main_~pd2~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (not (= v_main_~i~0_BEFORE_CALL_2 (select (select |old(#memory_int)| v_main_~pd2~0.base_BEFORE_CALL_2) (+ (* 4 v_main_~i~0_BEFORE_CALL_2) 8)))))) [2018-12-02 09:07:36,424 INFO L448 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2018-12-02 09:07:36,424 INFO L444 ceAbstractionStarter]: At program point L40-3(lines 40 42) the Hoare annotation is: (or (not (= |~#d2~0.offset| 0)) (= |~#d1~0.base| |~#d2~0.base|) (forall ((v_main_~i~0_25 Int) (v_main_~pd2~0.base_BEFORE_CALL_1 Int)) (not (= v_main_~i~0_25 (select (select |old(#memory_int)| v_main_~pd2~0.base_BEFORE_CALL_1) (+ (* 4 v_main_~i~0_25) 8))))) (and (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (exists ((v_main_~i~0_27 Int)) (let ((.cse0 (+ main_~pd2~0.offset (* 4 v_main_~i~0_27) 8))) (and (= .cse0 main_~pa~0.offset) (= v_main_~i~0_27 (select (select |#memory_int| main_~pa~0.base) .cse0))))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset 0)) (not (= 0 |~#d1~0.offset|))) [2018-12-02 09:07:36,424 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 46) no Hoare annotation was computed. [2018-12-02 09:07:36,424 INFO L444 ceAbstractionStarter]: At program point L40-4(lines 40 42) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|)) (and (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (exists ((v_main_~i~0_27 Int)) (let ((.cse0 (+ main_~pd2~0.offset (* 4 v_main_~i~0_27) 8))) (and (= .cse0 main_~pa~0.offset) (= v_main_~i~0_27 (select (select |#memory_int| main_~pa~0.base) .cse0))))) (= (select (select |#memory_int| main_~pd2~0.base) (+ (* 4 main_~i~0) (+ main_~pd2~0.offset 8))) main_~i~0) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset 0)) (forall ((v_main_~pd2~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (not (= v_main_~i~0_BEFORE_CALL_2 (select (select |old(#memory_int)| v_main_~pd2~0.base_BEFORE_CALL_2) (+ (* 4 v_main_~i~0_BEFORE_CALL_2) 8)))))) [2018-12-02 09:07:36,424 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-02 09:07:36,424 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 46) no Hoare annotation was computed. [2018-12-02 09:07:36,424 INFO L444 ceAbstractionStarter]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (= 0 main_~pd1~0.offset))) (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|)) (forall ((v_main_~pd2~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (not (= v_main_~i~0_BEFORE_CALL_2 (select (select |old(#memory_int)| v_main_~pd2~0.base_BEFORE_CALL_2) (+ (* 4 v_main_~i~0_BEFORE_CALL_2) 8))))) (and .cse0 (= |~#d1~0.base| main_~pd1~0.base)) (and (= main_~pd1~0.base |~#d2~0.base|) .cse0))) [2018-12-02 09:07:36,424 INFO L448 ceAbstractionStarter]: For program point L34-2(line 34) no Hoare annotation was computed. [2018-12-02 09:07:36,424 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 31 52) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|)) (forall ((v_main_~pd2~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (not (= v_main_~i~0_BEFORE_CALL_2 (select (select |old(#memory_int)| v_main_~pd2~0.base_BEFORE_CALL_2) (+ (* 4 v_main_~i~0_BEFORE_CALL_2) 8))))) (exists ((v_main_~pd2~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (= v_main_~i~0_BEFORE_CALL_2 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_2) (+ (* 4 v_main_~i~0_BEFORE_CALL_2) 8))))) [2018-12-02 09:07:36,424 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-12-02 09:07:36,424 INFO L448 ceAbstractionStarter]: For program point L43-1(lines 43 45) no Hoare annotation was computed. [2018-12-02 09:07:36,424 INFO L451 ceAbstractionStarter]: At program point checkENTRY(lines 26 29) the Hoare annotation is: true [2018-12-02 09:07:36,424 INFO L448 ceAbstractionStarter]: For program point checkFINAL(lines 26 29) no Hoare annotation was computed. [2018-12-02 09:07:36,424 INFO L448 ceAbstractionStarter]: For program point checkEXIT(lines 26 29) no Hoare annotation was computed. [2018-12-02 09:07:36,427 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_CALL_2,QUANTIFIED] [2018-12-02 09:07:36,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~pd2~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-12-02 09:07:36,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_CALL_2,QUANTIFIED] [2018-12-02 09:07:36,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 09:07:36,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_CALL_2,QUANTIFIED] [2018-12-02 09:07:36,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~pd2~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-12-02 09:07:36,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_CALL_2,QUANTIFIED] [2018-12-02 09:07:36,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 09:07:36,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_25,QUANTIFIED] [2018-12-02 09:07:36,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~pd2~0.base_BEFORE_CALL_1,QUANTIFIED] [2018-12-02 09:07:36,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_25,QUANTIFIED] [2018-12-02 09:07:36,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] [2018-12-02 09:07:36,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] [2018-12-02 09:07:36,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] [2018-12-02 09:07:36,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 09:07:36,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 09:07:36,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 09:07:36,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_25,QUANTIFIED] [2018-12-02 09:07:36,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~pd2~0.base_BEFORE_CALL_1,QUANTIFIED] [2018-12-02 09:07:36,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_25,QUANTIFIED] [2018-12-02 09:07:36,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] [2018-12-02 09:07:36,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] [2018-12-02 09:07:36,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] [2018-12-02 09:07:36,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 09:07:36,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 09:07:36,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 09:07:36,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:07:36 BoogieIcfgContainer [2018-12-02 09:07:36,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 09:07:36,437 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 09:07:36,437 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 09:07:36,438 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 09:07:36,438 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:06:43" (3/4) ... [2018-12-02 09:07:36,440 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 09:07:36,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init [2018-12-02 09:07:36,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 09:07:36,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2018-12-02 09:07:36,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 09:07:36,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-12-02 09:07:36,447 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-12-02 09:07:36,447 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-02 09:07:36,447 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 09:07:36,463 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(d2 == 0) || d1 == d2) || (forall v_main_~i~0_25 : int, v_main_~pd2~0.base_BEFORE_CALL_1 : int :: !(v_main_~i~0_25 == \old(unknown-#memory_int-unknown)[v_main_~pd2~0.base_BEFORE_CALL_1][4 * v_main_~i~0_25 + 8]))) || (((i <= unknown-#memory_int-unknown[pa][pa] && (\exists v_main_~i~0_27 : int :: pd2 + 4 * v_main_~i~0_27 + 8 == pa && v_main_~i~0_27 == unknown-#memory_int-unknown[pa][pd2 + 4 * v_main_~i~0_27 + 8])) && pd2 == pa) && pd2 == 0)) || !(0 == d1) [2018-12-02 09:07:36,463 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((d1 == d2 || !(d2 == 0)) || !(0 == d1)) || (forall v_main_~pd2~0.base_BEFORE_CALL_2 : int, v_main_~i~0_BEFORE_CALL_2 : int :: !(v_main_~i~0_BEFORE_CALL_2 == \old(unknown-#memory_int-unknown)[v_main_~pd2~0.base_BEFORE_CALL_2][4 * v_main_~i~0_BEFORE_CALL_2 + 8])) [2018-12-02 09:07:36,473 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0f275e67-134d-4104-afc1-8e7b2feaa78b/bin-2019/uautomizer/witness.graphml [2018-12-02 09:07:36,473 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 09:07:36,473 INFO L168 Benchmark]: Toolchain (without parser) took 52936.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -93.9 MB). Peak memory consumption was 83.3 MB. Max. memory is 11.5 GB. [2018-12-02 09:07:36,474 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:07:36,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 138.93 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 09:07:36,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.20 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 09:07:36,474 INFO L168 Benchmark]: Boogie Preprocessor took 45.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -145.5 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-02 09:07:36,475 INFO L168 Benchmark]: RCFGBuilder took 176.44 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-02 09:07:36,475 INFO L168 Benchmark]: TraceAbstraction took 52523.33 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 379.8 MB. Max. memory is 11.5 GB. [2018-12-02 09:07:36,475 INFO L168 Benchmark]: Witness Printer took 35.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2018-12-02 09:07:36,476 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 138.93 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.20 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -145.5 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 176.44 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 52523.33 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 379.8 MB. Max. memory is 11.5 GB. * Witness Printer took 35.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~pd2~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~pd2~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~pd2~0.base_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~pd2~0.base_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: 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: 32]: Loop Invariant [2018-12-02 09:07:36,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_CALL_2,QUANTIFIED] [2018-12-02 09:07:36,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~pd2~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-12-02 09:07:36,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_CALL_2,QUANTIFIED] [2018-12-02 09:07:36,479 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 09:07:36,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_CALL_2,QUANTIFIED] [2018-12-02 09:07:36,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~pd2~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-12-02 09:07:36,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_CALL_2,QUANTIFIED] [2018-12-02 09:07:36,479 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((d1 == d2 || !(d2 == 0)) || !(0 == d1)) || (forall v_main_~pd2~0.base_BEFORE_CALL_2 : int, v_main_~i~0_BEFORE_CALL_2 : int :: !(v_main_~i~0_BEFORE_CALL_2 == \old(unknown-#memory_int-unknown)[v_main_~pd2~0.base_BEFORE_CALL_2][4 * v_main_~i~0_BEFORE_CALL_2 + 8])) - InvariantResult [Line: 40]: Loop Invariant [2018-12-02 09:07:36,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_25,QUANTIFIED] [2018-12-02 09:07:36,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~pd2~0.base_BEFORE_CALL_1,QUANTIFIED] [2018-12-02 09:07:36,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_25,QUANTIFIED] [2018-12-02 09:07:36,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] [2018-12-02 09:07:36,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] [2018-12-02 09:07:36,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] [2018-12-02 09:07:36,480 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 09:07:36,480 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 09:07:36,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 09:07:36,481 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_25,QUANTIFIED] [2018-12-02 09:07:36,481 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~pd2~0.base_BEFORE_CALL_1,QUANTIFIED] [2018-12-02 09:07:36,481 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_25,QUANTIFIED] [2018-12-02 09:07:36,481 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] [2018-12-02 09:07:36,481 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] [2018-12-02 09:07:36,481 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_27,QUANTIFIED] [2018-12-02 09:07:36,482 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 09:07:36,482 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 09:07:36,482 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((!(d2 == 0) || d1 == d2) || (forall v_main_~i~0_25 : int, v_main_~pd2~0.base_BEFORE_CALL_1 : int :: !(v_main_~i~0_25 == \old(unknown-#memory_int-unknown)[v_main_~pd2~0.base_BEFORE_CALL_1][4 * v_main_~i~0_25 + 8]))) || (((i <= unknown-#memory_int-unknown[pa][pa] && (\exists v_main_~i~0_27 : int :: pd2 + 4 * v_main_~i~0_27 + 8 == pa && v_main_~i~0_27 == unknown-#memory_int-unknown[pa][pd2 + 4 * v_main_~i~0_27 + 8])) && pd2 == pa) && pd2 == 0)) || !(0 == d1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. SAFE Result, 52.4s OverallTime, 10 OverallIterations, 11 TraceHistogramMax, 33.3s AutomataDifference, 0.0s DeadEndRemovalTime, 11.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 293 SDtfs, 547 SDslu, 2342 SDs, 0 SdLazy, 2611 SolverSat, 294 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 604 GetRequests, 220 SyntacticMatches, 28 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4387 ImplicationChecksByTransitivity, 28.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=8, 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, 10 MinimizatonAttempts, 122 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 24 PreInvPairs, 58 NumberOfFragments, 301 HoareAnnotationTreeSize, 24 FomulaSimplifications, 99244 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 7805 FormulaSimplificationTreeSizeReductionInter, 11.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 638 NumberOfCodeBlocks, 612 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 621 ConstructedInterpolants, 71 QuantifiedInterpolants, 212887 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1174 ConjunctsInSsa, 261 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 204/500 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...