./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test23_false-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_72974ead-247a-432b-8b5f-1000bc4e649d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/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 b974f281a213c0803f91ef44d205e442fb2a5f8f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 01:05:09,017 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:05:09,018 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:05:09,027 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:05:09,027 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:05:09,028 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:05:09,029 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:05:09,030 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:05:09,031 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:05:09,032 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:05:09,033 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:05:09,033 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:05:09,034 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:05:09,034 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:05:09,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:05:09,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:05:09,036 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:05:09,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:05:09,039 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:05:09,040 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:05:09,041 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:05:09,042 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:05:09,044 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:05:09,044 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:05:09,044 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:05:09,045 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:05:09,046 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:05:09,047 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:05:09,047 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:05:09,048 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:05:09,048 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:05:09,049 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:05:09,049 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:05:09,049 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:05:09,050 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:05:09,050 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:05:09,051 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 01:05:09,061 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:05:09,061 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:05:09,062 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 01:05:09,062 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 01:05:09,062 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 01:05:09,062 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 01:05:09,062 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 01:05:09,063 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:05:09,063 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 01:05:09,063 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 01:05:09,063 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 01:05:09,063 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:05:09,063 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 01:05:09,063 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 01:05:09,063 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 01:05:09,064 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 01:05:09,064 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 01:05:09,064 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 01:05:09,064 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 01:05:09,064 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:05:09,064 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:05:09,064 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 01:05:09,064 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 01:05:09,065 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:05:09,065 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:05:09,065 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 01:05:09,065 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 01:05:09,065 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 01:05:09,065 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 01:05:09,065 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 01:05:09,065 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_72974ead-247a-432b-8b5f-1000bc4e649d/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 -> b974f281a213c0803f91ef44d205e442fb2a5f8f [2018-12-02 01:05:09,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:05:09,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:05:09,098 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:05:09,100 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:05:09,100 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:05:09,100 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c [2018-12-02 01:05:09,134 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/bin-2019/uautomizer/data/6507be426/d3fba0f3491141d79f523294067f59bd/FLAGcab9b7350 [2018-12-02 01:05:09,524 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:05:09,524 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c [2018-12-02 01:05:09,528 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/bin-2019/uautomizer/data/6507be426/d3fba0f3491141d79f523294067f59bd/FLAGcab9b7350 [2018-12-02 01:05:09,536 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/bin-2019/uautomizer/data/6507be426/d3fba0f3491141d79f523294067f59bd [2018-12-02 01:05:09,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:05:09,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 01:05:09,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:05:09,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:05:09,541 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:05:09,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:05:09" (1/1) ... [2018-12-02 01:05:09,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a9438d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:09, skipping insertion in model container [2018-12-02 01:05:09,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:05:09" (1/1) ... [2018-12-02 01:05:09,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:05:09,558 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:05:09,651 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:05:09,659 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:05:09,670 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:05:09,681 INFO L195 MainTranslator]: Completed translation [2018-12-02 01:05:09,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:09 WrapperNode [2018-12-02 01:05:09,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 01:05:09,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 01:05:09,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 01:05:09,682 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 01:05:09,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:09" (1/1) ... [2018-12-02 01:05:09,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:09" (1/1) ... [2018-12-02 01:05:09,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 01:05:09,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 01:05:09,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 01:05:09,724 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 01:05:09,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:09" (1/1) ... [2018-12-02 01:05:09,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:09" (1/1) ... [2018-12-02 01:05:09,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:09" (1/1) ... [2018-12-02 01:05:09,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:09" (1/1) ... [2018-12-02 01:05:09,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:09" (1/1) ... [2018-12-02 01:05:09,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:09" (1/1) ... [2018-12-02 01:05:09,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:09" (1/1) ... [2018-12-02 01:05:09,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 01:05:09,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 01:05:09,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 01:05:09,740 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 01:05:09,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/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 01:05:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 01:05:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-12-02 01:05:09,771 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-12-02 01:05:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 01:05:09,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 01:05:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 01:05:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-12-02 01:05:09,771 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-12-02 01:05:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 01:05:09,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 01:05:09,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 01:05:09,772 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 01:05:09,772 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 01:05:09,772 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-12-02 01:05:09,772 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-12-02 01:05:09,899 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 01:05:09,899 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 01:05:09,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:05:09 BoogieIcfgContainer [2018-12-02 01:05:09,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 01:05:09,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 01:05:09,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 01:05:09,903 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 01:05:09,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:05:09" (1/3) ... [2018-12-02 01:05:09,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d39848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:05:09, skipping insertion in model container [2018-12-02 01:05:09,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:09" (2/3) ... [2018-12-02 01:05:09,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d39848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:05:09, skipping insertion in model container [2018-12-02 01:05:09,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:05:09" (3/3) ... [2018-12-02 01:05:09,905 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_false-unreach-call.c [2018-12-02 01:05:09,911 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 01:05:09,915 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 01:05:09,924 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 01:05:09,940 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 01:05:09,941 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 01:05:09,941 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 01:05:09,941 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 01:05:09,941 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 01:05:09,941 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 01:05:09,941 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 01:05:09,941 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 01:05:09,941 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 01:05:09,951 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-02 01:05:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 01:05:09,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:05:09,956 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 01:05:09,958 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:05:09,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:05:09,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1787337799, now seen corresponding path program 1 times [2018-12-02 01:05:09,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:05:09,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:05:09,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:09,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:05:09,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:05:10,069 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 01:05:10,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:05:10,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 01:05:10,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 01:05:10,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 01:05:10,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 01:05:10,082 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-12-02 01:05:10,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:05:10,093 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-12-02 01:05:10,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 01:05:10,094 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-12-02 01:05:10,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:05:10,099 INFO L225 Difference]: With dead ends: 46 [2018-12-02 01:05:10,099 INFO L226 Difference]: Without dead ends: 28 [2018-12-02 01:05:10,101 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 01:05:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-02 01:05:10,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-02 01:05:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 01:05:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-02 01:05:10,123 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 30 [2018-12-02 01:05:10,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:05:10,124 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-02 01:05:10,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 01:05:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-02 01:05:10,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 01:05:10,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:05:10,126 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 01:05:10,126 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:05:10,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:05:10,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1425990092, now seen corresponding path program 1 times [2018-12-02 01:05:10,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:05:10,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:05:10,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:10,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:05:10,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:05:10,310 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 01:05:10,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:05:10,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 01:05:10,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 01:05:10,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 01:05:10,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-02 01:05:10,311 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 11 states. [2018-12-02 01:05:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:05:10,489 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-12-02 01:05:10,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 01:05:10,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-12-02 01:05:10,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:05:10,490 INFO L225 Difference]: With dead ends: 54 [2018-12-02 01:05:10,491 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 01:05:10,491 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 01:05:10,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 01:05:10,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2018-12-02 01:05:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 01:05:10,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-12-02 01:05:10,497 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 31 [2018-12-02 01:05:10,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:05:10,497 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-12-02 01:05:10,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 01:05:10,497 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-12-02 01:05:10,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 01:05:10,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:05:10,498 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 01:05:10,498 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:05:10,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:05:10,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1848691918, now seen corresponding path program 1 times [2018-12-02 01:05:10,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:05:10,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:05:10,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:10,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:05:10,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:05:10,553 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 01:05:10,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:05:10,553 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/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 01:05:10,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:05:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:05:10,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:05:10,617 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 01:05:10,629 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 01:05:10,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:05:10,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:05:10,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:05:10,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-02 01:05:10,655 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 01:05:10,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:05:10,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-12-02 01:05:10,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 01:05:10,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 01:05:10,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-02 01:05:10,674 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 13 states. [2018-12-02 01:05:10,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:05:10,817 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-12-02 01:05:10,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 01:05:10,818 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-12-02 01:05:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:05:10,819 INFO L225 Difference]: With dead ends: 56 [2018-12-02 01:05:10,819 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 01:05:10,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-12-02 01:05:10,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 01:05:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-12-02 01:05:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 01:05:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-12-02 01:05:10,824 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2018-12-02 01:05:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:05:10,825 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-02 01:05:10,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 01:05:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-12-02 01:05:10,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 01:05:10,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:05:10,826 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 01:05:10,826 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:05:10,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:05:10,826 INFO L82 PathProgramCache]: Analyzing trace with hash 568828240, now seen corresponding path program 1 times [2018-12-02 01:05:10,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:05:10,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:05:10,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:10,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:05:10,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:05:10,951 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 01:05:10,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:05:10,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 01:05:10,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 01:05:10,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 01:05:10,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-02 01:05:10,952 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 11 states. [2018-12-02 01:05:11,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:05:11,096 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-12-02 01:05:11,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 01:05:11,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-12-02 01:05:11,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:05:11,097 INFO L225 Difference]: With dead ends: 54 [2018-12-02 01:05:11,097 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 01:05:11,098 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 01:05:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 01:05:11,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-12-02 01:05:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 01:05:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-12-02 01:05:11,102 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 31 [2018-12-02 01:05:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:05:11,102 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-12-02 01:05:11,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 01:05:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-12-02 01:05:11,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 01:05:11,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:05:11,103 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 01:05:11,103 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:05:11,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:05:11,103 INFO L82 PathProgramCache]: Analyzing trace with hash -957154489, now seen corresponding path program 1 times [2018-12-02 01:05:11,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:05:11,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:05:11,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:11,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:05:11,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:05:11,244 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 01:05:11,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:05:11,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/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 01:05:11,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:05:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:05:11,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:05:11,362 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 01:05:11,365 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 01:05:11,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:05:11,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:05:11,374 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 01:05:11,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-12-02 01:05:11,426 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 01:05:11,428 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:05:11,428 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 01:05:11,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:05:11,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:05:11,437 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 01:05:11,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:5 [2018-12-02 01:05:11,449 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 01:05:11,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:05:11,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2018-12-02 01:05:11,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 01:05:11,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 01:05:11,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-12-02 01:05:11,474 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 22 states. [2018-12-02 01:05:11,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:05:11,878 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-12-02 01:05:11,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 01:05:11,878 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2018-12-02 01:05:11,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:05:11,879 INFO L225 Difference]: With dead ends: 62 [2018-12-02 01:05:11,879 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 01:05:11,879 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 01:05:11,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 01:05:11,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2018-12-02 01:05:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 01:05:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-12-02 01:05:11,884 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 33 [2018-12-02 01:05:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:05:11,885 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-12-02 01:05:11,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 01:05:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-12-02 01:05:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 01:05:11,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:05:11,886 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 01:05:11,886 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:05:11,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:05:11,886 INFO L82 PathProgramCache]: Analyzing trace with hash 805044102, now seen corresponding path program 1 times [2018-12-02 01:05:11,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:05:11,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:05:11,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:11,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:05:11,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:05:12,051 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 01:05:12,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:05:12,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/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 01:05:12,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:05:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:05:12,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:05:12,165 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 01:05:12,167 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 01:05:12,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:05:12,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:05:12,174 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 01:05:12,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-12-02 01:05:12,233 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 01:05:12,236 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:05:12,237 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 01:05:12,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:05:12,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:05:12,247 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 01:05:12,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:5 [2018-12-02 01:05:12,268 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 01:05:12,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:05:12,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 24 [2018-12-02 01:05:12,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 01:05:12,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 01:05:12,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-12-02 01:05:12,284 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 24 states. [2018-12-02 01:05:12,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:05:12,721 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-12-02 01:05:12,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 01:05:12,721 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-12-02 01:05:12,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:05:12,722 INFO L225 Difference]: With dead ends: 66 [2018-12-02 01:05:12,722 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 01:05:12,723 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 01:05:12,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 01:05:12,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2018-12-02 01:05:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 01:05:12,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-12-02 01:05:12,728 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 35 [2018-12-02 01:05:12,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:05:12,728 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-02 01:05:12,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 01:05:12,728 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-12-02 01:05:12,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 01:05:12,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:05:12,729 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 01:05:12,729 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:05:12,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:05:12,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1263240701, now seen corresponding path program 2 times [2018-12-02 01:05:12,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:05:12,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:05:12,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:12,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:05:12,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:05:12,916 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 01:05:12,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:05:12,916 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/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 01:05:12,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 01:05:12,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 01:05:12,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:05:12,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:05:13,005 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 01:05:13,007 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 01:05:13,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:05:13,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:05:13,012 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 01:05:13,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-12-02 01:05:13,082 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 01:05:13,084 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 01:05:13,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:05:13,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:05:13,088 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 01:05:13,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-12-02 01:05:13,101 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 01:05:13,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:05:13,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2018-12-02 01:05:13,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 01:05:13,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 01:05:13,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-12-02 01:05:13,117 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 24 states. [2018-12-02 01:05:13,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:05:13,625 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-12-02 01:05:13,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-02 01:05:13,626 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-12-02 01:05:13,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:05:13,626 INFO L225 Difference]: With dead ends: 76 [2018-12-02 01:05:13,626 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 01:05:13,627 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 01:05:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 01:05:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2018-12-02 01:05:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 01:05:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-12-02 01:05:13,633 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 37 [2018-12-02 01:05:13,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:05:13,633 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-12-02 01:05:13,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 01:05:13,633 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-12-02 01:05:13,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 01:05:13,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:05:13,634 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 01:05:13,634 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:05:13,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:05:13,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1199181769, now seen corresponding path program 2 times [2018-12-02 01:05:13,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:05:13,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:05:13,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:13,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:05:13,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:05:13,826 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 01:05:13,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:05:13,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/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 01:05:13,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 01:05:13,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 01:05:13,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:05:13,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:05:13,902 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 01:05:13,903 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 01:05:13,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:05:13,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:05:13,909 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 01:05:13,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-12-02 01:05:14,028 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 01:05:14,030 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 01:05:14,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:05:14,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:05:14,034 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 01:05:14,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-12-02 01:05:14,049 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 01:05:14,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:05:14,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 28 [2018-12-02 01:05:14,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 01:05:14,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 01:05:14,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2018-12-02 01:05:14,074 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 28 states. [2018-12-02 01:05:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:05:15,973 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2018-12-02 01:05:15,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-02 01:05:15,973 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 41 [2018-12-02 01:05:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:05:15,974 INFO L225 Difference]: With dead ends: 117 [2018-12-02 01:05:15,974 INFO L226 Difference]: Without dead ends: 109 [2018-12-02 01:05:15,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1603 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1351, Invalid=4501, Unknown=0, NotChecked=0, Total=5852 [2018-12-02 01:05:15,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-02 01:05:15,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 57. [2018-12-02 01:05:15,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 01:05:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-12-02 01:05:15,989 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 41 [2018-12-02 01:05:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:05:15,990 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-12-02 01:05:15,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 01:05:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-12-02 01:05:15,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 01:05:15,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:05:15,991 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 01:05:15,991 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:05:15,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:05:15,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2133408361, now seen corresponding path program 3 times [2018-12-02 01:05:15,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:05:15,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:05:15,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:15,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:05:15,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:05:16,207 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 01:05:16,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:05:16,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/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 01:05:16,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 01:05:16,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-02 01:05:16,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:05:16,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:05:16,284 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 01:05:16,285 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 01:05:16,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:05:16,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:05:16,291 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 01:05:16,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-12-02 01:05:16,429 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 01:05:16,431 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 01:05:16,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:05:16,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:05:16,436 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 01:05:16,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-12-02 01:05:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 01:05:16,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:05:16,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2018-12-02 01:05:16,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-02 01:05:16,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-02 01:05:16,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2018-12-02 01:05:16,464 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 32 states. [2018-12-02 01:05:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:05:17,465 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-12-02 01:05:17,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-02 01:05:17,466 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2018-12-02 01:05:17,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:05:17,466 INFO L225 Difference]: With dead ends: 118 [2018-12-02 01:05:17,466 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 01:05:17,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1459 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1141, Invalid=4261, Unknown=0, NotChecked=0, Total=5402 [2018-12-02 01:05:17,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 01:05:17,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 55. [2018-12-02 01:05:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 01:05:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-12-02 01:05:17,477 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 45 [2018-12-02 01:05:17,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:05:17,477 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-12-02 01:05:17,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-02 01:05:17,477 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-12-02 01:05:17,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 01:05:17,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:05:17,478 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 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 01:05:17,478 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:05:17,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:05:17,478 INFO L82 PathProgramCache]: Analyzing trace with hash 821150421, now seen corresponding path program 4 times [2018-12-02 01:05:17,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:05:17,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:05:17,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:17,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:05:17,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:05:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:05:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:05:17,513 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 01:05:17,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:05:17 BoogieIcfgContainer [2018-12-02 01:05:17,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 01:05:17,543 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 01:05:17,543 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 01:05:17,543 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 01:05:17,544 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:05:09" (3/4) ... [2018-12-02 01:05:17,545 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 01:05:17,581 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_72974ead-247a-432b-8b5f-1000bc4e649d/bin-2019/uautomizer/witness.graphml [2018-12-02 01:05:17,581 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 01:05:17,582 INFO L168 Benchmark]: Toolchain (without parser) took 8043.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 349.2 MB). Free memory was 962.4 MB in the beginning and 1.3 GB in the end (delta: -336.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. [2018-12-02 01:05:17,582 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:05:17,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.31 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 01:05:17,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-02 01:05:17,583 INFO L168 Benchmark]: Boogie Preprocessor took 16.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:05:17,583 INFO L168 Benchmark]: RCFGBuilder took 159.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-12-02 01:05:17,583 INFO L168 Benchmark]: TraceAbstraction took 7642.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 216.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -192.6 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2018-12-02 01:05:17,583 INFO L168 Benchmark]: Witness Printer took 37.97 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:05:17,585 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.31 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 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 41.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 159.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7642.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 216.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -192.6 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Witness Printer took 37.97 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 50]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] struct dummy d1, d2; VAL [\old(d1)=79, \old(d1)=74, \old(d2)=77, \old(d2)=75, d1={1:0}, d2={78:0}] [L33] CALL init() VAL [d1={1:0}, d2={78:0}] [L14] d1.a = __VERIFIER_nondet_int() [L15] d1.b = __VERIFIER_nondet_int() [L17] d2.a = __VERIFIER_nondet_int() [L18] d2.b = __VERIFIER_nondet_int() [L33] RET init() VAL [d1={1:0}, d2={78:0}] [L34] CALL, EXPR get_dummy() VAL [d1={1:0}, d2={78:0}] [L23] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={1:0}, d1={1:0}, d2={78:0}] [L23] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L34] RET, EXPR get_dummy() VAL [d1={1:0}, d2={78:0}, get_dummy()={1:0}] [L34] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L34] CALL, EXPR get_dummy() VAL [d1={1:0}, d2={78:0}] [L23] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={1:0}, d1={1:0}, d2={78:0}] [L23] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L34] RET, EXPR get_dummy() VAL [d1={1:0}, d2={78:0}, get_dummy()={1:0}, pd1={1:0}] [L34] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L35] int i = __VERIFIER_nondet_int(); [L36] COND TRUE pd1 != 0 && pd1 == pd2 && i >= 0 && i < 10 [L37] pd2->array[i] = i [L38] int *pa = &pd1->array[i]; [L39] EXPR pd2->array[i] [L39] i = pd2->array[i] - 10 [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=-4, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=-3, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=-3, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=-2, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=-2, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=-1, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=-1, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=0, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=0, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=1, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=1, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=2, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=2, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=3, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=3, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=4, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=4, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=5, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=5, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=6, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=6, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=7, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=7, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND FALSE !(i <= *pa) [L43] CALL, EXPR check(pd2, i) VAL [\old(i)=7, d1={1:0}, d2={78:0}, s1={1:0}] [L28] EXPR s1->array[i] [L28] return s1->array[i] == i; [L43] RET, EXPR check(pd2, i) VAL [check(pd2, i)=0, d1={1:0}, d2={78:0}, i=7, pa={1:32}, pd1={1:0}, pd2={1:0}] [L43] COND TRUE !check(pd2, i) [L50] __VERIFIER_error() VAL [d1={1:0}, d2={78:0}, i=7, pa={1:32}, pd1={1:0}, pd2={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. UNSAFE Result, 7.6s OverallTime, 10 OverallIterations, 12 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 282 SDtfs, 491 SDslu, 2435 SDs, 0 SdLazy, 2040 SolverSat, 221 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 507 GetRequests, 176 SyntacticMatches, 25 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4045 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred 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, 9 MinimizatonAttempts, 179 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 589 NumberOfCodeBlocks, 589 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 521 ConstructedInterpolants, 41 QuantifiedInterpolants, 128959 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1031 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 47/272 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...