./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/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 eed6d14b3659ee573ecc9a025ea4a6cd48efa35c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.25-f470102 [2019-12-07 17:34:16,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:34:16,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:34:16,143 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:34:16,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:34:16,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:34:16,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:34:16,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:34:16,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:34:16,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:34:16,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:34:16,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:34:16,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:34:16,150 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:34:16,151 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:34:16,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:34:16,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:34:16,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:34:16,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:34:16,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:34:16,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:34:16,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:34:16,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:34:16,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:34:16,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:34:16,161 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:34:16,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:34:16,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:34:16,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:34:16,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:34:16,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:34:16,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:34:16,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:34:16,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:34:16,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:34:16,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:34:16,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:34:16,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:34:16,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:34:16,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:34:16,166 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:34:16,166 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:34:16,176 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:34:16,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:34:16,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:34:16,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:34:16,177 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:34:16,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:34:16,177 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:34:16,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:34:16,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:34:16,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:34:16,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:34:16,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:34:16,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:34:16,178 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:34:16,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:34:16,178 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:34:16,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:34:16,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:34:16,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:34:16,178 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:34:16,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:34:16,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:34:16,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:34:16,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:34:16,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:34:16,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:34:16,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:34:16,179 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:34:16,180 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:34:16,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/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 -> eed6d14b3659ee573ecc9a025ea4a6cd48efa35c [2019-12-07 17:34:16,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:34:16,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:34:16,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:34:16,295 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:34:16,295 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:34:16,296 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2019-12-07 17:34:16,334 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/data/d09819828/86d2c69c0137444fb811c8a9dcdb310f/FLAG69dce8ed5 [2019-12-07 17:34:16,698 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:34:16,698 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2019-12-07 17:34:16,707 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/data/d09819828/86d2c69c0137444fb811c8a9dcdb310f/FLAG69dce8ed5 [2019-12-07 17:34:16,716 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/data/d09819828/86d2c69c0137444fb811c8a9dcdb310f [2019-12-07 17:34:16,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:34:16,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:34:16,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:34:16,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:34:16,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:34:16,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:34:16" (1/1) ... [2019-12-07 17:34:16,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7b5f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:34:16, skipping insertion in model container [2019-12-07 17:34:16,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:34:16" (1/1) ... [2019-12-07 17:34:16,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:34:16,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:34:16,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:34:16,986 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:34:17,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:34:17,058 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:34:17,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:34:17 WrapperNode [2019-12-07 17:34:17,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:34:17,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:34:17,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:34:17,060 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:34:17,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:34:17" (1/1) ... [2019-12-07 17:34:17,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:34:17" (1/1) ... [2019-12-07 17:34:17,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:34:17,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:34:17,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:34:17,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:34:17,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:34:17" (1/1) ... [2019-12-07 17:34:17,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:34:17" (1/1) ... [2019-12-07 17:34:17,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:34:17" (1/1) ... [2019-12-07 17:34:17,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:34:17" (1/1) ... [2019-12-07 17:34:17,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:34:17" (1/1) ... [2019-12-07 17:34:17,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:34:17" (1/1) ... [2019-12-07 17:34:17,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:34:17" (1/1) ... [2019-12-07 17:34:17,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:34:17,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:34:17,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:34:17,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:34:17,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:34:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/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 [2019-12-07 17:34:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 17:34:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:34:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:34:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:34:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:34:17,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:34:17,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:34:17,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:34:17,429 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:34:17,429 INFO L287 CfgBuilder]: Removed 18 assume(true) statements. [2019-12-07 17:34:17,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:34:17 BoogieIcfgContainer [2019-12-07 17:34:17,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:34:17,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:34:17,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:34:17,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:34:17,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:34:16" (1/3) ... [2019-12-07 17:34:17,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332ab14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:34:17, skipping insertion in model container [2019-12-07 17:34:17,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:34:17" (2/3) ... [2019-12-07 17:34:17,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332ab14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:34:17, skipping insertion in model container [2019-12-07 17:34:17,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:34:17" (3/3) ... [2019-12-07 17:34:17,437 INFO L109 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2019-12-07 17:34:17,445 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:34:17,451 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:34:17,461 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:34:17,477 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:34:17,477 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:34:17,477 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:34:17,477 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:34:17,477 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:34:17,477 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:34:17,478 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:34:17,478 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:34:17,487 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-12-07 17:34:17,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:34:17,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:17,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:34:17,492 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:17,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:17,496 INFO L82 PathProgramCache]: Analyzing trace with hash -372423763, now seen corresponding path program 1 times [2019-12-07 17:34:17,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:17,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271926111] [2019-12-07 17:34:17,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:17,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:34:17,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271926111] [2019-12-07 17:34:17,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:34:17,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:34:17,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873100909] [2019-12-07 17:34:17,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 17:34:17,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:17,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 17:34:17,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 17:34:17,606 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2019-12-07 17:34:17,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:17,620 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2019-12-07 17:34:17,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 17:34:17,621 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-12-07 17:34:17,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:17,627 INFO L225 Difference]: With dead ends: 98 [2019-12-07 17:34:17,627 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 17:34:17,629 INFO L630 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 [2019-12-07 17:34:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 17:34:17,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-12-07 17:34:17,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 17:34:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2019-12-07 17:34:17,652 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 16 [2019-12-07 17:34:17,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:17,652 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2019-12-07 17:34:17,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 17:34:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2019-12-07 17:34:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:34:17,653 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:17,653 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:34:17,653 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:17,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:17,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1965259271, now seen corresponding path program 1 times [2019-12-07 17:34:17,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:17,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951481798] [2019-12-07 17:34:17,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:34:17,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951481798] [2019-12-07 17:34:17,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:34:17,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:34:17,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401724617] [2019-12-07 17:34:17,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:34:17,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:17,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:34:17,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:34:17,692 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 3 states. [2019-12-07 17:34:17,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:17,704 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2019-12-07 17:34:17,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:34:17,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 17:34:17,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:17,706 INFO L225 Difference]: With dead ends: 71 [2019-12-07 17:34:17,706 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 17:34:17,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:34:17,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 17:34:17,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-12-07 17:34:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 17:34:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2019-12-07 17:34:17,712 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 21 [2019-12-07 17:34:17,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:17,712 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2019-12-07 17:34:17,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:34:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2019-12-07 17:34:17,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:34:17,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:17,713 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:34:17,713 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:17,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:17,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1325693868, now seen corresponding path program 1 times [2019-12-07 17:34:17,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:17,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046636112] [2019-12-07 17:34:17,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:34:17,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046636112] [2019-12-07 17:34:17,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:34:17,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:34:17,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056715028] [2019-12-07 17:34:17,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:34:17,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:17,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:34:17,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:34:17,743 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand 3 states. [2019-12-07 17:34:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:17,756 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-12-07 17:34:17,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:34:17,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 17:34:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:17,757 INFO L225 Difference]: With dead ends: 89 [2019-12-07 17:34:17,757 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 17:34:17,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:34:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 17:34:17,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 17:34:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 17:34:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2019-12-07 17:34:17,762 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 27 [2019-12-07 17:34:17,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:17,762 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2019-12-07 17:34:17,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:34:17,762 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2019-12-07 17:34:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:34:17,763 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:17,763 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:34:17,763 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:17,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:17,763 INFO L82 PathProgramCache]: Analyzing trace with hash -2143342318, now seen corresponding path program 1 times [2019-12-07 17:34:17,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:17,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724361100] [2019-12-07 17:34:17,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:34:17,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724361100] [2019-12-07 17:34:17,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:34:17,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:34:17,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610621820] [2019-12-07 17:34:17,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:34:17,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:17,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:34:17,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:34:17,812 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand 5 states. [2019-12-07 17:34:17,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:17,902 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2019-12-07 17:34:17,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:34:17,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 17:34:17,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:17,904 INFO L225 Difference]: With dead ends: 78 [2019-12-07 17:34:17,904 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 17:34:17,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:34:17,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 17:34:17,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2019-12-07 17:34:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 17:34:17,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2019-12-07 17:34:17,912 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 27 [2019-12-07 17:34:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:17,912 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2019-12-07 17:34:17,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:34:17,912 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2019-12-07 17:34:17,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 17:34:17,913 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:17,913 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:34:17,914 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:17,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:17,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1881014477, now seen corresponding path program 1 times [2019-12-07 17:34:17,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:17,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570932690] [2019-12-07 17:34:17,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:34:17,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570932690] [2019-12-07 17:34:17,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:34:17,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:34:17,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786956097] [2019-12-07 17:34:17,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:34:17,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:17,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:34:17,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:34:17,969 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand 5 states. [2019-12-07 17:34:18,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:18,058 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2019-12-07 17:34:18,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:34:18,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 17:34:18,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:18,059 INFO L225 Difference]: With dead ends: 80 [2019-12-07 17:34:18,059 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 17:34:18,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:34:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 17:34:18,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2019-12-07 17:34:18,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 17:34:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2019-12-07 17:34:18,064 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 29 [2019-12-07 17:34:18,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:18,064 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2019-12-07 17:34:18,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:34:18,064 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2019-12-07 17:34:18,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 17:34:18,065 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:18,065 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:34:18,065 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:18,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:18,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1389249843, now seen corresponding path program 1 times [2019-12-07 17:34:18,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:18,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311620549] [2019-12-07 17:34:18,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:34:18,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311620549] [2019-12-07 17:34:18,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:34:18,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:34:18,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515673817] [2019-12-07 17:34:18,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:34:18,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:18,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:34:18,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:34:18,101 INFO L87 Difference]: Start difference. First operand 60 states and 84 transitions. Second operand 5 states. [2019-12-07 17:34:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:18,173 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2019-12-07 17:34:18,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:34:18,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 17:34:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:18,174 INFO L225 Difference]: With dead ends: 80 [2019-12-07 17:34:18,174 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 17:34:18,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:34:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 17:34:18,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2019-12-07 17:34:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 17:34:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2019-12-07 17:34:18,178 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 29 [2019-12-07 17:34:18,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:18,178 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2019-12-07 17:34:18,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:34:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2019-12-07 17:34:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 17:34:18,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:18,179 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:34:18,179 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:18,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:18,180 INFO L82 PathProgramCache]: Analyzing trace with hash 115063225, now seen corresponding path program 1 times [2019-12-07 17:34:18,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:18,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224061806] [2019-12-07 17:34:18,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:34:18,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224061806] [2019-12-07 17:34:18,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077973848] [2019-12-07 17:34:18,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:18,307 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 17:34:18,312 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:34:18,350 INFO L377 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 6 treesize of output 5 [2019-12-07 17:34:18,350 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:18,354 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:18,354 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:18,355 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:34:18,376 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:18,376 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:34:18,377 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:18,383 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:18,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:34:18,387 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:18,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:18,393 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:18,393 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-12-07 17:34:18,407 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-12-07 17:34:18,407 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 17:34:18,407 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:18,411 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:18,411 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:18,411 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-12-07 17:34:18,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 17:34:18,427 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:18,433 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:18,434 INFO L534 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. [2019-12-07 17:34:18,434 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-12-07 17:34:18,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 17:34:18,458 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:18,462 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:18,462 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:18,463 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-12-07 17:34:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:34:18,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:34:18,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-12-07 17:34:18,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184734056] [2019-12-07 17:34:18,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:34:18,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:18,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:34:18,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:34:18,468 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand 10 states. [2019-12-07 17:34:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:18,681 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2019-12-07 17:34:18,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:34:18,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-12-07 17:34:18,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:18,682 INFO L225 Difference]: With dead ends: 82 [2019-12-07 17:34:18,682 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 17:34:18,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:34:18,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 17:34:18,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2019-12-07 17:34:18,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 17:34:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2019-12-07 17:34:18,687 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 31 [2019-12-07 17:34:18,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:18,688 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2019-12-07 17:34:18,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:34:18,688 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2019-12-07 17:34:18,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 17:34:18,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:18,689 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:34:18,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:18,890 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:18,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:18,891 INFO L82 PathProgramCache]: Analyzing trace with hash 978464889, now seen corresponding path program 1 times [2019-12-07 17:34:18,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:18,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856463834] [2019-12-07 17:34:18,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:19,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:34:19,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856463834] [2019-12-07 17:34:19,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386730418] [2019-12-07 17:34:19,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:19,096 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 17:34:19,098 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:34:19,101 INFO L377 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 6 treesize of output 5 [2019-12-07 17:34:19,102 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,103 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:19,103 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,103 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:34:19,115 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:19,115 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:34:19,116 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,121 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:19,124 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:34:19,124 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:19,130 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,130 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-12-07 17:34:19,142 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-12-07 17:34:19,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 17:34:19,143 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,146 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:19,146 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,147 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-12-07 17:34:19,158 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 17:34:19,159 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,164 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:19,165 INFO L534 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. [2019-12-07 17:34:19,165 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-12-07 17:34:19,183 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 17:34:19,184 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,188 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:19,188 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,188 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-12-07 17:34:19,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:34:19,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:34:19,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-12-07 17:34:19,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560372277] [2019-12-07 17:34:19,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:34:19,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:19,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:34:19,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:34:19,191 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 10 states. [2019-12-07 17:34:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:19,426 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2019-12-07 17:34:19,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:34:19,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-12-07 17:34:19,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:19,427 INFO L225 Difference]: With dead ends: 91 [2019-12-07 17:34:19,427 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 17:34:19,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:34:19,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 17:34:19,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2019-12-07 17:34:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 17:34:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-12-07 17:34:19,432 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 31 [2019-12-07 17:34:19,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:19,432 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-12-07 17:34:19,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:34:19,432 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-12-07 17:34:19,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 17:34:19,433 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:19,433 INFO L410 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, 1, 1] [2019-12-07 17:34:19,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:19,634 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:19,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:19,634 INFO L82 PathProgramCache]: Analyzing trace with hash -20007500, now seen corresponding path program 1 times [2019-12-07 17:34:19,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:19,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338590712] [2019-12-07 17:34:19,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:34:19,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338590712] [2019-12-07 17:34:19,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848983673] [2019-12-07 17:34:19,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:19,837 INFO L264 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 17:34:19,839 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:34:19,843 INFO L377 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 6 treesize of output 5 [2019-12-07 17:34:19,843 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,845 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:19,845 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,845 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:34:19,870 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:19,870 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:34:19,870 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,873 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:19,874 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,874 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-12-07 17:34:19,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:34:19,892 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:19,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:34:19,902 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,908 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:19,909 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,909 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-12-07 17:34:19,927 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_40|], 2=[|v_#memory_$Pointer$.base_43|, |v_#memory_$Pointer$.offset_41|]} [2019-12-07 17:34:19,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2019-12-07 17:34:19,930 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,938 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:19,952 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:19,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-12-07 17:34:19,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:34:19,955 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,972 INFO L614 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2019-12-07 17:34:19,974 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-12-07 17:34:19,974 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,977 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:19,978 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,978 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-12-07 17:34:19,995 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-12-07 17:34:19,995 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:19,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:20,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 17:34:20,001 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,004 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:20,005 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,005 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-12-07 17:34:20,007 INFO L377 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 15 treesize of output 7 [2019-12-07 17:34:20,007 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,008 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:20,008 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,008 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 17:34:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:34:20,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:34:20,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-12-07 17:34:20,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807494475] [2019-12-07 17:34:20,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:34:20,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:20,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:34:20,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:34:20,011 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-12-07 17:34:20,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:20,358 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2019-12-07 17:34:20,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:34:20,359 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-12-07 17:34:20,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:20,359 INFO L225 Difference]: With dead ends: 95 [2019-12-07 17:34:20,359 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 17:34:20,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:34:20,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 17:34:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2019-12-07 17:34:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 17:34:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 107 transitions. [2019-12-07 17:34:20,365 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 107 transitions. Word has length 33 [2019-12-07 17:34:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:20,365 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 107 transitions. [2019-12-07 17:34:20,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:34:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2019-12-07 17:34:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:34:20,366 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:20,366 INFO L410 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, 1, 1, 1, 1] [2019-12-07 17:34:20,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:20,568 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:20,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:20,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1998658321, now seen corresponding path program 1 times [2019-12-07 17:34:20,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:20,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106659378] [2019-12-07 17:34:20,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:34:20,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106659378] [2019-12-07 17:34:20,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300470023] [2019-12-07 17:34:20,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:20,780 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 17:34:20,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:34:20,785 INFO L377 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 6 treesize of output 5 [2019-12-07 17:34:20,785 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,786 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:20,787 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,787 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:34:20,819 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:20,820 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:34:20,820 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,824 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:20,824 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,824 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-12-07 17:34:20,845 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:34:20,846 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,854 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:20,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:34:20,857 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,865 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:20,865 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,866 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-12-07 17:34:20,886 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_41|], 2=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_43|]} [2019-12-07 17:34:20,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2019-12-07 17:34:20,889 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,896 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:20,908 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:20,909 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-12-07 17:34:20,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:34:20,910 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,921 INFO L614 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2019-12-07 17:34:20,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-12-07 17:34:20,924 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,927 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:20,927 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,927 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-12-07 17:34:20,946 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-12-07 17:34:20,947 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,952 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:20,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 17:34:20,954 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,957 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:20,957 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,957 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-12-07 17:34:20,959 INFO L377 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 15 treesize of output 7 [2019-12-07 17:34:20,960 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,961 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:20,961 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:20,961 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 17:34:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:34:20,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:34:20,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-12-07 17:34:20,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371857777] [2019-12-07 17:34:20,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:34:20,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:20,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:34:20,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:34:20,965 INFO L87 Difference]: Start difference. First operand 79 states and 107 transitions. Second operand 15 states. [2019-12-07 17:34:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:21,304 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2019-12-07 17:34:21,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:34:21,305 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2019-12-07 17:34:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:21,306 INFO L225 Difference]: With dead ends: 97 [2019-12-07 17:34:21,306 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 17:34:21,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:34:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 17:34:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2019-12-07 17:34:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 17:34:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 95 transitions. [2019-12-07 17:34:21,311 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 95 transitions. Word has length 35 [2019-12-07 17:34:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:21,311 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 95 transitions. [2019-12-07 17:34:21,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:34:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 95 transitions. [2019-12-07 17:34:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:34:21,312 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:21,313 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:34:21,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:21,514 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:21,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:21,514 INFO L82 PathProgramCache]: Analyzing trace with hash -973955345, now seen corresponding path program 2 times [2019-12-07 17:34:21,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:21,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472132289] [2019-12-07 17:34:21,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:34:21,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472132289] [2019-12-07 17:34:21,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403772416] [2019-12-07 17:34:21,710 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:21,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:34:21,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:34:21,751 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 17:34:21,753 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:34:21,756 INFO L377 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 6 treesize of output 5 [2019-12-07 17:34:21,756 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:21,759 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:21,759 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:21,760 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:34:21,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:21,768 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:34:21,769 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:21,775 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:21,775 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:21,775 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-12-07 17:34:21,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:34:21,781 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:21,788 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:21,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:34:21,791 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:21,798 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:21,798 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:21,798 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2019-12-07 17:34:21,805 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 2=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_45|]} [2019-12-07 17:34:21,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-12-07 17:34:21,808 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:21,818 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:21,833 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:21,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2019-12-07 17:34:21,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:34:21,835 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:21,850 INFO L614 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2019-12-07 17:34:21,853 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-07 17:34:21,853 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:21,860 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:21,861 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:21,861 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2019-12-07 17:34:21,880 INFO L377 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 31 treesize of output 19 [2019-12-07 17:34:21,880 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:21,885 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:21,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-12-07 17:34:21,886 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:21,889 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:21,889 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:21,890 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2019-12-07 17:34:21,892 INFO L377 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 15 treesize of output 7 [2019-12-07 17:34:21,893 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:21,895 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:21,895 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:21,896 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 17:34:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:34:21,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:34:21,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-12-07 17:34:21,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559325875] [2019-12-07 17:34:21,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:34:21,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:21,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:34:21,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:34:21,899 INFO L87 Difference]: Start difference. First operand 70 states and 95 transitions. Second operand 11 states. [2019-12-07 17:34:22,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:22,197 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2019-12-07 17:34:22,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:34:22,197 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-12-07 17:34:22,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:22,198 INFO L225 Difference]: With dead ends: 90 [2019-12-07 17:34:22,198 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 17:34:22,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:34:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 17:34:22,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2019-12-07 17:34:22,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 17:34:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2019-12-07 17:34:22,201 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 35 [2019-12-07 17:34:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:22,201 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2019-12-07 17:34:22,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:34:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2019-12-07 17:34:22,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:34:22,201 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:22,202 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-12-07 17:34:22,402 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:22,403 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:22,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:22,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1696962272, now seen corresponding path program 2 times [2019-12-07 17:34:22,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:22,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621923437] [2019-12-07 17:34:22,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:34:22,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621923437] [2019-12-07 17:34:22,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104728579] [2019-12-07 17:34:22,541 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:22,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:34:22,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:34:22,586 INFO L264 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-07 17:34:22,588 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:34:22,593 INFO L377 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 6 treesize of output 5 [2019-12-07 17:34:22,593 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:22,596 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:22,596 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:22,597 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:34:22,621 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:22,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 17:34:22,621 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:22,641 INFO L614 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-12-07 17:34:22,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:34:22,644 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:22,651 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:22,651 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:22,651 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-12-07 17:34:22,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:22,673 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 17:34:22,674 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:22,679 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:22,679 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:22,680 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-12-07 17:34:22,703 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:22,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-12-07 17:34:22,704 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:22,711 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:22,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 17:34:22,714 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:22,724 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:22,724 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:22,725 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-12-07 17:34:22,753 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-12-07 17:34:22,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-12-07 17:34:22,753 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:22,760 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:22,761 INFO L534 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. [2019-12-07 17:34:22,761 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-12-07 17:34:22,786 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-12-07 17:34:22,787 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:22,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:22,796 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:22,796 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-12-07 17:34:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:34:22,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:34:22,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-12-07 17:34:22,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310501063] [2019-12-07 17:34:22,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 17:34:22,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:22,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 17:34:22,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:34:22,849 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand 18 states. [2019-12-07 17:34:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:24,072 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2019-12-07 17:34:24,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 17:34:24,072 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-12-07 17:34:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:24,073 INFO L225 Difference]: With dead ends: 109 [2019-12-07 17:34:24,073 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 17:34:24,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-12-07 17:34:24,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 17:34:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2019-12-07 17:34:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 17:34:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2019-12-07 17:34:24,076 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 35 [2019-12-07 17:34:24,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:24,077 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. [2019-12-07 17:34:24,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 17:34:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2019-12-07 17:34:24,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:34:24,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:24,077 INFO L410 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, 1, 1, 1, 1] [2019-12-07 17:34:24,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:24,279 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:24,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:24,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1996664224, now seen corresponding path program 1 times [2019-12-07 17:34:24,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:24,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68047546] [2019-12-07 17:34:24,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:24,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:34:24,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68047546] [2019-12-07 17:34:24,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110306751] [2019-12-07 17:34:24,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:24,450 INFO L264 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 17:34:24,452 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:34:24,455 INFO L377 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 6 treesize of output 5 [2019-12-07 17:34:24,455 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:24,457 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:24,457 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:24,457 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:34:24,498 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:24,498 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 17:34:24,499 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:24,515 INFO L614 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-12-07 17:34:24,518 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 17:34:24,518 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:24,525 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:24,525 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:24,525 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2019-12-07 17:34:24,550 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-12-07 17:34:24,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 17:34:24,551 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:24,555 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:24,556 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:24,556 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2019-12-07 17:34:24,579 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:24,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-12-07 17:34:24,579 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:24,585 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:24,588 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 17:34:24,588 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:24,593 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:24,594 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:24,594 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2019-12-07 17:34:24,617 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-12-07 17:34:24,618 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-12-07 17:34:24,618 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:24,624 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:24,624 INFO L534 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. [2019-12-07 17:34:24,624 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2019-12-07 17:34:24,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-12-07 17:34:24,648 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:24,655 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:24,656 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:24,656 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2019-12-07 17:34:24,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 17:34:24,680 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:24,684 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:24,684 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:24,684 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2019-12-07 17:34:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:34:24,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:34:24,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2019-12-07 17:34:24,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820360810] [2019-12-07 17:34:24,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 17:34:24,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:24,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 17:34:24,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:34:24,699 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. Second operand 20 states. [2019-12-07 17:34:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:25,275 INFO L93 Difference]: Finished difference Result 131 states and 166 transitions. [2019-12-07 17:34:25,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 17:34:25,276 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2019-12-07 17:34:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:25,276 INFO L225 Difference]: With dead ends: 131 [2019-12-07 17:34:25,276 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 17:34:25,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 17:34:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 17:34:25,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 91. [2019-12-07 17:34:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 17:34:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2019-12-07 17:34:25,280 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 35 [2019-12-07 17:34:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:25,280 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2019-12-07 17:34:25,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 17:34:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2019-12-07 17:34:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:34:25,281 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:25,281 INFO L410 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, 1, 1] [2019-12-07 17:34:25,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:25,482 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:25,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:25,483 INFO L82 PathProgramCache]: Analyzing trace with hash -233446117, now seen corresponding path program 3 times [2019-12-07 17:34:25,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:25,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91729130] [2019-12-07 17:34:25,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:34:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:34:25,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91729130] [2019-12-07 17:34:25,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854320733] [2019-12-07 17:34:25,691 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:25,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 17:34:25,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:34:25,744 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 68 conjunts are in the unsatisfiable core [2019-12-07 17:34:25,746 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:34:25,749 INFO L377 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 6 treesize of output 5 [2019-12-07 17:34:25,749 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:25,751 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:25,752 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:25,752 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:34:25,766 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:25,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 17:34:25,767 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:25,784 INFO L614 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-12-07 17:34:25,784 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:25,784 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-12-07 17:34:25,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:34:25,807 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:25,817 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:25,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:34:25,820 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:25,830 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:25,830 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:25,830 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-12-07 17:34:25,864 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:25,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-12-07 17:34:25,865 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:25,885 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:25,886 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_53|], 2=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_53|]} [2019-12-07 17:34:25,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 17:34:25,889 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:25,906 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:25,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:25,910 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 17:34:25,910 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:25,924 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:25,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:25,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2019-12-07 17:34:25,928 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:25,938 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:25,938 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:25,938 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:43 [2019-12-07 17:34:25,967 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 116 [2019-12-07 17:34:25,967 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:25,988 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:25,990 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:34:25,997 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:25,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 125 [2019-12-07 17:34:25,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:34:25,998 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:26,034 INFO L614 ElimStorePlain]: treesize reduction 24, result has 85.8 percent of original size [2019-12-07 17:34:26,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:34:26,038 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2019-12-07 17:34:26,038 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:26,050 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:26,051 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:26,051 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:169, output treesize:117 [2019-12-07 17:34:26,081 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_int_55|], 6=[|v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_55|]} [2019-12-07 17:34:26,085 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2019-12-07 17:34:26,085 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:26,117 INFO L614 ElimStorePlain]: treesize reduction 22, result has 92.4 percent of original size [2019-12-07 17:34:26,143 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:26,144 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 263 treesize of output 258 [2019-12-07 17:34:26,145 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:26,156 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:26,160 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:26,160 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 65 [2019-12-07 17:34:26,160 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:26,176 INFO L614 ElimStorePlain]: treesize reduction 24, result has 71.4 percent of original size [2019-12-07 17:34:26,177 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:34:26,177 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:306, output treesize:60 [2019-12-07 17:34:26,239 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:26,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 40 [2019-12-07 17:34:26,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:34:26,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:34:26,241 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:26,259 INFO L614 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-12-07 17:34:26,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 17:34:26,261 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:34:26,267 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:34:26,267 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:34:26,267 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:29 [2019-12-07 17:34:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:34:26,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:34:26,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-12-07 17:34:26,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320551107] [2019-12-07 17:34:26,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 17:34:26,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:34:26,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 17:34:26,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:34:26,347 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand 21 states. [2019-12-07 17:34:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:34:27,092 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2019-12-07 17:34:27,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:34:27,093 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2019-12-07 17:34:27,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:34:27,093 INFO L225 Difference]: With dead ends: 118 [2019-12-07 17:34:27,093 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 17:34:27,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 17:34:27,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 17:34:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2019-12-07 17:34:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 17:34:27,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2019-12-07 17:34:27,097 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 37 [2019-12-07 17:34:27,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:34:27,097 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2019-12-07 17:34:27,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 17:34:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2019-12-07 17:34:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:34:27,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:34:27,098 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-12-07 17:34:27,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:34:27,299 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:34:27,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:34:27,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1007382053, now seen corresponding path program 1 times [2019-12-07 17:34:27,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:34:27,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602364986] [2019-12-07 17:34:27,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:34:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:34:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:34:27,346 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:34:27,346 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:34:27,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:34:27 BoogieIcfgContainer [2019-12-07 17:34:27,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:34:27,379 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:34:27,379 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:34:27,379 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:34:27,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:34:17" (3/4) ... [2019-12-07 17:34:27,381 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:34:27,416 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c46dd2b0-be42-415f-91ba-fb08197b76fe/bin/uautomizer/witness.graphml [2019-12-07 17:34:27,416 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:34:27,417 INFO L168 Benchmark]: Toolchain (without parser) took 10699.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -202.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:34:27,417 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:34:27,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:34:27,418 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:34:27,418 INFO L168 Benchmark]: Boogie Preprocessor took 24.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:34:27,418 INFO L168 Benchmark]: RCFGBuilder took 305.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:34:27,419 INFO L168 Benchmark]: TraceAbstraction took 9947.59 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 95.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -112.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:34:27,419 INFO L168 Benchmark]: Witness Printer took 37.49 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: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:34:27,420 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 340.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 305.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9947.59 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 95.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -112.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 37.49 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: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 609]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) [L544] COND FALSE !(__VERIFIER_nondet_int()) [L563] n = ((void *)0) [L564] struct TreeNode* pred; [L565] COND TRUE \read(*root) [L566] pred = ((void *)0) [L567] n = root [L568] EXPR n->left [L568] n->left || n->right [L568] EXPR n->right [L568] n->left || n->right [L568] COND FALSE !(n->left || n->right) [L575] COND FALSE !(\read(*pred)) [L581] root = ((void *)0) [L565] COND FALSE !(\read(*root)) [L584] List a = (List) malloc(sizeof(struct node)); [L585] COND FALSE !(a == 0) [L586] List t; [L587] List p = a; [L588] COND TRUE __VERIFIER_nondet_int() [L589] p->h = 1 [L590] t = (List) malloc(sizeof(struct node)) [L591] COND FALSE !(t == 0) [L592] p->n = t [L593] EXPR p->n [L593] p = p->n [L588] COND FALSE !(__VERIFIER_nondet_int()) [L595] COND TRUE __VERIFIER_nondet_int() [L596] p->h = 2 [L597] t = (List) malloc(sizeof(struct node)) [L598] COND FALSE !(t == 0) [L599] p->n = t [L600] EXPR p->n [L600] p = p->n [L595] COND FALSE !(__VERIFIER_nondet_int()) [L602] p->h = 3 [L603] p = a [L604] EXPR p->h [L604] COND FALSE !(p->h == 2) [L606] EXPR p->h [L606] COND TRUE p->h == 1 [L607] EXPR p->n [L607] p = p->n [L606] EXPR p->h [L606] COND FALSE !(p->h == 1) [L608] EXPR p->h [L608] COND TRUE p->h != 3 [L609] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 1 error locations. Result: UNSAFE, OverallTime: 9.8s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 760 SDtfs, 1050 SDslu, 3392 SDs, 0 SdLazy, 2445 SolverSat, 370 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 452 GetRequests, 251 SyntacticMatches, 8 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 169 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 730 NumberOfCodeBlocks, 730 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 671 ConstructedInterpolants, 17 QuantifiedInterpolants, 185717 SizeOfPredicates, 92 NumberOfNonLiveVariables, 1198 ConjunctsInSsa, 293 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 32/112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...