./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s4if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s4if.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/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 f0c6762a510921214435f03fd1512220ceb2c5e3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s4if.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/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 f0c6762a510921214435f03fd1512220ceb2c5e3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 00:44:35,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:44:35,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:44:35,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:44:35,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:44:35,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:44:35,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:44:35,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:44:35,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:44:35,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:44:35,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:44:35,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:44:35,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:44:35,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:44:35,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:44:35,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:44:35,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:44:35,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:44:35,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:44:36,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:44:36,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:44:36,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:44:36,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:44:36,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:44:36,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:44:36,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:44:36,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:44:36,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:44:36,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:44:36,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:44:36,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:44:36,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:44:36,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:44:36,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:44:36,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:44:36,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:44:36,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:44:36,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:44:36,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:44:36,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:44:36,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:44:36,024 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:44:36,047 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:44:36,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:44:36,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:44:36,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:44:36,048 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:44:36,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:44:36,049 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:44:36,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:44:36,049 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:44:36,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:44:36,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:44:36,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:44:36,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:44:36,050 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:44:36,050 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:44:36,050 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:44:36,050 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:44:36,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:44:36,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:44:36,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:44:36,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:44:36,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:44:36,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:44:36,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:44:36,052 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:44:36,052 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:44:36,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:44:36,052 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:44:36,053 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_ae477670-a2c6-47ac-b370-7078a9e4d812/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 -> f0c6762a510921214435f03fd1512220ceb2c5e3 [2019-11-20 00:44:36,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:44:36,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:44:36,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:44:36,248 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:44:36,248 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:44:36,250 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/../../sv-benchmarks/c/array-fpi/s4if.c [2019-11-20 00:44:36,308 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/data/85a57e98f/51dc46d25d4b4c8682535d9c2d127c5b/FLAG02fe8715e [2019-11-20 00:44:36,685 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:44:36,686 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/sv-benchmarks/c/array-fpi/s4if.c [2019-11-20 00:44:36,691 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/data/85a57e98f/51dc46d25d4b4c8682535d9c2d127c5b/FLAG02fe8715e [2019-11-20 00:44:37,115 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/data/85a57e98f/51dc46d25d4b4c8682535d9c2d127c5b [2019-11-20 00:44:37,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:44:37,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:44:37,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:44:37,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:44:37,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:44:37,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:44:37" (1/1) ... [2019-11-20 00:44:37,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44224560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:37, skipping insertion in model container [2019-11-20 00:44:37,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:44:37" (1/1) ... [2019-11-20 00:44:37,138 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:44:37,153 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:44:37,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:44:37,447 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:44:37,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:44:37,488 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:44:37,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:37 WrapperNode [2019-11-20 00:44:37,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:44:37,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:44:37,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:44:37,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:44:37,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:37" (1/1) ... [2019-11-20 00:44:37,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:37" (1/1) ... [2019-11-20 00:44:37,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:44:37,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:44:37,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:44:37,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:44:37,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:37" (1/1) ... [2019-11-20 00:44:37,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:37" (1/1) ... [2019-11-20 00:44:37,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:37" (1/1) ... [2019-11-20 00:44:37,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:37" (1/1) ... [2019-11-20 00:44:37,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:37" (1/1) ... [2019-11-20 00:44:37,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:37" (1/1) ... [2019-11-20 00:44:37,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:37" (1/1) ... [2019-11-20 00:44:37,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:44:37,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:44:37,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:44:37,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:44:37,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/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-11-20 00:44:37,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 00:44:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 00:44:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 00:44:37,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:44:37,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:44:37,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 00:44:37,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 00:44:37,982 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:44:37,982 INFO L285 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-20 00:44:37,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:44:37 BoogieIcfgContainer [2019-11-20 00:44:37,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:44:37,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:44:37,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:44:37,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:44:37,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:44:37" (1/3) ... [2019-11-20 00:44:37,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d222e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:44:37, skipping insertion in model container [2019-11-20 00:44:37,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:37" (2/3) ... [2019-11-20 00:44:37,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d222e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:44:37, skipping insertion in model container [2019-11-20 00:44:37,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:44:37" (3/3) ... [2019-11-20 00:44:37,992 INFO L109 eAbstractionObserver]: Analyzing ICFG s4if.c [2019-11-20 00:44:38,001 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:44:38,007 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:44:38,017 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:44:38,044 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:44:38,046 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:44:38,046 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:44:38,046 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:44:38,046 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:44:38,046 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:44:38,046 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:44:38,046 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:44:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-11-20 00:44:38,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 00:44:38,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:38,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:44:38,062 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:38,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1476218026, now seen corresponding path program 1 times [2019-11-20 00:44:38,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:44:38,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905763537] [2019-11-20 00:44:38,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:44:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:38,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905763537] [2019-11-20 00:44:38,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:44:38,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:44:38,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851507823] [2019-11-20 00:44:38,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 00:44:38,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:44:38,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 00:44:38,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 00:44:38,210 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-11-20 00:44:38,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:38,223 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-20 00:44:38,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 00:44:38,224 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-20 00:44:38,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:38,232 INFO L225 Difference]: With dead ends: 29 [2019-11-20 00:44:38,232 INFO L226 Difference]: Without dead ends: 13 [2019-11-20 00:44:38,234 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-11-20 00:44:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-20 00:44:38,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-20 00:44:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-20 00:44:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-11-20 00:44:38,264 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 9 [2019-11-20 00:44:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:38,264 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-20 00:44:38,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 00:44:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-11-20 00:44:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 00:44:38,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:38,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:44:38,265 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:38,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:38,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1304115419, now seen corresponding path program 1 times [2019-11-20 00:44:38,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:44:38,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224669398] [2019-11-20 00:44:38,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:44:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:38,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224669398] [2019-11-20 00:44:38,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:44:38,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:44:38,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069400751] [2019-11-20 00:44:38,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:44:38,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:44:38,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:44:38,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:44:38,341 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 3 states. [2019-11-20 00:44:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:38,379 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-11-20 00:44:38,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:44:38,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-20 00:44:38,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:38,380 INFO L225 Difference]: With dead ends: 23 [2019-11-20 00:44:38,380 INFO L226 Difference]: Without dead ends: 15 [2019-11-20 00:44:38,381 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-11-20 00:44:38,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-20 00:44:38,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-20 00:44:38,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-20 00:44:38,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-20 00:44:38,385 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-11-20 00:44:38,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:38,385 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-20 00:44:38,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:44:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-11-20 00:44:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 00:44:38,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:38,386 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:44:38,386 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:38,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:38,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1358761923, now seen corresponding path program 1 times [2019-11-20 00:44:38,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:44:38,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992847398] [2019-11-20 00:44:38,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:44:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 00:44:38,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992847398] [2019-11-20 00:44:38,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:44:38,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:44:38,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933406917] [2019-11-20 00:44:38,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:44:38,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:44:38,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:44:38,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:44:38,452 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 4 states. [2019-11-20 00:44:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:38,502 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-11-20 00:44:38,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:44:38,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-20 00:44:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:38,503 INFO L225 Difference]: With dead ends: 22 [2019-11-20 00:44:38,504 INFO L226 Difference]: Without dead ends: 18 [2019-11-20 00:44:38,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:44:38,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-20 00:44:38,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-11-20 00:44:38,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 00:44:38,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-20 00:44:38,508 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2019-11-20 00:44:38,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:38,509 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-20 00:44:38,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:44:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-11-20 00:44:38,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 00:44:38,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:38,510 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:44:38,510 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:38,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:38,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1565637502, now seen corresponding path program 1 times [2019-11-20 00:44:38,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:44:38,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238813051] [2019-11-20 00:44:38,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:44:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:38,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238813051] [2019-11-20 00:44:38,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585050465] [2019-11-20 00:44:38,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/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-11-20 00:44:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:38,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 00:44:38,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:39,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 00:44:39,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:39,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:39,087 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-11-20 00:44:39,087 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:39,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:39,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:39,099 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-20 00:44:39,141 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 23 treesize of output 22 [2019-11-20 00:44:39,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:39,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:39,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:39,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-20 00:44:39,424 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:39,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2019-11-20 00:44:39,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:39,461 INFO L567 ElimStorePlain]: treesize reduction 32, result has 62.4 percent of original size [2019-11-20 00:44:39,462 INFO L496 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-11-20 00:44:39,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:70, output treesize:53 [2019-11-20 00:44:39,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:39,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:44:39,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-20 00:44:39,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484643638] [2019-11-20 00:44:39,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 00:44:39,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:44:39,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 00:44:39,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-20 00:44:39,569 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 18 states. [2019-11-20 00:44:40,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:40,261 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-11-20 00:44:40,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 00:44:40,261 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-11-20 00:44:40,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:40,264 INFO L225 Difference]: With dead ends: 33 [2019-11-20 00:44:40,264 INFO L226 Difference]: Without dead ends: 24 [2019-11-20 00:44:40,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2019-11-20 00:44:40,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-20 00:44:40,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-11-20 00:44:40,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-20 00:44:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-20 00:44:40,271 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2019-11-20 00:44:40,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:40,271 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-20 00:44:40,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 00:44:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-20 00:44:40,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 00:44:40,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:40,273 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:44:40,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:44:40,474 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:40,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:40,474 INFO L82 PathProgramCache]: Analyzing trace with hash -472130976, now seen corresponding path program 2 times [2019-11-20 00:44:40,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:44:40,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443199432] [2019-11-20 00:44:40,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:44:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:40,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443199432] [2019-11-20 00:44:40,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224357907] [2019-11-20 00:44:40,555 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/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-11-20 00:44:40,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 00:44:40,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:44:40,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 00:44:40,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:40,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:44:40,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-20 00:44:40,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690502650] [2019-11-20 00:44:40,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 00:44:40,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:44:40,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 00:44:40,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:44:40,652 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 10 states. [2019-11-20 00:44:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:40,818 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-11-20 00:44:40,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 00:44:40,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-20 00:44:40,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:40,821 INFO L225 Difference]: With dead ends: 31 [2019-11-20 00:44:40,821 INFO L226 Difference]: Without dead ends: 27 [2019-11-20 00:44:40,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-11-20 00:44:40,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-20 00:44:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-11-20 00:44:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-20 00:44:40,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-11-20 00:44:40,826 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2019-11-20 00:44:40,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:40,826 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-20 00:44:40,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 00:44:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-11-20 00:44:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 00:44:40,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:40,827 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:44:41,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:44:41,028 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:41,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:41,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1317941731, now seen corresponding path program 3 times [2019-11-20 00:44:41,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:44:41,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095392228] [2019-11-20 00:44:41,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:44:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:41,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095392228] [2019-11-20 00:44:41,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685705723] [2019-11-20 00:44:41,094 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/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-11-20 00:44:41,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-20 00:44:41,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:44:41,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 00:44:41,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:41,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:44:41,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-20 00:44:41,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137714856] [2019-11-20 00:44:41,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 00:44:41,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:44:41,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 00:44:41,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:44:41,176 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 10 states. [2019-11-20 00:44:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:41,281 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-11-20 00:44:41,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 00:44:41,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-20 00:44:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:41,282 INFO L225 Difference]: With dead ends: 35 [2019-11-20 00:44:41,282 INFO L226 Difference]: Without dead ends: 23 [2019-11-20 00:44:41,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-20 00:44:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-20 00:44:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-11-20 00:44:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-20 00:44:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-20 00:44:41,287 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2019-11-20 00:44:41,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:41,287 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-20 00:44:41,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 00:44:41,288 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-11-20 00:44:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 00:44:41,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:41,288 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:44:41,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:44:41,492 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:41,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:41,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1991965825, now seen corresponding path program 4 times [2019-11-20 00:44:41,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:44:41,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023198082] [2019-11-20 00:44:41,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:44:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:42,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023198082] [2019-11-20 00:44:42,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273418272] [2019-11-20 00:44:42,077 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/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-11-20 00:44:42,132 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 00:44:42,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:44:42,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-20 00:44:42,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:42,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 00:44:42,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:42,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:42,169 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-11-20 00:44:42,169 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:42,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:42,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:42,176 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-20 00:44:42,212 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 23 treesize of output 22 [2019-11-20 00:44:42,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:42,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:42,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:42,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-20 00:44:42,328 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:42,329 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-11-20 00:44:42,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:42,360 INFO L567 ElimStorePlain]: treesize reduction 36, result has 55.6 percent of original size [2019-11-20 00:44:42,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:44:42,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-11-20 00:44:42,680 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:42,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 103 [2019-11-20 00:44:42,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:42,731 INFO L567 ElimStorePlain]: treesize reduction 48, result has 59.0 percent of original size [2019-11-20 00:44:42,732 INFO L496 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-11-20 00:44:42,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:86, output treesize:69 [2019-11-20 00:44:42,976 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:42,976 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 165 [2019-11-20 00:44:42,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:43,040 INFO L567 ElimStorePlain]: treesize reduction 150, result has 27.9 percent of original size [2019-11-20 00:44:43,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 00:44:43,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:113, output treesize:50 [2019-11-20 00:44:43,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:43,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:44:43,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2019-11-20 00:44:43,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814969151] [2019-11-20 00:44:43,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-20 00:44:43,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:44:43,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-20 00:44:43,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-11-20 00:44:43,138 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 27 states. [2019-11-20 00:44:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:44,062 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-11-20 00:44:44,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 00:44:44,062 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 19 [2019-11-20 00:44:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:44,063 INFO L225 Difference]: With dead ends: 43 [2019-11-20 00:44:44,063 INFO L226 Difference]: Without dead ends: 32 [2019-11-20 00:44:44,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2019-11-20 00:44:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-20 00:44:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-11-20 00:44:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 00:44:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-20 00:44:44,070 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2019-11-20 00:44:44,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:44,070 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-20 00:44:44,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-20 00:44:44,071 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-20 00:44:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 00:44:44,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:44,071 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:44:44,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:44:44,275 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:44,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:44,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1189058463, now seen corresponding path program 5 times [2019-11-20 00:44:44,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:44:44,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775657270] [2019-11-20 00:44:44,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:44:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:44,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775657270] [2019-11-20 00:44:44,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393641557] [2019-11-20 00:44:44,343 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/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-11-20 00:44:44,385 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-20 00:44:44,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:44:44,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 00:44:44,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:44,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:44:44,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-20 00:44:44,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810488334] [2019-11-20 00:44:44,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 00:44:44,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:44:44,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 00:44:44,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:44:44,427 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 13 states. [2019-11-20 00:44:44,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:44,630 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2019-11-20 00:44:44,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 00:44:44,630 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-11-20 00:44:44,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:44,631 INFO L225 Difference]: With dead ends: 39 [2019-11-20 00:44:44,631 INFO L226 Difference]: Without dead ends: 35 [2019-11-20 00:44:44,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-11-20 00:44:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-20 00:44:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-11-20 00:44:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 00:44:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-11-20 00:44:44,643 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2019-11-20 00:44:44,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:44,644 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-20 00:44:44,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 00:44:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-11-20 00:44:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 00:44:44,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:44,645 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:44:44,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:44:44,846 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:44,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:44,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1846717952, now seen corresponding path program 6 times [2019-11-20 00:44:44,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:44:44,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148412796] [2019-11-20 00:44:44,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:44:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:44,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148412796] [2019-11-20 00:44:44,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152015889] [2019-11-20 00:44:44,924 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/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-11-20 00:44:44,978 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-20 00:44:44,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:44:44,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 00:44:44,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:45,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:44:45,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-20 00:44:45,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721152298] [2019-11-20 00:44:45,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 00:44:45,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:44:45,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 00:44:45,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:44:45,030 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 13 states. [2019-11-20 00:44:45,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:45,130 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-11-20 00:44:45,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 00:44:45,131 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-11-20 00:44:45,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:45,131 INFO L225 Difference]: With dead ends: 43 [2019-11-20 00:44:45,131 INFO L226 Difference]: Without dead ends: 28 [2019-11-20 00:44:45,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-20 00:44:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-20 00:44:45,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-11-20 00:44:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-20 00:44:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-20 00:44:45,136 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2019-11-20 00:44:45,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:45,136 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-20 00:44:45,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 00:44:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-11-20 00:44:45,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 00:44:45,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:45,137 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:44:45,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:44:45,338 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:45,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:45,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1106368034, now seen corresponding path program 7 times [2019-11-20 00:44:45,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:44:45,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872316582] [2019-11-20 00:44:45,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:44:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:46,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872316582] [2019-11-20 00:44:46,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549883399] [2019-11-20 00:44:46,176 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/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-11-20 00:44:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:46,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-20 00:44:46,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:46,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 00:44:46,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:46,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:46,257 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-11-20 00:44:46,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:46,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:46,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:46,265 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-20 00:44:46,308 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 23 treesize of output 22 [2019-11-20 00:44:46,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:46,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:46,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:46,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-20 00:44:46,417 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:46,417 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 56 [2019-11-20 00:44:46,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:46,440 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.0 percent of original size [2019-11-20 00:44:46,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:46,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-20 00:44:46,551 INFO L343 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-11-20 00:44:46,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 98 [2019-11-20 00:44:46,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:46,587 INFO L567 ElimStorePlain]: treesize reduction 54, result has 47.1 percent of original size [2019-11-20 00:44:46,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:46,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2019-11-20 00:44:46,815 INFO L343 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2019-11-20 00:44:46,816 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 101 [2019-11-20 00:44:46,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:46,846 INFO L567 ElimStorePlain]: treesize reduction 58, result has 50.0 percent of original size [2019-11-20 00:44:46,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:44:46,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:79, output treesize:58 [2019-11-20 00:44:47,345 WARN L191 SmtUtils]: Spent 456.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-20 00:44:47,768 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 00:44:47,832 INFO L343 Elim1Store]: treesize reduction 32, result has 75.2 percent of original size [2019-11-20 00:44:47,833 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 84 treesize of output 171 [2019-11-20 00:44:47,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:47,871 INFO L567 ElimStorePlain]: treesize reduction 108, result has 41.0 percent of original size [2019-11-20 00:44:47,871 INFO L496 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-11-20 00:44:47,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:94, output treesize:75 [2019-11-20 00:44:48,079 INFO L343 Elim1Store]: treesize reduction 32, result has 75.2 percent of original size [2019-11-20 00:44:48,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 173 [2019-11-20 00:44:48,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:48,116 INFO L567 ElimStorePlain]: treesize reduction 88, result has 46.0 percent of original size [2019-11-20 00:44:48,116 INFO L496 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-11-20 00:44:48,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:100, output treesize:75 [2019-11-20 00:44:48,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:48,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:44:48,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2019-11-20 00:44:48,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319451334] [2019-11-20 00:44:48,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-20 00:44:48,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:44:48,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-20 00:44:48,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1082, Unknown=0, NotChecked=0, Total=1190 [2019-11-20 00:44:48,247 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 35 states. [2019-11-20 00:44:50,451 WARN L191 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-11-20 00:44:51,882 WARN L191 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-11-20 00:44:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:52,359 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2019-11-20 00:44:52,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-20 00:44:52,360 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 24 [2019-11-20 00:44:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:52,361 INFO L225 Difference]: With dead ends: 60 [2019-11-20 00:44:52,361 INFO L226 Difference]: Without dead ends: 44 [2019-11-20 00:44:52,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=248, Invalid=2302, Unknown=0, NotChecked=0, Total=2550 [2019-11-20 00:44:52,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-20 00:44:52,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-11-20 00:44:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-20 00:44:52,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-11-20 00:44:52,368 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 24 [2019-11-20 00:44:52,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:52,369 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-11-20 00:44:52,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-20 00:44:52,369 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-11-20 00:44:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 00:44:52,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:52,370 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:44:52,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:44:52,570 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:52,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:52,571 INFO L82 PathProgramCache]: Analyzing trace with hash -426309664, now seen corresponding path program 1 times [2019-11-20 00:44:52,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:44:52,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442003637] [2019-11-20 00:44:52,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:44:52,585 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 00:44:52,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1777164813] [2019-11-20 00:44:52,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/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-11-20 00:44:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:52,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 00:44:52,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:52,641 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 00:44:52,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:52,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:52,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:52,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-20 00:44:52,664 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 15 treesize of output 11 [2019-11-20 00:44:52,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:52,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:52,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:52,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-20 00:44:52,707 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:52,707 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 25 treesize of output 54 [2019-11-20 00:44:52,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:52,729 INFO L567 ElimStorePlain]: treesize reduction 30, result has 48.3 percent of original size [2019-11-20 00:44:52,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:44:52,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-11-20 00:44:52,788 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:52,788 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 91 [2019-11-20 00:44:52,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:52,809 INFO L567 ElimStorePlain]: treesize reduction 72, result has 30.1 percent of original size [2019-11-20 00:44:52,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:44:52,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:27 [2019-11-20 00:44:52,867 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:52,868 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2019-11-20 00:44:52,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:52,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:52,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:52,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-11-20 00:44:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:44:52,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442003637] [2019-11-20 00:44:52,891 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 00:44:52,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777164813] [2019-11-20 00:44:52,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:44:52,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-11-20 00:44:52,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557614316] [2019-11-20 00:44:52,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 00:44:52,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:44:52,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 00:44:52,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-20 00:44:52,893 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 11 states. [2019-11-20 00:44:53,459 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-11-20 00:44:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:53,538 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-11-20 00:44:53,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 00:44:53,539 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-11-20 00:44:53,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:53,539 INFO L225 Difference]: With dead ends: 46 [2019-11-20 00:44:53,539 INFO L226 Difference]: Without dead ends: 37 [2019-11-20 00:44:53,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-20 00:44:53,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-20 00:44:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-11-20 00:44:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 00:44:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-11-20 00:44:53,546 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 24 [2019-11-20 00:44:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:53,547 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-20 00:44:53,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 00:44:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-11-20 00:44:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 00:44:53,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:53,548 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:44:53,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:44:53,751 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:53,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:53,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1700299324, now seen corresponding path program 8 times [2019-11-20 00:44:53,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:44:53,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209646279] [2019-11-20 00:44:53,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:44:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:53,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209646279] [2019-11-20 00:44:53,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886971917] [2019-11-20 00:44:53,855 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:44:53,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 00:44:53,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:44:53,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 00:44:53,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:53,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:44:53,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-11-20 00:44:53,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323123887] [2019-11-20 00:44:53,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 00:44:53,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:44:53,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 00:44:53,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-11-20 00:44:53,967 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 16 states. [2019-11-20 00:44:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:54,189 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-11-20 00:44:54,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 00:44:54,189 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-20 00:44:54,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:54,190 INFO L225 Difference]: With dead ends: 47 [2019-11-20 00:44:54,190 INFO L226 Difference]: Without dead ends: 43 [2019-11-20 00:44:54,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-11-20 00:44:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-20 00:44:54,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2019-11-20 00:44:54,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-20 00:44:54,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-11-20 00:44:54,197 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 26 [2019-11-20 00:44:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:54,197 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-11-20 00:44:54,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 00:44:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-11-20 00:44:54,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 00:44:54,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:54,198 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:44:54,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:44:54,399 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:54,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:54,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1307941697, now seen corresponding path program 9 times [2019-11-20 00:44:54,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:44:54,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440946844] [2019-11-20 00:44:54,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:44:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:54,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440946844] [2019-11-20 00:44:54,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383810089] [2019-11-20 00:44:54,478 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:44:54,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-20 00:44:54,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:44:54,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 00:44:54,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:54,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:44:54,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-11-20 00:44:54,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843109676] [2019-11-20 00:44:54,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 00:44:54,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:44:54,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 00:44:54,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-20 00:44:54,595 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 16 states. [2019-11-20 00:44:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:54,771 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-11-20 00:44:54,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 00:44:54,772 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-11-20 00:44:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:54,772 INFO L225 Difference]: With dead ends: 51 [2019-11-20 00:44:54,772 INFO L226 Difference]: Without dead ends: 33 [2019-11-20 00:44:54,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-11-20 00:44:54,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-20 00:44:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-11-20 00:44:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-20 00:44:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-20 00:44:54,778 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 27 [2019-11-20 00:44:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:54,778 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-20 00:44:54,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 00:44:54,779 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-20 00:44:54,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 00:44:54,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:54,784 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:44:54,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:44:54,988 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:54,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:54,989 INFO L82 PathProgramCache]: Analyzing trace with hash 311885347, now seen corresponding path program 10 times [2019-11-20 00:44:54,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:44:54,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146808307] [2019-11-20 00:44:54,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:44:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:55,835 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:55,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146808307] [2019-11-20 00:44:55,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223184635] [2019-11-20 00:44:55,835 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:44:55,878 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 00:44:55,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:44:55,879 WARN L253 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-20 00:44:55,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:55,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 00:44:55,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:55,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:55,900 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-11-20 00:44:55,900 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:55,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:55,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:55,906 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-20 00:44:55,937 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 23 treesize of output 22 [2019-11-20 00:44:55,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:55,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:55,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:55,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-20 00:44:56,032 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:56,032 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-11-20 00:44:56,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:56,058 INFO L567 ElimStorePlain]: treesize reduction 36, result has 55.6 percent of original size [2019-11-20 00:44:56,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:44:56,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-11-20 00:44:56,177 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:56,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 138 [2019-11-20 00:44:56,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:56,218 INFO L567 ElimStorePlain]: treesize reduction 72, result has 45.9 percent of original size [2019-11-20 00:44:56,218 INFO L496 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-11-20 00:44:56,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:61 [2019-11-20 00:44:56,384 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:56,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 220 [2019-11-20 00:44:56,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:56,495 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-11-20 00:44:56,495 INFO L567 ElimStorePlain]: treesize reduction 108, result has 41.6 percent of original size [2019-11-20 00:44:56,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 00:44:56,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:77 [2019-11-20 00:44:57,032 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:57,033 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 243 [2019-11-20 00:44:57,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:57,102 INFO L567 ElimStorePlain]: treesize reduction 96, result has 49.2 percent of original size [2019-11-20 00:44:57,103 INFO L496 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-11-20 00:44:57,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:118, output treesize:93 [2019-11-20 00:44:57,398 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:57,399 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 99 treesize of output 337 [2019-11-20 00:44:57,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:57,506 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2019-11-20 00:44:57,506 INFO L567 ElimStorePlain]: treesize reduction 312, result has 27.6 percent of original size [2019-11-20 00:44:57,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 00:44:57,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:134, output treesize:119 [2019-11-20 00:44:57,948 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-20 00:44:57,948 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:57,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 120 treesize of output 449 [2019-11-20 00:44:57,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:58,156 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 66 [2019-11-20 00:44:58,157 INFO L567 ElimStorePlain]: treesize reduction 480, result has 23.1 percent of original size [2019-11-20 00:44:58,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-20 00:44:58,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:160, output treesize:144 [2019-11-20 00:44:58,747 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-11-20 00:44:58,747 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:58,748 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 140 treesize of output 576 [2019-11-20 00:44:58,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:58,954 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 62 [2019-11-20 00:44:58,955 INFO L567 ElimStorePlain]: treesize reduction 620, result has 16.1 percent of original size [2019-11-20 00:44:59,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-20 00:44:59,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:188, output treesize:104 [2019-11-20 00:44:59,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:59,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:44:59,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2019-11-20 00:44:59,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270304605] [2019-11-20 00:44:59,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-20 00:44:59,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:44:59,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-20 00:44:59,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2011, Unknown=0, NotChecked=0, Total=2162 [2019-11-20 00:44:59,297 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 47 states. [2019-11-20 00:45:02,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:45:02,906 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2019-11-20 00:45:02,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-20 00:45:02,907 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 29 [2019-11-20 00:45:02,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:45:02,907 INFO L225 Difference]: With dead ends: 65 [2019-11-20 00:45:02,907 INFO L226 Difference]: Without dead ends: 48 [2019-11-20 00:45:02,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=374, Invalid=4317, Unknown=1, NotChecked=0, Total=4692 [2019-11-20 00:45:02,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-20 00:45:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2019-11-20 00:45:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-20 00:45:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-11-20 00:45:02,918 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 29 [2019-11-20 00:45:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:45:02,918 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-11-20 00:45:02,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-20 00:45:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-11-20 00:45:02,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 00:45:02,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:45:02,920 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:45:03,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:45:03,123 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:45:03,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:45:03,123 INFO L82 PathProgramCache]: Analyzing trace with hash 879440005, now seen corresponding path program 11 times [2019-11-20 00:45:03,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:45:03,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053273201] [2019-11-20 00:45:03,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:45:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:03,265 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:03,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053273201] [2019-11-20 00:45:03,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541086562] [2019-11-20 00:45:03,266 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:45:03,333 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-20 00:45:03,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:45:03,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 00:45:03,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:45:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:03,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:45:03,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-11-20 00:45:03,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857360599] [2019-11-20 00:45:03,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 00:45:03,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:45:03,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 00:45:03,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-11-20 00:45:03,429 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 19 states. [2019-11-20 00:45:03,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:45:03,906 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-11-20 00:45:03,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 00:45:03,908 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-11-20 00:45:03,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:45:03,908 INFO L225 Difference]: With dead ends: 55 [2019-11-20 00:45:03,909 INFO L226 Difference]: Without dead ends: 51 [2019-11-20 00:45:03,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2019-11-20 00:45:03,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-20 00:45:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-11-20 00:45:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-20 00:45:03,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-11-20 00:45:03,917 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 31 [2019-11-20 00:45:03,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:45:03,918 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-11-20 00:45:03,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 00:45:03,918 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-11-20 00:45:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 00:45:03,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:45:03,919 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:45:04,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:45:04,122 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:45:04,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:45:04,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1393842980, now seen corresponding path program 12 times [2019-11-20 00:45:04,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:45:04,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321519490] [2019-11-20 00:45:04,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:45:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:04,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321519490] [2019-11-20 00:45:04,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970454796] [2019-11-20 00:45:04,235 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:45:04,307 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-11-20 00:45:04,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:45:04,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 00:45:04,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:45:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:04,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:45:04,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-11-20 00:45:04,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493889243] [2019-11-20 00:45:04,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 00:45:04,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:45:04,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 00:45:04,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-11-20 00:45:04,417 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 19 states. [2019-11-20 00:45:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:45:04,583 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-11-20 00:45:04,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 00:45:04,583 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-11-20 00:45:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:45:04,584 INFO L225 Difference]: With dead ends: 59 [2019-11-20 00:45:04,584 INFO L226 Difference]: Without dead ends: 38 [2019-11-20 00:45:04,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2019-11-20 00:45:04,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-20 00:45:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-11-20 00:45:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-20 00:45:04,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-11-20 00:45:04,590 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 32 [2019-11-20 00:45:04,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:45:04,591 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-11-20 00:45:04,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 00:45:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-11-20 00:45:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 00:45:04,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:45:04,592 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:45:04,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:45:04,795 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:45:04,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:45:04,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1635696442, now seen corresponding path program 13 times [2019-11-20 00:45:04,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:45:04,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443199900] [2019-11-20 00:45:04,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:45:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:05,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443199900] [2019-11-20 00:45:05,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855709267] [2019-11-20 00:45:05,577 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:45:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:05,614 WARN L253 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-20 00:45:05,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:45:05,626 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 00:45:05,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:05,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:05,649 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-11-20 00:45:05,649 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:05,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:05,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:45:05,656 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-20 00:45:05,689 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 23 treesize of output 22 [2019-11-20 00:45:05,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:05,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:05,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:45:05,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-20 00:45:05,797 INFO L343 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-11-20 00:45:05,797 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2019-11-20 00:45:05,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:05,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:05,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:45:05,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-20 00:45:05,952 INFO L343 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-11-20 00:45:05,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 98 [2019-11-20 00:45:05,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:05,983 INFO L567 ElimStorePlain]: treesize reduction 54, result has 45.5 percent of original size [2019-11-20 00:45:05,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:45:05,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-11-20 00:45:06,180 INFO L343 Elim1Store]: treesize reduction 32, result has 77.5 percent of original size [2019-11-20 00:45:06,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 140 [2019-11-20 00:45:06,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:06,246 INFO L567 ElimStorePlain]: treesize reduction 84, result has 39.1 percent of original size [2019-11-20 00:45:06,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:45:06,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2019-11-20 00:45:06,523 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2019-11-20 00:45:06,524 INFO L343 Elim1Store]: treesize reduction 114, result has 51.7 percent of original size [2019-11-20 00:45:06,524 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 155 [2019-11-20 00:45:06,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:06,611 INFO L567 ElimStorePlain]: treesize reduction 84, result has 45.1 percent of original size [2019-11-20 00:45:06,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:45:06,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:69 [2019-11-20 00:45:07,062 INFO L343 Elim1Store]: treesize reduction 112, result has 38.1 percent of original size [2019-11-20 00:45:07,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 87 treesize of output 153 [2019-11-20 00:45:07,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:07,122 INFO L567 ElimStorePlain]: treesize reduction 114, result has 41.2 percent of original size [2019-11-20 00:45:07,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:45:07,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:97, output treesize:80 [2019-11-20 00:45:07,516 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2019-11-20 00:45:07,516 INFO L343 Elim1Store]: treesize reduction 112, result has 57.7 percent of original size [2019-11-20 00:45:07,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 106 treesize of output 251 [2019-11-20 00:45:07,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:07,571 INFO L567 ElimStorePlain]: treesize reduction 172, result has 34.1 percent of original size [2019-11-20 00:45:07,572 INFO L496 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-11-20 00:45:07,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:116, output treesize:89 [2019-11-20 00:45:10,813 WARN L191 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-20 00:45:12,890 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 00:45:12,998 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2019-11-20 00:45:12,999 INFO L343 Elim1Store]: treesize reduction 112, result has 57.7 percent of original size [2019-11-20 00:45:12,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 104 treesize of output 253 [2019-11-20 00:45:13,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:13,063 INFO L567 ElimStorePlain]: treesize reduction 326, result has 24.9 percent of original size [2019-11-20 00:45:13,064 INFO L496 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-11-20 00:45:13,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:114, output treesize:108 [2019-11-20 00:45:13,445 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 99 [2019-11-20 00:45:13,446 INFO L343 Elim1Store]: treesize reduction 112, result has 69.3 percent of original size [2019-11-20 00:45:13,446 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 370 [2019-11-20 00:45:13,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:13,517 INFO L567 ElimStorePlain]: treesize reduction 224, result has 30.9 percent of original size [2019-11-20 00:45:13,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 00:45:13,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:144, output treesize:100 [2019-11-20 00:45:17,623 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-11-20 00:45:19,707 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 00:45:19,882 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2019-11-20 00:45:19,882 INFO L343 Elim1Store]: treesize reduction 112, result has 57.7 percent of original size [2019-11-20 00:45:19,882 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 104 treesize of output 253 [2019-11-20 00:45:19,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:19,949 INFO L567 ElimStorePlain]: treesize reduction 256, result has 28.5 percent of original size [2019-11-20 00:45:19,950 INFO L496 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-11-20 00:45:19,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:114, output treesize:102 [2019-11-20 00:45:20,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:20,138 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:20,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:45:20,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 51 [2019-11-20 00:45:20,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744361522] [2019-11-20 00:45:20,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-11-20 00:45:20,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:45:20,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-11-20 00:45:20,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2392, Unknown=0, NotChecked=0, Total=2550 [2019-11-20 00:45:20,141 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 51 states. [2019-11-20 00:45:23,478 WARN L191 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-11-20 00:45:25,006 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-11-20 00:45:28,962 WARN L191 SmtUtils]: Spent 3.89 s on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-11-20 00:45:29,125 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-11-20 00:45:32,317 WARN L191 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-11-20 00:45:35,446 WARN L191 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-20 00:45:35,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:45:35,737 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2019-11-20 00:45:35,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-20 00:45:35,738 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 34 [2019-11-20 00:45:35,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:45:35,738 INFO L225 Difference]: With dead ends: 84 [2019-11-20 00:45:35,738 INFO L226 Difference]: Without dead ends: 62 [2019-11-20 00:45:35,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1445 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=363, Invalid=5187, Unknown=0, NotChecked=0, Total=5550 [2019-11-20 00:45:35,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-20 00:45:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2019-11-20 00:45:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-20 00:45:35,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-11-20 00:45:35,749 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 34 [2019-11-20 00:45:35,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:45:35,749 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-11-20 00:45:35,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-11-20 00:45:35,749 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-11-20 00:45:35,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 00:45:35,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:45:35,750 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:45:35,953 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:45:35,953 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:45:35,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:45:35,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1979212484, now seen corresponding path program 2 times [2019-11-20 00:45:35,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:45:35,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507231492] [2019-11-20 00:45:35,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:45:35,958 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 00:45:35,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [62681218] [2019-11-20 00:45:35,959 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:45:36,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 00:45:36,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:45:36,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-20 00:45:36,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:45:36,072 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 15 treesize of output 11 [2019-11-20 00:45:36,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:36,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:36,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:45:36,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-20 00:45:36,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:36,122 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 25 treesize of output 24 [2019-11-20 00:45:36,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:36,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:36,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:45:36,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2019-11-20 00:45:36,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:36,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:36,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:36,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:36,198 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2019-11-20 00:45:36,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:36,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:36,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:45:36,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:35 [2019-11-20 00:45:36,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:36,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:36,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:36,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:36,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2019-11-20 00:45:36,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:36,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:36,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:45:36,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:35 [2019-11-20 00:45:36,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:36,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:36,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:36,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:36,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2019-11-20 00:45:36,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:36,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:36,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:45:36,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:30 [2019-11-20 00:45:36,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:36,373 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:36,373 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 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-20 00:45:36,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:36,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:36,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:45:36,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2019-11-20 00:45:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:45:36,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507231492] [2019-11-20 00:45:36,395 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 00:45:36,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62681218] [2019-11-20 00:45:36,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:45:36,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-11-20 00:45:36,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770717388] [2019-11-20 00:45:36,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 00:45:36,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:45:36,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 00:45:36,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-20 00:45:36,396 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 15 states. [2019-11-20 00:45:37,191 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-11-20 00:45:37,519 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-11-20 00:45:37,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:45:37,564 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2019-11-20 00:45:37,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 00:45:37,565 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-11-20 00:45:37,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:45:37,565 INFO L225 Difference]: With dead ends: 62 [2019-11-20 00:45:37,565 INFO L226 Difference]: Without dead ends: 53 [2019-11-20 00:45:37,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-11-20 00:45:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-20 00:45:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-11-20 00:45:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-20 00:45:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-11-20 00:45:37,577 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 34 [2019-11-20 00:45:37,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:45:37,577 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-11-20 00:45:37,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 00:45:37,577 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-11-20 00:45:37,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 00:45:37,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:45:37,578 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:45:37,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:45:37,781 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:45:37,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:45:37,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1893861880, now seen corresponding path program 3 times [2019-11-20 00:45:37,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:45:37,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103978956] [2019-11-20 00:45:37,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:45:37,787 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 00:45:37,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [346327852] [2019-11-20 00:45:37,795 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:45:37,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-20 00:45:37,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:45:37,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-20 00:45:37,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:45:37,874 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 13 treesize of output 9 [2019-11-20 00:45:37,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:37,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:37,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:45:37,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-20 00:45:37,904 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:37,904 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2019-11-20 00:45:37,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:37,921 INFO L567 ElimStorePlain]: treesize reduction 30, result has 49.2 percent of original size [2019-11-20 00:45:37,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:45:37,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-20 00:45:37,996 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:37,996 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 118 [2019-11-20 00:45:37,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:38,026 INFO L567 ElimStorePlain]: treesize reduction 66, result has 40.5 percent of original size [2019-11-20 00:45:38,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:45:38,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-11-20 00:45:46,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:46,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:46,601 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:46,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 77 [2019-11-20 00:45:46,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:46,622 INFO L567 ElimStorePlain]: treesize reduction 44, result has 45.7 percent of original size [2019-11-20 00:45:46,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:45:46,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:37 [2019-11-20 00:45:47,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:47,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:47,018 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:47,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 77 [2019-11-20 00:45:47,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:47,047 INFO L567 ElimStorePlain]: treesize reduction 44, result has 45.7 percent of original size [2019-11-20 00:45:47,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:45:47,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:32 [2019-11-20 00:45:47,098 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:45:47,107 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:47,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 35 [2019-11-20 00:45:47,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:47,118 INFO L567 ElimStorePlain]: treesize reduction 22, result has 35.3 percent of original size [2019-11-20 00:45:47,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:45:47,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2019-11-20 00:45:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 00:45:47,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103978956] [2019-11-20 00:45:47,145 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 00:45:47,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346327852] [2019-11-20 00:45:47,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:45:47,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-11-20 00:45:47,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517238683] [2019-11-20 00:45:47,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 00:45:47,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:45:47,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 00:45:47,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=141, Unknown=5, NotChecked=0, Total=182 [2019-11-20 00:45:47,146 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 14 states. [2019-11-20 00:45:57,793 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 31 [2019-11-20 00:46:02,343 WARN L191 SmtUtils]: Spent 3.70 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 00:46:05,127 WARN L191 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 00:46:05,571 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-11-20 00:46:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:15,677 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-11-20 00:46:15,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 00:46:15,680 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-11-20 00:46:15,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:15,681 INFO L225 Difference]: With dead ends: 64 [2019-11-20 00:46:15,681 INFO L226 Difference]: Without dead ends: 52 [2019-11-20 00:46:15,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=86, Invalid=283, Unknown=11, NotChecked=0, Total=380 [2019-11-20 00:46:15,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-20 00:46:15,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-20 00:46:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-20 00:46:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-11-20 00:46:15,689 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 34 [2019-11-20 00:46:15,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:15,690 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-11-20 00:46:15,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 00:46:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-11-20 00:46:15,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 00:46:15,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:15,691 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:15,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:46:15,892 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:15,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:15,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1035254296, now seen corresponding path program 14 times [2019-11-20 00:46:15,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:15,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774039507] [2019-11-20 00:46:15,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:16,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774039507] [2019-11-20 00:46:16,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477881480] [2019-11-20 00:46:16,035 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:46:16,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 00:46:16,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:46:16,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 00:46:16,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:46:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:16,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:46:16,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-11-20 00:46:16,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724965631] [2019-11-20 00:46:16,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 00:46:16,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:16,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 00:46:16,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-11-20 00:46:16,213 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 22 states. [2019-11-20 00:46:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:16,712 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-11-20 00:46:16,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 00:46:16,713 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2019-11-20 00:46:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:16,713 INFO L225 Difference]: With dead ends: 63 [2019-11-20 00:46:16,713 INFO L226 Difference]: Without dead ends: 59 [2019-11-20 00:46:16,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2019-11-20 00:46:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-20 00:46:16,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2019-11-20 00:46:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-20 00:46:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-11-20 00:46:16,720 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 36 [2019-11-20 00:46:16,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:16,720 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-11-20 00:46:16,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 00:46:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-11-20 00:46:16,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 00:46:16,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:16,721 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:16,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:46:16,924 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:16,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:16,924 INFO L82 PathProgramCache]: Analyzing trace with hash -127223707, now seen corresponding path program 15 times [2019-11-20 00:46:16,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:16,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632198175] [2019-11-20 00:46:16,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:17,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632198175] [2019-11-20 00:46:17,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619733008] [2019-11-20 00:46:17,053 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:46:17,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-20 00:46:17,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:46:17,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 00:46:17,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:46:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:17,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:46:17,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-11-20 00:46:17,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370497675] [2019-11-20 00:46:17,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 00:46:17,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:17,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 00:46:17,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-11-20 00:46:17,224 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 22 states. [2019-11-20 00:46:17,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:17,405 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-11-20 00:46:17,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 00:46:17,406 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2019-11-20 00:46:17,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:17,406 INFO L225 Difference]: With dead ends: 67 [2019-11-20 00:46:17,407 INFO L226 Difference]: Without dead ends: 43 [2019-11-20 00:46:17,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-11-20 00:46:17,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-20 00:46:17,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-20 00:46:17,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-20 00:46:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-20 00:46:17,414 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 37 [2019-11-20 00:46:17,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:17,414 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-20 00:46:17,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 00:46:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-20 00:46:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 00:46:17,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:17,415 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:17,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:46:17,615 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:17,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:17,616 INFO L82 PathProgramCache]: Analyzing trace with hash 639592647, now seen corresponding path program 16 times [2019-11-20 00:46:17,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:17,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242663522] [2019-11-20 00:46:17,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:18,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242663522] [2019-11-20 00:46:18,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587134986] [2019-11-20 00:46:18,816 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:46:18,875 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 00:46:18,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:46:18,877 WARN L253 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 65 conjunts are in the unsatisfiable core [2019-11-20 00:46:18,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:46:18,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 00:46:18,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:46:18,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:46:18,898 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-11-20 00:46:18,898 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:46:18,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:46:18,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:46:18,905 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-20 00:46:18,961 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 23 treesize of output 22 [2019-11-20 00:46:18,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:46:18,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:46:18,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:46:18,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-20 00:46:19,074 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:46:19,074 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-11-20 00:46:19,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:46:19,101 INFO L567 ElimStorePlain]: treesize reduction 36, result has 55.6 percent of original size [2019-11-20 00:46:19,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:46:19,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-11-20 00:46:19,280 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:46:19,280 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 138 [2019-11-20 00:46:19,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:46:19,322 INFO L567 ElimStorePlain]: treesize reduction 72, result has 45.9 percent of original size [2019-11-20 00:46:19,322 INFO L496 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-11-20 00:46:19,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:61 [2019-11-20 00:46:19,509 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:46:19,509 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 220 [2019-11-20 00:46:19,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:46:19,568 INFO L567 ElimStorePlain]: treesize reduction 108, result has 41.6 percent of original size [2019-11-20 00:46:19,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 00:46:19,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:77 [2019-11-20 00:46:19,865 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-20 00:46:19,865 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:46:19,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 318 [2019-11-20 00:46:19,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:46:19,985 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-11-20 00:46:19,986 INFO L567 ElimStorePlain]: treesize reduction 144, result has 39.2 percent of original size [2019-11-20 00:46:19,987 INFO L496 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-11-20 00:46:19,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:93 [2019-11-20 00:46:20,516 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-11-20 00:46:20,516 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:46:20,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 432 [2019-11-20 00:46:20,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:46:20,622 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-11-20 00:46:20,623 INFO L567 ElimStorePlain]: treesize reduction 180, result has 37.7 percent of original size [2019-11-20 00:46:20,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 00:46:20,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:113, output treesize:109 [2019-11-20 00:46:26,723 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-20 00:46:26,723 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:46:26,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 110 treesize of output 447 [2019-11-20 00:46:26,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:46:26,845 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 65 [2019-11-20 00:46:26,845 INFO L567 ElimStorePlain]: treesize reduction 384, result has 24.6 percent of original size [2019-11-20 00:46:26,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-20 00:46:26,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:150, output treesize:125 [2019-11-20 00:46:27,427 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-11-20 00:46:27,427 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:46:27,428 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 121 treesize of output 573 [2019-11-20 00:46:27,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:46:27,580 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 73 [2019-11-20 00:46:27,581 INFO L567 ElimStorePlain]: treesize reduction 576, result has 20.8 percent of original size [2019-11-20 00:46:27,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-20 00:46:27,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:166, output treesize:151 [2019-11-20 00:46:28,332 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-11-20 00:46:28,332 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:46:28,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 142 treesize of output 717 [2019-11-20 00:46:28,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:46:28,565 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 81 [2019-11-20 00:46:28,565 INFO L567 ElimStorePlain]: treesize reduction 912, result has 15.5 percent of original size [2019-11-20 00:46:28,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-20 00:46:28,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:192, output treesize:167 [2019-11-20 00:46:28,803 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-20 00:46:29,600 WARN L191 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 223 [2019-11-20 00:46:29,600 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:46:29,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 153 treesize of output 875 [2019-11-20 00:46:29,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:46:29,865 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 88 [2019-11-20 00:46:29,865 INFO L567 ElimStorePlain]: treesize reduction 768, result has 19.2 percent of original size [2019-11-20 00:46:29,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-11-20 00:46:29,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:208, output treesize:183 [2019-11-20 00:46:31,925 WARN L191 SmtUtils]: Spent 518.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2019-11-20 00:46:31,925 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:46:31,926 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 1 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 164 treesize of output 1049 [2019-11-20 00:46:31,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:46:32,253 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 95 [2019-11-20 00:46:32,254 INFO L567 ElimStorePlain]: treesize reduction 1344, result has 12.9 percent of original size [2019-11-20 00:46:32,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-11-20 00:46:32,255 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:224, output treesize:199 [2019-11-20 00:46:45,080 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-20 00:46:46,040 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-20 00:46:46,752 WARN L191 SmtUtils]: Spent 698.00 ms on a formula simplification that was a NOOP. DAG size: 315 [2019-11-20 00:46:46,752 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:46:46,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 66 case distinctions, treesize of input 175 treesize of output 1239 [2019-11-20 00:46:46,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:46:47,139 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 82 [2019-11-20 00:46:47,139 INFO L567 ElimStorePlain]: treesize reduction 1410, result has 9.7 percent of original size [2019-11-20 00:46:47,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-11-20 00:46:47,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 15 variables, input treesize:243, output treesize:129 [2019-11-20 00:46:47,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:46:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:47,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:46:47,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35] total 65 [2019-11-20 00:46:47,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105621334] [2019-11-20 00:46:47,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-11-20 00:46:47,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:47,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-11-20 00:46:47,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3930, Unknown=0, NotChecked=0, Total=4160 [2019-11-20 00:46:47,685 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 65 states. [2019-11-20 00:47:16,780 WARN L191 SmtUtils]: Spent 4.68 s on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-11-20 00:49:06,441 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-11-20 00:49:35,827 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 112 [2019-11-20 00:49:49,218 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-11-20 00:50:01,363 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 113 [2019-11-20 00:50:57,284 WARN L191 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 125 DAG size of output: 111 [2019-11-20 00:51:08,594 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 107 [2019-11-20 00:51:24,247 WARN L191 SmtUtils]: Spent 998.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 118 [2019-11-20 00:51:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:51:49,159 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2019-11-20 00:51:49,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-20 00:51:49,161 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 39 [2019-11-20 00:51:49,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:51:49,162 INFO L225 Difference]: With dead ends: 87 [2019-11-20 00:51:49,162 INFO L226 Difference]: Without dead ends: 64 [2019-11-20 00:51:49,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2185 ImplicationChecksByTransitivity, 79.1s TimeCoverageRelationStatistics Valid=564, Invalid=8745, Unknown=3, NotChecked=0, Total=9312 [2019-11-20 00:51:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-20 00:51:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2019-11-20 00:51:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 00:51:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2019-11-20 00:51:49,178 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 39 [2019-11-20 00:51:49,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:51:49,178 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2019-11-20 00:51:49,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-11-20 00:51:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2019-11-20 00:51:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 00:51:49,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:51:49,179 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:51:49,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:51:49,381 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:51:49,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:49,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1184266071, now seen corresponding path program 17 times [2019-11-20 00:51:49,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:49,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051258086] [2019-11-20 00:51:49,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:49,580 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:51:49,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051258086] [2019-11-20 00:51:49,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042092964] [2019-11-20 00:51:49,580 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:51:49,673 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-20 00:51:49,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:51:49,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 00:51:49,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:51:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:51:49,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:51:49,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2019-11-20 00:51:49,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701197483] [2019-11-20 00:51:49,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-20 00:51:49,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:51:49,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-20 00:51:49,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2019-11-20 00:51:49,814 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 25 states. [2019-11-20 00:51:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:51:50,256 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2019-11-20 00:51:50,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 00:51:50,256 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2019-11-20 00:51:50,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:51:50,257 INFO L225 Difference]: With dead ends: 71 [2019-11-20 00:51:50,257 INFO L226 Difference]: Without dead ends: 67 [2019-11-20 00:51:50,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=342, Invalid=1140, Unknown=0, NotChecked=0, Total=1482 [2019-11-20 00:51:50,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-20 00:51:50,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-11-20 00:51:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-20 00:51:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-11-20 00:51:50,267 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 41 [2019-11-20 00:51:50,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:51:50,268 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-11-20 00:51:50,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-20 00:51:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-11-20 00:51:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 00:51:50,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:51:50,269 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:51:50,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:51:50,473 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:51:50,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:50,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1126332488, now seen corresponding path program 18 times [2019-11-20 00:51:50,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:50,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134229598] [2019-11-20 00:51:50,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:50,639 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 54 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:51:50,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134229598] [2019-11-20 00:51:50,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315683322] [2019-11-20 00:51:50,640 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:51:50,724 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-20 00:51:50,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:51:50,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 00:51:50,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:51:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:51:50,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:51:50,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2019-11-20 00:51:50,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518132308] [2019-11-20 00:51:50,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-20 00:51:50,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:51:50,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-20 00:51:50,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2019-11-20 00:51:50,855 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 25 states. [2019-11-20 00:51:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:51:51,088 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-11-20 00:51:51,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 00:51:51,089 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2019-11-20 00:51:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:51:51,089 INFO L225 Difference]: With dead ends: 75 [2019-11-20 00:51:51,089 INFO L226 Difference]: Without dead ends: 48 [2019-11-20 00:51:51,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2019-11-20 00:51:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-20 00:51:51,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-11-20 00:51:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-20 00:51:51,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-11-20 00:51:51,099 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 42 [2019-11-20 00:51:51,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:51:51,099 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-11-20 00:51:51,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-20 00:51:51,100 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-11-20 00:51:51,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 00:51:51,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:51:51,100 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:51:51,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:51:51,301 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:51:51,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:51,301 INFO L82 PathProgramCache]: Analyzing trace with hash -70138730, now seen corresponding path program 19 times [2019-11-20 00:51:51,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:51,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703978051] [2019-11-20 00:51:51,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:51:52,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703978051] [2019-11-20 00:51:52,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640695731] [2019-11-20 00:51:52,638 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:51:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:52,680 WARN L253 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-20 00:51:52,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:51:52,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 00:51:52,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:52,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:52,693 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-11-20 00:51:52,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:52,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:52,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:51:52,700 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-20 00:51:52,742 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 23 treesize of output 22 [2019-11-20 00:51:52,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:52,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:52,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:51:52,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-20 00:51:52,861 INFO L343 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-11-20 00:51:52,862 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2019-11-20 00:51:52,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:52,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:52,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:51:52,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-20 00:51:53,006 INFO L343 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2019-11-20 00:51:53,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2019-11-20 00:51:53,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:53,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:53,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:51:53,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2019-11-20 00:51:53,173 INFO L343 Elim1Store]: treesize reduction 171, result has 17.8 percent of original size [2019-11-20 00:51:53,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2019-11-20 00:51:53,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:53,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:53,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:51:53,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2019-11-20 00:51:53,417 INFO L343 Elim1Store]: treesize reduction 66, result has 69.3 percent of original size [2019-11-20 00:51:53,417 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 182 [2019-11-20 00:51:53,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:53,474 INFO L567 ElimStorePlain]: treesize reduction 114, result has 35.6 percent of original size [2019-11-20 00:51:53,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:51:53,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2019-11-20 00:51:53,729 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2019-11-20 00:51:53,729 INFO L343 Elim1Store]: treesize reduction 163, result has 49.7 percent of original size [2019-11-20 00:51:53,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 69 treesize of output 197 [2019-11-20 00:51:53,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:53,789 INFO L567 ElimStorePlain]: treesize reduction 114, result has 39.7 percent of original size [2019-11-20 00:51:53,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:51:53,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:75 [2019-11-20 00:51:54,206 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 56 [2019-11-20 00:51:54,207 INFO L343 Elim1Store]: treesize reduction 278, result has 38.4 percent of original size [2019-11-20 00:51:54,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 212 [2019-11-20 00:51:54,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:54,321 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-11-20 00:51:54,322 INFO L567 ElimStorePlain]: treesize reduction 114, result has 44.1 percent of original size [2019-11-20 00:51:54,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:51:54,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:94, output treesize:90 [2019-11-20 00:51:55,182 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 53 [2019-11-20 00:51:55,182 INFO L343 Elim1Store]: treesize reduction 240, result has 28.8 percent of original size [2019-11-20 00:51:55,183 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 105 treesize of output 205 [2019-11-20 00:51:55,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:55,235 INFO L567 ElimStorePlain]: treesize reduction 36, result has 71.4 percent of original size [2019-11-20 00:51:55,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:51:55,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:115, output treesize:90 [2019-11-20 00:51:55,547 INFO L343 Elim1Store]: treesize reduction 240, result has 28.8 percent of original size [2019-11-20 00:51:55,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 105 treesize of output 205 [2019-11-20 00:51:55,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:55,627 INFO L567 ElimStorePlain]: treesize reduction 168, result has 37.3 percent of original size [2019-11-20 00:51:55,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:51:55,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:115, output treesize:100 [2019-11-20 00:51:56,089 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 89 [2019-11-20 00:51:56,089 INFO L343 Elim1Store]: treesize reduction 240, result has 46.5 percent of original size [2019-11-20 00:51:56,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 126 treesize of output 333 [2019-11-20 00:51:56,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:56,176 INFO L567 ElimStorePlain]: treesize reduction 254, result has 30.4 percent of original size [2019-11-20 00:51:56,176 INFO L496 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-11-20 00:51:56,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:136, output treesize:111 [2019-11-20 00:51:56,735 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 89 [2019-11-20 00:51:56,735 INFO L343 Elim1Store]: treesize reduction 240, result has 46.5 percent of original size [2019-11-20 00:51:56,735 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 126 treesize of output 333 [2019-11-20 00:51:56,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:56,810 INFO L567 ElimStorePlain]: treesize reduction 222, result has 33.3 percent of original size [2019-11-20 00:51:56,811 INFO L496 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-11-20 00:51:56,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:136, output treesize:111 [2019-11-20 00:51:57,292 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 89 [2019-11-20 00:51:57,292 INFO L343 Elim1Store]: treesize reduction 240, result has 46.5 percent of original size [2019-11-20 00:51:57,293 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 126 treesize of output 333 [2019-11-20 00:51:57,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:57,380 INFO L567 ElimStorePlain]: treesize reduction 380, result has 24.0 percent of original size [2019-11-20 00:51:57,380 INFO L496 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-11-20 00:51:57,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:136, output treesize:120 [2019-11-20 00:51:58,026 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 129 [2019-11-20 00:51:58,026 INFO L343 Elim1Store]: treesize reduction 240, result has 58.4 percent of original size [2019-11-20 00:51:58,027 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 146 treesize of output 476 [2019-11-20 00:51:58,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:58,171 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 60 [2019-11-20 00:51:58,171 INFO L567 ElimStorePlain]: treesize reduction 608, result has 18.4 percent of original size [2019-11-20 00:51:58,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 00:51:58,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:156, output treesize:137 [2019-11-20 00:51:58,875 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 129 [2019-11-20 00:51:58,875 INFO L343 Elim1Store]: treesize reduction 240, result has 58.4 percent of original size [2019-11-20 00:51:58,876 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 152 treesize of output 478 [2019-11-20 00:51:58,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:58,986 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 60 [2019-11-20 00:51:58,986 INFO L567 ElimStorePlain]: treesize reduction 356, result has 24.9 percent of original size [2019-11-20 00:51:58,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 00:51:58,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:162, output treesize:118 [2019-11-20 00:51:59,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:51:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:51:59,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:51:59,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 33] total 67 [2019-11-20 00:51:59,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293454635] [2019-11-20 00:51:59,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-11-20 00:51:59,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:51:59,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-11-20 00:51:59,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=4214, Unknown=0, NotChecked=0, Total=4422 [2019-11-20 00:51:59,217 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 67 states. [2019-11-20 00:52:01,002 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-11-20 00:52:01,187 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-20 00:52:01,826 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-11-20 00:52:02,358 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-11-20 00:52:03,116 WARN L191 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-11-20 00:52:03,488 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-11-20 00:52:04,630 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-11-20 00:52:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:52:06,026 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2019-11-20 00:52:06,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-20 00:52:06,026 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 44 [2019-11-20 00:52:06,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:52:06,027 INFO L225 Difference]: With dead ends: 106 [2019-11-20 00:52:06,027 INFO L226 Difference]: Without dead ends: 78 [2019-11-20 00:52:06,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2599 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=479, Invalid=9223, Unknown=0, NotChecked=0, Total=9702 [2019-11-20 00:52:06,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-20 00:52:06,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2019-11-20 00:52:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-20 00:52:06,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-11-20 00:52:06,040 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 44 [2019-11-20 00:52:06,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:52:06,040 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-11-20 00:52:06,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-11-20 00:52:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-11-20 00:52:06,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 00:52:06,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:52:06,041 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:52:06,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:52:06,242 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:52:06,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:52:06,242 INFO L82 PathProgramCache]: Analyzing trace with hash 609919640, now seen corresponding path program 4 times [2019-11-20 00:52:06,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:52:06,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588020095] [2019-11-20 00:52:06,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:52:06,250 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 00:52:06,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [797449003] [2019-11-20 00:52:06,250 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:52:06,398 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 00:52:06,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:52:06,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-20 00:52:06,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:52:06,412 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 00:52:06,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:06,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:06,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:06,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-20 00:52:06,512 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 15 treesize of output 11 [2019-11-20 00:52:06,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:06,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:06,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:06,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 00:52:06,588 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:06,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2019-11-20 00:52:06,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:06,626 INFO L567 ElimStorePlain]: treesize reduction 30, result has 50.8 percent of original size [2019-11-20 00:52:06,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:06,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-20 00:52:06,806 INFO L343 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-11-20 00:52:06,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 73 [2019-11-20 00:52:06,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:06,845 INFO L567 ElimStorePlain]: treesize reduction 56, result has 34.1 percent of original size [2019-11-20 00:52:06,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:06,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:29 [2019-11-20 00:52:06,909 INFO L343 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-11-20 00:52:06,909 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 73 [2019-11-20 00:52:06,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:06,945 INFO L567 ElimStorePlain]: treesize reduction 44, result has 39.7 percent of original size [2019-11-20 00:52:06,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:06,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:29 [2019-11-20 00:52:07,026 INFO L343 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-11-20 00:52:07,026 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 73 [2019-11-20 00:52:07,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:07,058 INFO L567 ElimStorePlain]: treesize reduction 50, result has 36.7 percent of original size [2019-11-20 00:52:07,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:07,058 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:29 [2019-11-20 00:52:07,134 INFO L343 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-11-20 00:52:07,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 73 [2019-11-20 00:52:07,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:07,162 INFO L567 ElimStorePlain]: treesize reduction 50, result has 36.7 percent of original size [2019-11-20 00:52:07,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:07,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:29 [2019-11-20 00:52:07,239 INFO L343 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-11-20 00:52:07,240 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 73 [2019-11-20 00:52:07,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:07,267 INFO L567 ElimStorePlain]: treesize reduction 50, result has 36.7 percent of original size [2019-11-20 00:52:07,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:07,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:25 [2019-11-20 00:52:07,355 INFO L343 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-11-20 00:52:07,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2019-11-20 00:52:07,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:07,368 INFO L567 ElimStorePlain]: treesize reduction 25, result has 28.6 percent of original size [2019-11-20 00:52:07,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:07,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:10 [2019-11-20 00:52:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 28 proven. 89 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:52:07,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588020095] [2019-11-20 00:52:07,405 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 00:52:07,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797449003] [2019-11-20 00:52:07,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:52:07,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-11-20 00:52:07,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348638150] [2019-11-20 00:52:07,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 00:52:07,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:52:07,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 00:52:07,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-11-20 00:52:07,406 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 21 states. [2019-11-20 00:52:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:52:07,930 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2019-11-20 00:52:07,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-20 00:52:07,930 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-11-20 00:52:07,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:52:07,931 INFO L225 Difference]: With dead ends: 99 [2019-11-20 00:52:07,931 INFO L226 Difference]: Without dead ends: 90 [2019-11-20 00:52:07,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-11-20 00:52:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-20 00:52:07,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 68. [2019-11-20 00:52:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 00:52:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2019-11-20 00:52:07,943 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 44 [2019-11-20 00:52:07,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:52:07,944 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2019-11-20 00:52:07,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 00:52:07,944 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2019-11-20 00:52:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 00:52:07,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:52:07,944 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:52:08,145 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:52:08,145 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:52:08,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:52:08,145 INFO L82 PathProgramCache]: Analyzing trace with hash 188026708, now seen corresponding path program 5 times [2019-11-20 00:52:08,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:52:08,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979942572] [2019-11-20 00:52:08,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:52:08,152 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 00:52:08,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717116293] [2019-11-20 00:52:08,152 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:52:08,422 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-20 00:52:08,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:52:08,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-20 00:52:08,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:52:08,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 00:52:08,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:08,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:08,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:08,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-20 00:52:08,496 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 15 treesize of output 11 [2019-11-20 00:52:08,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:08,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:08,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:08,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 00:52:08,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:08,539 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 25 treesize of output 24 [2019-11-20 00:52:08,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:08,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:08,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:08,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-20 00:52:08,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:08,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:08,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:08,589 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-11-20 00:52:08,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:08,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:08,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:52:08,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-11-20 00:52:08,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:08,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:08,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:08,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:08,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:08,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:08,879 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-11-20 00:52:08,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:08,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:08,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:52:08,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:43 [2019-11-20 00:52:08,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:08,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:08,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:08,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:08,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:08,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:08,977 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-11-20 00:52:08,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:08,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:08,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:52:08,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:43 [2019-11-20 00:52:09,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:09,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:09,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:09,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:09,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:09,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:09,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-11-20 00:52:09,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:09,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:09,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:52:09,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:43 [2019-11-20 00:52:09,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:09,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:09,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:09,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:09,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:09,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:09,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-11-20 00:52:09,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:09,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:09,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:52:09,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:68, output treesize:39 [2019-11-20 00:52:09,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:09,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:09,339 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:09,339 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 3 case distinctions, treesize of input 31 treesize of output 13 [2019-11-20 00:52:09,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:09,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:09,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:09,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2019-11-20 00:52:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 37 proven. 75 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 00:52:09,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979942572] [2019-11-20 00:52:09,372 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 00:52:09,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717116293] [2019-11-20 00:52:09,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:52:09,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-11-20 00:52:09,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377612345] [2019-11-20 00:52:09,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 00:52:09,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:52:09,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 00:52:09,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-11-20 00:52:09,373 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 19 states. [2019-11-20 00:52:09,922 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-11-20 00:52:10,093 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-11-20 00:52:13,037 WARN L191 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-11-20 00:52:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:52:13,211 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2019-11-20 00:52:13,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 00:52:13,211 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2019-11-20 00:52:13,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:52:13,211 INFO L225 Difference]: With dead ends: 84 [2019-11-20 00:52:13,212 INFO L226 Difference]: Without dead ends: 69 [2019-11-20 00:52:13,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2019-11-20 00:52:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-20 00:52:13,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-11-20 00:52:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 00:52:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2019-11-20 00:52:13,223 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 44 [2019-11-20 00:52:13,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:52:13,223 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2019-11-20 00:52:13,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 00:52:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2019-11-20 00:52:13,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 00:52:13,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:52:13,224 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:52:13,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:52:13,424 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:52:13,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:52:13,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1319780852, now seen corresponding path program 20 times [2019-11-20 00:52:13,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:52:13,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778946373] [2019-11-20 00:52:13,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:52:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:52:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 36 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:52:13,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778946373] [2019-11-20 00:52:13,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504703863] [2019-11-20 00:52:13,626 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:52:13,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 00:52:13,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:52:13,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 00:52:13,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:52:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 49 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:52:13,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:52:13,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2019-11-20 00:52:13,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841938531] [2019-11-20 00:52:13,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-20 00:52:13,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:52:13,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-20 00:52:13,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-11-20 00:52:13,798 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 28 states. [2019-11-20 00:52:14,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:52:14,420 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2019-11-20 00:52:14,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-20 00:52:14,421 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2019-11-20 00:52:14,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:52:14,421 INFO L225 Difference]: With dead ends: 79 [2019-11-20 00:52:14,421 INFO L226 Difference]: Without dead ends: 75 [2019-11-20 00:52:14,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=429, Invalid=1463, Unknown=0, NotChecked=0, Total=1892 [2019-11-20 00:52:14,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-20 00:52:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2019-11-20 00:52:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 00:52:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-11-20 00:52:14,431 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 46 [2019-11-20 00:52:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:52:14,431 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-11-20 00:52:14,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-20 00:52:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-11-20 00:52:14,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 00:52:14,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:52:14,432 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:52:14,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:52:14,635 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:52:14,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:52:14,635 INFO L82 PathProgramCache]: Analyzing trace with hash -609786487, now seen corresponding path program 21 times [2019-11-20 00:52:14,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:52:14,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449788248] [2019-11-20 00:52:14,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:52:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:52:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 73 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:52:14,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449788248] [2019-11-20 00:52:14,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364570049] [2019-11-20 00:52:14,812 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:52:14,938 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-11-20 00:52:14,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:52:14,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 00:52:14,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:52:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 92 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:52:15,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:52:15,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2019-11-20 00:52:15,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43000123] [2019-11-20 00:52:15,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-20 00:52:15,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:52:15,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-20 00:52:15,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2019-11-20 00:52:15,093 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 28 states. [2019-11-20 00:52:15,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:52:15,330 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2019-11-20 00:52:15,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 00:52:15,330 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2019-11-20 00:52:15,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:52:15,331 INFO L225 Difference]: With dead ends: 83 [2019-11-20 00:52:15,331 INFO L226 Difference]: Without dead ends: 53 [2019-11-20 00:52:15,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=309, Invalid=951, Unknown=0, NotChecked=0, Total=1260 [2019-11-20 00:52:15,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-20 00:52:15,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-11-20 00:52:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-20 00:52:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-20 00:52:15,342 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 47 [2019-11-20 00:52:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:52:15,342 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-20 00:52:15,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-20 00:52:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-20 00:52:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 00:52:15,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:52:15,343 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:52:15,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:52:15,543 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:52:15,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:52:15,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1295219861, now seen corresponding path program 22 times [2019-11-20 00:52:15,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:52:15,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089475836] [2019-11-20 00:52:15,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:52:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:52:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:52:17,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089475836] [2019-11-20 00:52:17,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030692973] [2019-11-20 00:52:17,155 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:52:17,219 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 00:52:17,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:52:17,221 WARN L253 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 81 conjunts are in the unsatisfiable core [2019-11-20 00:52:17,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:52:17,227 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 00:52:17,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:17,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:17,241 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-11-20 00:52:17,241 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:17,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:17,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:17,248 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-20 00:52:17,302 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 23 treesize of output 22 [2019-11-20 00:52:17,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:17,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:17,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:17,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-20 00:52:17,451 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:17,451 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-11-20 00:52:17,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:17,482 INFO L567 ElimStorePlain]: treesize reduction 36, result has 55.6 percent of original size [2019-11-20 00:52:17,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:52:17,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-11-20 00:52:17,682 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:17,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 138 [2019-11-20 00:52:17,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:17,729 INFO L567 ElimStorePlain]: treesize reduction 72, result has 45.9 percent of original size [2019-11-20 00:52:17,730 INFO L496 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-11-20 00:52:17,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:61 [2019-11-20 00:52:17,973 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:17,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 220 [2019-11-20 00:52:17,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:18,040 INFO L567 ElimStorePlain]: treesize reduction 108, result has 41.6 percent of original size [2019-11-20 00:52:18,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 00:52:18,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:77 [2019-11-20 00:52:18,363 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:18,363 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 318 [2019-11-20 00:52:18,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:18,453 INFO L567 ElimStorePlain]: treesize reduction 144, result has 39.2 percent of original size [2019-11-20 00:52:18,453 INFO L496 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-11-20 00:52:18,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:93 [2019-11-20 00:52:18,878 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-11-20 00:52:18,878 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:18,879 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 432 [2019-11-20 00:52:18,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:18,989 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-11-20 00:52:18,989 INFO L567 ElimStorePlain]: treesize reduction 180, result has 37.7 percent of original size [2019-11-20 00:52:18,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 00:52:18,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:113, output treesize:109 [2019-11-20 00:52:20,002 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-11-20 00:52:20,002 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:20,002 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 562 [2019-11-20 00:52:20,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:20,142 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-11-20 00:52:20,142 INFO L567 ElimStorePlain]: treesize reduction 216, result has 36.7 percent of original size [2019-11-20 00:52:20,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-20 00:52:20,143 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:129, output treesize:125 [2019-11-20 00:52:30,339 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2019-11-20 00:52:30,339 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:30,340 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 708 [2019-11-20 00:52:30,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:30,543 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-11-20 00:52:30,543 INFO L567 ElimStorePlain]: treesize reduction 252, result has 35.9 percent of original size [2019-11-20 00:52:30,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-20 00:52:30,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:145, output treesize:141 [2019-11-20 00:53:47,342 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-20 00:53:47,342 FATAL L310 FreeRefinementEngine]: Exception during interpolant generation: SMTLIBException [2019-11-20 00:53:47,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:53:47,543 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:576) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 42 more [2019-11-20 00:53:47,547 INFO L168 Benchmark]: Toolchain (without parser) took 550427.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -99.7 MB). Peak memory consumption was 85.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:53:47,548 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:53:47,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -197.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-20 00:53:47,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:53:47,548 INFO L168 Benchmark]: Boogie Preprocessor took 30.88 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:53:47,548 INFO L168 Benchmark]: RCFGBuilder took 428.23 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-20 00:53:47,549 INFO L168 Benchmark]: TraceAbstraction took 549562.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 34.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.2 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2019-11-20 00:53:47,550 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -197.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.88 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 428.23 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 549562.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 34.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.2 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 00:53:49,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:53:49,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:53:49,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:53:49,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:53:49,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:53:49,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:53:49,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:53:49,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:53:49,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:53:49,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:53:49,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:53:49,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:53:49,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:53:49,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:53:49,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:53:49,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:53:49,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:53:49,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:53:49,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:53:49,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:53:49,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:53:49,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:53:49,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:53:49,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:53:49,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:53:49,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:53:49,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:53:49,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:53:49,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:53:49,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:53:49,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:53:49,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:53:49,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:53:49,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:53:49,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:53:49,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:53:49,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:53:49,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:53:49,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:53:49,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:53:49,347 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 00:53:49,361 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:53:49,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:53:49,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:53:49,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:53:49,363 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:53:49,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:53:49,364 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:53:49,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:53:49,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:53:49,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:53:49,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:53:49,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:53:49,365 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 00:53:49,366 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 00:53:49,366 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:53:49,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:53:49,367 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:53:49,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:53:49,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:53:49,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:53:49,368 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:53:49,368 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:53:49,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:53:49,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:53:49,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:53:49,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:53:49,369 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 00:53:49,370 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 00:53:49,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:53:49,370 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 00:53:49,370 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_ae477670-a2c6-47ac-b370-7078a9e4d812/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 -> f0c6762a510921214435f03fd1512220ceb2c5e3 [2019-11-20 00:53:49,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:53:49,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:53:49,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:53:49,699 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:53:49,699 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:53:49,700 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/../../sv-benchmarks/c/array-fpi/s4if.c [2019-11-20 00:53:49,753 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/data/9500cd300/44f0d03e0c29460bba2b4e9bfb337c2b/FLAG587e051b8 [2019-11-20 00:53:50,180 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:53:50,182 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/sv-benchmarks/c/array-fpi/s4if.c [2019-11-20 00:53:50,189 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/data/9500cd300/44f0d03e0c29460bba2b4e9bfb337c2b/FLAG587e051b8 [2019-11-20 00:53:50,567 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/data/9500cd300/44f0d03e0c29460bba2b4e9bfb337c2b [2019-11-20 00:53:50,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:53:50,570 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:53:50,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:53:50,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:53:50,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:53:50,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:53:50" (1/1) ... [2019-11-20 00:53:50,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@210ce359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:53:50, skipping insertion in model container [2019-11-20 00:53:50,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:53:50" (1/1) ... [2019-11-20 00:53:50,589 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:53:50,607 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:53:50,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:53:50,886 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:53:50,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:53:51,030 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:53:51,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:53:51 WrapperNode [2019-11-20 00:53:51,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:53:51,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:53:51,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:53:51,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:53:51,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:53:51" (1/1) ... [2019-11-20 00:53:51,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:53:51" (1/1) ... [2019-11-20 00:53:51,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:53:51,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:53:51,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:53:51,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:53:51,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:53:51" (1/1) ... [2019-11-20 00:53:51,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:53:51" (1/1) ... [2019-11-20 00:53:51,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:53:51" (1/1) ... [2019-11-20 00:53:51,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:53:51" (1/1) ... [2019-11-20 00:53:51,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:53:51" (1/1) ... [2019-11-20 00:53:51,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:53:51" (1/1) ... [2019-11-20 00:53:51,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:53:51" (1/1) ... [2019-11-20 00:53:51,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:53:51,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:53:51,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:53:51,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:53:51,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:53:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/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-11-20 00:53:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 00:53:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-11-20 00:53:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 00:53:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 00:53:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:53:51,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:53:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-11-20 00:53:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 00:53:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 00:53:51,522 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:53:51,522 INFO L285 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-20 00:53:51,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:53:51 BoogieIcfgContainer [2019-11-20 00:53:51,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:53:51,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:53:51,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:53:51,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:53:51,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:53:50" (1/3) ... [2019-11-20 00:53:51,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d03e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:53:51, skipping insertion in model container [2019-11-20 00:53:51,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:53:51" (2/3) ... [2019-11-20 00:53:51,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d03e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:53:51, skipping insertion in model container [2019-11-20 00:53:51,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:53:51" (3/3) ... [2019-11-20 00:53:51,538 INFO L109 eAbstractionObserver]: Analyzing ICFG s4if.c [2019-11-20 00:53:51,549 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:53:51,555 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:53:51,570 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:53:51,606 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:53:51,606 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:53:51,606 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:53:51,606 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:53:51,606 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:53:51,607 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:53:51,607 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:53:51,607 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:53:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-11-20 00:53:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 00:53:51,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:53:51,624 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:53:51,624 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:53:51,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:53:51,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1476218026, now seen corresponding path program 1 times [2019-11-20 00:53:51,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:53:51,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [176627536] [2019-11-20 00:53:51,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:53:51,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 00:53:51,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:53:51,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:53:51,778 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:53:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:53:51,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [176627536] [2019-11-20 00:53:51,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:53:51,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 00:53:51,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349740655] [2019-11-20 00:53:51,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 00:53:51,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:53:51,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 00:53:51,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 00:53:51,803 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-11-20 00:53:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:53:51,816 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-20 00:53:51,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 00:53:51,817 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-20 00:53:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:53:51,825 INFO L225 Difference]: With dead ends: 29 [2019-11-20 00:53:51,825 INFO L226 Difference]: Without dead ends: 13 [2019-11-20 00:53:51,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-11-20 00:53:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-20 00:53:51,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-20 00:53:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-20 00:53:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-11-20 00:53:51,859 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 9 [2019-11-20 00:53:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:53:51,859 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-20 00:53:51,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 00:53:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-11-20 00:53:51,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 00:53:51,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:53:51,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:53:52,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:52,063 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:53:52,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:53:52,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1304115419, now seen corresponding path program 1 times [2019-11-20 00:53:52,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:53:52,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1275125629] [2019-11-20 00:53:52,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:53:52,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:53:52,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:53:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:53:52,170 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:53:52,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:53:52,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1275125629] [2019-11-20 00:53:52,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:53:52,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 00:53:52,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003041396] [2019-11-20 00:53:52,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:53:52,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:53:52,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:53:52,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:53:52,187 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 4 states. [2019-11-20 00:53:52,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:53:52,322 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-11-20 00:53:52,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:53:52,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-20 00:53:52,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:53:52,324 INFO L225 Difference]: With dead ends: 23 [2019-11-20 00:53:52,324 INFO L226 Difference]: Without dead ends: 15 [2019-11-20 00:53:52,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:53:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-20 00:53:52,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-20 00:53:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-20 00:53:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-20 00:53:52,329 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-11-20 00:53:52,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:53:52,330 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-20 00:53:52,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:53:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-11-20 00:53:52,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 00:53:52,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:53:52,331 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:53:52,531 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:52,532 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:53:52,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:53:52,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1358761923, now seen corresponding path program 1 times [2019-11-20 00:53:52,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:53:52,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [760347113] [2019-11-20 00:53:52,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:53:52,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 00:53:52,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:53:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:53:52,759 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:53:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:53:52,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [760347113] [2019-11-20 00:53:52,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:53:52,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-20 00:53:52,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871462424] [2019-11-20 00:53:52,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 00:53:52,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:53:52,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 00:53:52,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:53:52,873 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 10 states. [2019-11-20 00:53:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:53:53,410 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-11-20 00:53:53,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 00:53:53,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-11-20 00:53:53,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:53:53,412 INFO L225 Difference]: With dead ends: 39 [2019-11-20 00:53:53,412 INFO L226 Difference]: Without dead ends: 32 [2019-11-20 00:53:53,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:53:53,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-20 00:53:53,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2019-11-20 00:53:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-20 00:53:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-20 00:53:53,421 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 11 [2019-11-20 00:53:53,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:53:53,422 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-20 00:53:53,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 00:53:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-20 00:53:53,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 00:53:53,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:53:53,423 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:53:53,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:53,634 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:53:53,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:53:53,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1565637502, now seen corresponding path program 1 times [2019-11-20 00:53:53,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:53:53,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [956156081] [2019-11-20 00:53:53,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:53:53,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 00:53:53,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:53:53,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 00:53:53,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:53:53,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:53,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:53:53,843 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:53:53,846 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-11-20 00:53:53,846 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:53:53,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:53,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:53:53,860 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:28 [2019-11-20 00:53:53,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:53:53,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-11-20 00:53:53,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:53:53,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:53,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:53:53,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-11-20 00:53:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:53:54,050 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:53:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 00:53:54,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [956156081] [2019-11-20 00:53:54,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:53:54,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 3] imperfect sequences [] total 6 [2019-11-20 00:53:54,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963747920] [2019-11-20 00:53:54,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 00:53:54,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:53:54,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:53:54,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:53:54,135 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 6 states. [2019-11-20 00:53:55,093 WARN L191 SmtUtils]: Spent 902.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 00:53:55,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:53:55,293 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-11-20 00:53:55,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:53:55,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-20 00:53:55,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:53:55,295 INFO L225 Difference]: With dead ends: 31 [2019-11-20 00:53:55,295 INFO L226 Difference]: Without dead ends: 22 [2019-11-20 00:53:55,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:53:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-20 00:53:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-20 00:53:55,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-20 00:53:55,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-20 00:53:55,304 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-11-20 00:53:55,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:53:55,304 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-20 00:53:55,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 00:53:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-20 00:53:55,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 00:53:55,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:53:55,306 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:53:55,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:55,508 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:53:55,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:53:55,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1508379200, now seen corresponding path program 1 times [2019-11-20 00:53:55,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:53:55,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1236194729] [2019-11-20 00:53:55,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:53:55,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:53:55,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:53:55,619 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-11-20 00:53:55,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:53:55,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:55,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:53:55,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-20 00:53:55,671 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 17 treesize of output 9 [2019-11-20 00:53:55,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:53:55,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:55,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:53:55,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-20 00:53:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:53:55,685 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:53:55,734 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 16 treesize of output 14 [2019-11-20 00:53:55,751 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2019-11-20 00:53:55,752 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:53:55,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:55,756 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:53:55,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:55,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:53:55,760 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2019-11-20 00:53:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:53:55,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1236194729] [2019-11-20 00:53:55,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:53:55,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-20 00:53:55,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957097450] [2019-11-20 00:53:55,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 00:53:55,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:53:55,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 00:53:55,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 00:53:55,791 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 9 states. [2019-11-20 00:53:55,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:53:55,929 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-11-20 00:53:55,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 00:53:55,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-11-20 00:53:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:53:55,930 INFO L225 Difference]: With dead ends: 23 [2019-11-20 00:53:55,930 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 00:53:55,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-20 00:53:55,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 00:53:55,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 00:53:55,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 00:53:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 00:53:55,932 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2019-11-20 00:53:55,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:53:55,932 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:53:55,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 00:53:55,932 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 00:53:55,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 00:53:56,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:56,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 00:53:56,517 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-11-20 00:53:56,519 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 00:53:56,519 INFO L444 ceAbstractionStarter]: For program point L27-2(lines 27 30) no Hoare annotation was computed. [2019-11-20 00:53:56,521 INFO L440 ceAbstractionStarter]: At program point L27-3(lines 27 30) the Hoare annotation is: (let ((.cse4 (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|)) (.cse5 ((_ sign_extend 32) (_ bv0 32)))) (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset)) (.cse1 (= |ULTIMATE.start_main_~#sum~0.offset| (_ bv0 32))) (.cse2 (= (select .cse4 (bvadd |ULTIMATE.start_main_~#sum~0.offset| (_ bv4 32))) ((_ extract 63 32) .cse5))) (.cse3 (= (select .cse4 |ULTIMATE.start_main_~#sum~0.offset|) ((_ extract 31 0) .cse5)))) (or (and (= (_ bv4 32) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) .cse0 (bvslt (_ bv0 32) ~N~0) .cse1 .cse2 .cse3) (and .cse0 (= (_ bv0 32) ULTIMATE.start_main_~i~0) .cse1 (not (bvsle ~N~0 (_ bv0 32))) .cse2 .cse3 (not (= ULTIMATE.start_main_~a~0.base |ULTIMATE.start_main_~#sum~0.base|)))))) [2019-11-20 00:53:56,521 INFO L444 ceAbstractionStarter]: For program point L27-4(lines 27 30) no Hoare annotation was computed. [2019-11-20 00:53:56,521 INFO L444 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-11-20 00:53:56,521 INFO L447 ceAbstractionStarter]: At program point L42(lines 16 43) the Hoare annotation is: true [2019-11-20 00:53:56,522 INFO L444 ceAbstractionStarter]: For program point L34(lines 34 38) no Hoare annotation was computed. [2019-11-20 00:53:56,522 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 00:53:56,522 INFO L444 ceAbstractionStarter]: For program point L32-2(lines 32 39) no Hoare annotation was computed. [2019-11-20 00:53:56,522 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 00:53:56,522 INFO L440 ceAbstractionStarter]: At program point L32-3(lines 32 39) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|)) (.cse1 ((_ sign_extend 32) (_ bv0 32)))) (and (= (_ bv4 32) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= |ULTIMATE.start_main_~#sum~0.offset| (_ bv0 32)) (not (bvsle ~N~0 (_ bv0 32))) (= (select .cse0 (bvadd |ULTIMATE.start_main_~#sum~0.offset| (_ bv4 32))) ((_ extract 63 32) .cse1)) (= (select .cse0 |ULTIMATE.start_main_~#sum~0.offset|) ((_ extract 31 0) .cse1)))) [2019-11-20 00:53:56,522 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 00:53:56,522 INFO L444 ceAbstractionStarter]: For program point L32-4(lines 32 39) no Hoare annotation was computed. [2019-11-20 00:53:56,523 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-20 00:53:56,523 INFO L444 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-20 00:53:56,523 INFO L444 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-11-20 00:53:56,523 INFO L444 ceAbstractionStarter]: For program point L10-3(line 10) no Hoare annotation was computed. [2019-11-20 00:53:56,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,536 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,536 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,536 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,539 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,539 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,539 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,539 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,540 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,541 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,541 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:53:56 BoogieIcfgContainer [2019-11-20 00:53:56,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:53:56,545 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:53:56,546 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:53:56,546 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:53:56,546 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:53:51" (3/4) ... [2019-11-20 00:53:56,550 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 00:53:56,561 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-20 00:53:56,561 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 00:53:56,561 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 00:53:56,614 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ae477670-a2c6-47ac-b370-7078a9e4d812/bin/uautomizer/witness.graphml [2019-11-20 00:53:56,614 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:53:56,616 INFO L168 Benchmark]: Toolchain (without parser) took 6045.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 955.0 MB in the beginning and 920.2 MB in the end (delta: 34.8 MB). Peak memory consumption was 180.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:53:56,616 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:53:56,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 459.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:53:56,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:53:56,618 INFO L168 Benchmark]: Boogie Preprocessor took 49.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:53:56,619 INFO L168 Benchmark]: RCFGBuilder took 387.31 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: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-11-20 00:53:56,619 INFO L168 Benchmark]: TraceAbstraction took 5020.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 920.2 MB in the end (delta: 196.2 MB). Peak memory consumption was 196.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:53:56,620 INFO L168 Benchmark]: Witness Printer took 68.81 ms. Allocated memory is still 1.2 GB. Free memory is still 920.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:53:56,623 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 459.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 387.31 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: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5020.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 920.2 MB in the end (delta: 196.2 MB). Peak memory consumption was 196.2 MB. Max. memory is 11.5 GB. * Witness Printer took 68.81 ms. Allocated memory is still 1.2 GB. Free memory is still 920.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant [2019-11-20 00:53:56,633 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,633 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,633 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,634 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,635 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,635 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((4bv32 == unknown-#memory_int-unknown[a][a] && 0bv32 == a) && 0bv32 == i) && sum == 0bv32) && !~bvsle32(N, 0bv32)) && unknown-#memory_int-unknown[sum][~bvadd16(sum, 4bv32)] == ~sign_extendFrom32To64(0bv32)[63:32]) && unknown-#memory_int-unknown[sum][sum] == ~sign_extendFrom32To64(0bv32)[31:0] - InvariantResult [Line: 27]: Loop Invariant [2019-11-20 00:53:56,640 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,643 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,644 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,644 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,644 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,646 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,653 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,653 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,654 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 00:53:56,654 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((4bv32 == unknown-#memory_int-unknown[a][a] && 0bv32 == a) && ~bvslt32(0bv32, N)) && sum == 0bv32) && unknown-#memory_int-unknown[sum][~bvadd16(sum, 4bv32)] == ~sign_extendFrom32To64(0bv32)[63:32]) && unknown-#memory_int-unknown[sum][sum] == ~sign_extendFrom32To64(0bv32)[31:0]) || ((((((0bv32 == a && 0bv32 == i) && sum == 0bv32) && !~bvsle32(N, 0bv32)) && unknown-#memory_int-unknown[sum][~bvadd16(sum, 4bv32)] == ~sign_extendFrom32To64(0bv32)[63:32]) && unknown-#memory_int-unknown[sum][sum] == ~sign_extendFrom32To64(0bv32)[31:0]) && !(a == sum)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Result: SAFE, OverallTime: 4.9s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 50 SDtfs, 74 SDslu, 29 SDs, 0 SdLazy, 164 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=3, 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, 5 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 8 NumberOfFragments, 118 HoareAnnotationTreeSize, 3 FomulaSimplifications, 64 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 97 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 104 ConstructedInterpolants, 5 QuantifiedInterpolants, 7240 SizeOfPredicates, 24 NumberOfNonLiveVariables, 186 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 6/10 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 correct! Received shutdown request...