./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test22-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test22-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/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 efd11941ceab8dc56d9aa56f1950f714738654ba ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:19:25,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:19:25,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:19:25,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:19:25,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:19:25,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:19:25,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:19:25,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:19:25,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:19:25,188 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:19:25,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:19:25,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:19:25,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:19:25,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:19:25,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:19:25,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:19:25,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:19:25,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:19:25,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:19:25,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:19:25,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:19:25,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:19:25,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:19:25,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:19:25,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:19:25,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:19:25,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:19:25,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:19:25,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:19:25,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:19:25,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:19:25,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:19:25,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:19:25,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:19:25,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:19:25,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:19:25,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:19:25,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:19:25,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:19:25,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:19:25,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:19:25,222 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:19:25,238 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:19:25,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:19:25,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:19:25,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:19:25,240 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:19:25,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:19:25,241 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:19:25,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:19:25,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:19:25,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:19:25,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:19:25,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:19:25,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:19:25,243 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:19:25,244 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:19:25,244 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:19:25,244 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:19:25,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:19:25,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:19:25,245 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:19:25,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:19:25,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:19:25,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:19:25,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:19:25,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:19:25,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:19:25,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:19:25,248 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:19:25,248 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_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/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 -> efd11941ceab8dc56d9aa56f1950f714738654ba [2019-11-16 00:19:25,280 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:19:25,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:19:25,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:19:25,297 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:19:25,297 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:19:25,298 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/bin/uautomizer/../../sv-benchmarks/c/ldv-regression/test22-1.c [2019-11-16 00:19:25,361 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/bin/uautomizer/data/438dec6af/7133f9db32ea41c8a1e7d3fbd1c1297d/FLAG2f8db9221 [2019-11-16 00:19:25,831 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:19:25,832 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/sv-benchmarks/c/ldv-regression/test22-1.c [2019-11-16 00:19:25,839 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/bin/uautomizer/data/438dec6af/7133f9db32ea41c8a1e7d3fbd1c1297d/FLAG2f8db9221 [2019-11-16 00:19:26,258 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/bin/uautomizer/data/438dec6af/7133f9db32ea41c8a1e7d3fbd1c1297d [2019-11-16 00:19:26,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:19:26,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:19:26,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:19:26,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:19:26,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:19:26,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:19:26" (1/1) ... [2019-11-16 00:19:26,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@519b8f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:26, skipping insertion in model container [2019-11-16 00:19:26,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:19:26" (1/1) ... [2019-11-16 00:19:26,282 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:19:26,301 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:19:26,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:19:26,575 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:19:26,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:19:26,614 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:19:26,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:26 WrapperNode [2019-11-16 00:19:26,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:19:26,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:19:26,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:19:26,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:19:26,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:26" (1/1) ... [2019-11-16 00:19:26,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:26" (1/1) ... [2019-11-16 00:19:26,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:19:26,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:19:26,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:19:26,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:19:26,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:26" (1/1) ... [2019-11-16 00:19:26,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:26" (1/1) ... [2019-11-16 00:19:26,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:26" (1/1) ... [2019-11-16 00:19:26,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:26" (1/1) ... [2019-11-16 00:19:26,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:26" (1/1) ... [2019-11-16 00:19:26,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:26" (1/1) ... [2019-11-16 00:19:26,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:26" (1/1) ... [2019-11-16 00:19:26,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:19:26,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:19:26,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:19:26,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:19:26,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/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-16 00:19:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-16 00:19:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:19:26,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:19:26,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:19:26,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:19:26,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:19:27,351 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:19:27,351 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-16 00:19:27,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:19:27 BoogieIcfgContainer [2019-11-16 00:19:27,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:19:27,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:19:27,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:19:27,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:19:27,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:19:26" (1/3) ... [2019-11-16 00:19:27,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633ce7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:19:27, skipping insertion in model container [2019-11-16 00:19:27,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:26" (2/3) ... [2019-11-16 00:19:27,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633ce7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:19:27, skipping insertion in model container [2019-11-16 00:19:27,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:19:27" (3/3) ... [2019-11-16 00:19:27,364 INFO L109 eAbstractionObserver]: Analyzing ICFG test22-1.c [2019-11-16 00:19:27,375 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:19:27,392 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:19:27,405 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:19:27,440 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:19:27,441 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:19:27,441 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:19:27,442 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:19:27,443 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:19:27,443 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:19:27,443 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:19:27,443 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:19:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-16 00:19:27,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:19:27,471 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:27,472 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:27,477 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:27,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:27,486 INFO L82 PathProgramCache]: Analyzing trace with hash 164664103, now seen corresponding path program 1 times [2019-11-16 00:19:27,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:27,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028000010] [2019-11-16 00:19:27,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:27,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:27,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:27,699 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-16 00:19:27,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028000010] [2019-11-16 00:19:27,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:27,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:27,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297404524] [2019-11-16 00:19:27,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:19:27,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:27,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:19:27,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:19:27,727 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-11-16 00:19:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:27,743 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2019-11-16 00:19:27,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:19:27,745 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-11-16 00:19:27,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:27,756 INFO L225 Difference]: With dead ends: 34 [2019-11-16 00:19:27,756 INFO L226 Difference]: Without dead ends: 21 [2019-11-16 00:19:27,760 INFO L600 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-16 00:19:27,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-16 00:19:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-16 00:19:27,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-16 00:19:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-16 00:19:27,803 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 19 [2019-11-16 00:19:27,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:27,803 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-16 00:19:27,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:19:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-16 00:19:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-16 00:19:27,804 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:27,805 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:27,805 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:27,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:27,805 INFO L82 PathProgramCache]: Analyzing trace with hash 603612068, now seen corresponding path program 1 times [2019-11-16 00:19:27,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:27,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144512601] [2019-11-16 00:19:27,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:27,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:27,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:28,122 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-16 00:19:28,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144512601] [2019-11-16 00:19:28,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:28,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:19:28,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18246936] [2019-11-16 00:19:28,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:19:28,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:28,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:19:28,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:19:28,126 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2019-11-16 00:19:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:29,065 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2019-11-16 00:19:29,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:19:29,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-16 00:19:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:29,071 INFO L225 Difference]: With dead ends: 96 [2019-11-16 00:19:29,072 INFO L226 Difference]: Without dead ends: 91 [2019-11-16 00:19:29,073 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:19:29,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-16 00:19:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 33. [2019-11-16 00:19:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-16 00:19:29,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-11-16 00:19:29,097 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2019-11-16 00:19:29,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:29,097 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-16 00:19:29,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:19:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-11-16 00:19:29,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-16 00:19:29,099 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:29,099 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:29,099 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:29,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:29,100 INFO L82 PathProgramCache]: Analyzing trace with hash -407505182, now seen corresponding path program 1 times [2019-11-16 00:19:29,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:29,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830134162] [2019-11-16 00:19:29,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:29,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:29,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:29,266 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-16 00:19:29,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830134162] [2019-11-16 00:19:29,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:29,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:19:29,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045660627] [2019-11-16 00:19:29,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:19:29,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:29,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:19:29,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:19:29,268 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 10 states. [2019-11-16 00:19:29,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:29,875 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-11-16 00:19:29,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:19:29,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-16 00:19:29,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:29,878 INFO L225 Difference]: With dead ends: 91 [2019-11-16 00:19:29,878 INFO L226 Difference]: Without dead ends: 66 [2019-11-16 00:19:29,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:19:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-16 00:19:29,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 33. [2019-11-16 00:19:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-16 00:19:29,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-16 00:19:29,900 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2019-11-16 00:19:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:29,903 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-16 00:19:29,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:19:29,903 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-16 00:19:29,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-16 00:19:29,904 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:29,904 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:29,904 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:29,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:29,905 INFO L82 PathProgramCache]: Analyzing trace with hash -984735834, now seen corresponding path program 1 times [2019-11-16 00:19:29,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:29,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344462541] [2019-11-16 00:19:29,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:29,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:29,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:30,031 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-16 00:19:30,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344462541] [2019-11-16 00:19:30,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:30,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:19:30,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99848848] [2019-11-16 00:19:30,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:19:30,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:30,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:19:30,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:19:30,034 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 10 states. [2019-11-16 00:19:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:30,614 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2019-11-16 00:19:30,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:19:30,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-16 00:19:30,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:30,616 INFO L225 Difference]: With dead ends: 81 [2019-11-16 00:19:30,616 INFO L226 Difference]: Without dead ends: 64 [2019-11-16 00:19:30,617 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:19:30,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-16 00:19:30,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 33. [2019-11-16 00:19:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-16 00:19:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-11-16 00:19:30,625 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 20 [2019-11-16 00:19:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:30,625 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-11-16 00:19:30,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:19:30,626 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-11-16 00:19:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-16 00:19:30,627 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:30,627 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:30,627 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:30,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:30,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1995853084, now seen corresponding path program 1 times [2019-11-16 00:19:30,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:30,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583312605] [2019-11-16 00:19:30,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:30,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:30,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:30,812 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-16 00:19:30,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583312605] [2019-11-16 00:19:30,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:30,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:19:30,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794756637] [2019-11-16 00:19:30,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:19:30,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:30,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:19:30,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:19:30,818 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 10 states. [2019-11-16 00:19:31,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:31,396 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-11-16 00:19:31,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:19:31,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-16 00:19:31,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:31,401 INFO L225 Difference]: With dead ends: 73 [2019-11-16 00:19:31,401 INFO L226 Difference]: Without dead ends: 68 [2019-11-16 00:19:31,402 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:19:31,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-16 00:19:31,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 26. [2019-11-16 00:19:31,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-16 00:19:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-16 00:19:31,411 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2019-11-16 00:19:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:31,412 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-16 00:19:31,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:19:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-11-16 00:19:31,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-16 00:19:31,413 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:31,413 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:31,413 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:31,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:31,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1760411593, now seen corresponding path program 1 times [2019-11-16 00:19:31,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:31,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318855218] [2019-11-16 00:19:31,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:31,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:31,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:31,708 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-16 00:19:31,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318855218] [2019-11-16 00:19:31,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309208249] [2019-11-16 00:19:31,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/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-16 00:19:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:31,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:19:31,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:31,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:19:32,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-16 00:19:32,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:32,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-16 00:19:32,047 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:32,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:32,061 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-16 00:19:32,061 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-16 00:19:32,064 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-16 00:19:32,064 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:32,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2019-11-16 00:19:32,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613465608] [2019-11-16 00:19:32,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:19:32,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:32,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:19:32,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:19:32,066 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 16 states. [2019-11-16 00:19:33,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:33,674 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-11-16 00:19:33,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-16 00:19:33,677 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-16 00:19:33,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:33,678 INFO L225 Difference]: With dead ends: 81 [2019-11-16 00:19:33,678 INFO L226 Difference]: Without dead ends: 76 [2019-11-16 00:19:33,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=356, Invalid=1450, Unknown=0, NotChecked=0, Total=1806 [2019-11-16 00:19:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-16 00:19:33,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 28. [2019-11-16 00:19:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-16 00:19:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-16 00:19:33,692 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2019-11-16 00:19:33,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:33,692 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-16 00:19:33,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:19:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-16 00:19:33,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-16 00:19:33,693 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:33,694 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:33,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:33,897 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:33,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:33,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1048225454, now seen corresponding path program 2 times [2019-11-16 00:19:33,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:33,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723720342] [2019-11-16 00:19:33,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:33,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:33,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:34,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:34,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723720342] [2019-11-16 00:19:34,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811131443] [2019-11-16 00:19:34,195 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/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-16 00:19:34,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:19:34,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:34,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:19:34,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:34,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:19:34,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-16 00:19:34,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:34,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-16 00:19:34,552 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:34,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:34,574 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-16 00:19:34,575 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-16 00:19:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:34,578 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:34,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2019-11-16 00:19:34,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249385855] [2019-11-16 00:19:34,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-16 00:19:34,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:34,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:19:34,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:19:34,583 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 18 states. [2019-11-16 00:19:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:36,594 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-11-16 00:19:36,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-16 00:19:36,596 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-11-16 00:19:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:36,597 INFO L225 Difference]: With dead ends: 89 [2019-11-16 00:19:36,597 INFO L226 Difference]: Without dead ends: 84 [2019-11-16 00:19:36,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=553, Invalid=2203, Unknown=0, NotChecked=0, Total=2756 [2019-11-16 00:19:36,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-16 00:19:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 30. [2019-11-16 00:19:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-16 00:19:36,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-16 00:19:36,614 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 24 [2019-11-16 00:19:36,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:36,616 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-16 00:19:36,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-16 00:19:36,617 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-16 00:19:36,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:19:36,619 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:36,619 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:36,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:36,823 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:36,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:36,823 INFO L82 PathProgramCache]: Analyzing trace with hash -462854061, now seen corresponding path program 3 times [2019-11-16 00:19:36,824 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:36,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849054849] [2019-11-16 00:19:36,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:36,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:36,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:37,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849054849] [2019-11-16 00:19:37,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840241869] [2019-11-16 00:19:37,196 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/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-16 00:19:37,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-16 00:19:37,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:37,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-16 00:19:37,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:37,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:19:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:19:37,830 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:37,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2019-11-16 00:19:37,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596338977] [2019-11-16 00:19:37,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-16 00:19:37,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:37,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-16 00:19:37,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2019-11-16 00:19:37,835 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 30 states. [2019-11-16 00:19:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:40,664 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-11-16 00:19:40,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-16 00:19:40,664 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 26 [2019-11-16 00:19:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:40,665 INFO L225 Difference]: With dead ends: 89 [2019-11-16 00:19:40,665 INFO L226 Difference]: Without dead ends: 44 [2019-11-16 00:19:40,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=804, Invalid=3356, Unknown=0, NotChecked=0, Total=4160 [2019-11-16 00:19:40,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-16 00:19:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2019-11-16 00:19:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-16 00:19:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-16 00:19:40,685 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2019-11-16 00:19:40,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:40,686 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-16 00:19:40,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-16 00:19:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-16 00:19:40,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:19:40,692 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:40,692 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:40,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:40,893 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:40,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:40,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1209026451, now seen corresponding path program 1 times [2019-11-16 00:19:40,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:40,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199772673] [2019-11-16 00:19:40,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:40,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:40,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:41,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199772673] [2019-11-16 00:19:41,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319873817] [2019-11-16 00:19:41,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/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-16 00:19:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:41,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:19:41,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:41,501 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-11-16 00:19:41,502 INFO L341 Elim1Store]: treesize reduction 111, result has 47.9 percent of original size [2019-11-16 00:19:41,502 INFO L375 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 3 case distinctions, treesize of input 42 treesize of output 111 [2019-11-16 00:19:41,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:41,582 INFO L567 ElimStorePlain]: treesize reduction 40, result has 64.0 percent of original size [2019-11-16 00:19:41,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:19:41,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:41,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:42, output treesize:1 [2019-11-16 00:19:41,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:19:41,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-16 00:19:41,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:41,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-16 00:19:41,803 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:41,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:41,814 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-16 00:19:41,814 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-16 00:19:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:41,818 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:41,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2019-11-16 00:19:41,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804310447] [2019-11-16 00:19:41,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-16 00:19:41,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:41,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:19:41,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:19:41,820 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 20 states. [2019-11-16 00:19:43,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:43,222 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-11-16 00:19:43,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-16 00:19:43,222 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-11-16 00:19:43,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:43,223 INFO L225 Difference]: With dead ends: 53 [2019-11-16 00:19:43,223 INFO L226 Difference]: Without dead ends: 48 [2019-11-16 00:19:43,224 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=443, Invalid=1537, Unknown=0, NotChecked=0, Total=1980 [2019-11-16 00:19:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-16 00:19:43,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 29. [2019-11-16 00:19:43,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-16 00:19:43,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-16 00:19:43,231 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-11-16 00:19:43,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:43,231 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-16 00:19:43,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-16 00:19:43,231 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-16 00:19:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:19:43,232 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:43,232 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:43,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:43,433 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:43,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:43,434 INFO L82 PathProgramCache]: Analyzing trace with hash -551918600, now seen corresponding path program 2 times [2019-11-16 00:19:43,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:43,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121769004] [2019-11-16 00:19:43,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:43,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:43,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:43,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121769004] [2019-11-16 00:19:43,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656500822] [2019-11-16 00:19:43,756 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/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-16 00:19:43,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:19:43,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:43,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-16 00:19:43,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:44,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:19:44,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-16 00:19:44,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:44,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-16 00:19:44,058 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:44,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:44,068 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-16 00:19:44,069 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-11-16 00:19:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:44,072 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:44,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2019-11-16 00:19:44,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173653853] [2019-11-16 00:19:44,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-16 00:19:44,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:44,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-16 00:19:44,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:19:44,074 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 22 states. [2019-11-16 00:19:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:45,812 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-11-16 00:19:45,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-16 00:19:45,828 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-11-16 00:19:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:45,828 INFO L225 Difference]: With dead ends: 57 [2019-11-16 00:19:45,829 INFO L226 Difference]: Without dead ends: 52 [2019-11-16 00:19:45,830 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=582, Invalid=1968, Unknown=0, NotChecked=0, Total=2550 [2019-11-16 00:19:45,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-16 00:19:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 31. [2019-11-16 00:19:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-16 00:19:45,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-11-16 00:19:45,837 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-11-16 00:19:45,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:45,837 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-11-16 00:19:45,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-16 00:19:45,837 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-11-16 00:19:45,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:19:45,838 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:45,838 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:46,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:46,039 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:46,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:46,039 INFO L82 PathProgramCache]: Analyzing trace with hash -602997987, now seen corresponding path program 3 times [2019-11-16 00:19:46,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:46,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468112221] [2019-11-16 00:19:46,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:46,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:46,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:46,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468112221] [2019-11-16 00:19:46,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109763849] [2019-11-16 00:19:46,366 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/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-16 00:19:46,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-16 00:19:46,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:46,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-16 00:19:46,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:46,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:19:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-16 00:19:46,947 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:46,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2019-11-16 00:19:46,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141333708] [2019-11-16 00:19:46,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-16 00:19:46,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:46,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-16 00:19:46,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2019-11-16 00:19:46,949 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 32 states. [2019-11-16 00:19:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:50,302 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-11-16 00:19:50,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-11-16 00:19:50,302 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 30 [2019-11-16 00:19:50,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:50,303 INFO L225 Difference]: With dead ends: 57 [2019-11-16 00:19:50,303 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:19:50,305 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1108, Invalid=4442, Unknown=0, NotChecked=0, Total=5550 [2019-11-16 00:19:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:19:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:19:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:19:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:19:50,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-11-16 00:19:50,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:50,306 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:19:50,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-16 00:19:50,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:19:50,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:19:50,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:50,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:19:50,652 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-11-16 00:19:50,767 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-11-16 00:19:51,361 WARN L191 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 175 [2019-11-16 00:19:51,510 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-11-16 00:19:51,847 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2019-11-16 00:19:52,205 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 26 [2019-11-16 00:19:53,196 WARN L191 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 35 [2019-11-16 00:19:53,233 INFO L443 ceAbstractionStarter]: For program point L35-2(lines 35 44) no Hoare annotation was computed. [2019-11-16 00:19:53,233 INFO L443 ceAbstractionStarter]: For program point L35-4(lines 35 44) no Hoare annotation was computed. [2019-11-16 00:19:53,234 INFO L439 ceAbstractionStarter]: At program point L27(lines 25 28) the Hoare annotation is: (let ((.cse10 (select (select |#memory_int| ULTIMATE.start_main_~pd2~0.base) ULTIMATE.start_main_~pd2~0.offset))) (let ((.cse0 (and (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base) (not (= |~#d1~0.base| |~#d2~0.base|)))) (.cse2 (<= .cse10 ULTIMATE.start_main_~i~0)) (.cse3 (not (= 0 ULTIMATE.start_main_~pd2~0.base))) (.cse4 (<= ULTIMATE.start_main_~i~0 .cse10)) (.cse5 (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset)) (.cse1 (= 0 |~#d1~0.offset|)) (.cse6 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse7 (= 0 ULTIMATE.start_main_~pd1~0.offset)) (.cse8 (= ULTIMATE.start_main_~pa~0.offset ULTIMATE.start_main_~pd2~0.offset)) (.cse9 (= 1 |ULTIMATE.start_check_#res|))) (or (and (and .cse0 .cse1) .cse2 (= |~#d2~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|) .cse9) (and (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse0 .cse2 .cse3 .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9)))) [2019-11-16 00:19:53,234 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-11-16 00:19:53,234 INFO L443 ceAbstractionStarter]: For program point L11(lines 11 18) no Hoare annotation was computed. [2019-11-16 00:19:53,234 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:19:53,234 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:19:53,234 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:19:53,235 INFO L446 ceAbstractionStarter]: At program point L49(lines 30 50) the Hoare annotation is: true [2019-11-16 00:19:53,235 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-11-16 00:19:53,235 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:19:53,235 INFO L439 ceAbstractionStarter]: At program point L42(lines 31 50) the Hoare annotation is: false [2019-11-16 00:19:53,235 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 38 40) no Hoare annotation was computed. [2019-11-16 00:19:53,235 INFO L439 ceAbstractionStarter]: At program point L38-3(lines 38 40) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))) (.cse2 (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset)) (.cse0 (and (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base) (not (= |~#d1~0.base| |~#d2~0.base|)) (not (= ULTIMATE.start_main_~pd1~0.base 0)))) (.cse3 (= 0 |~#d1~0.offset|)) (.cse4 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse5 (= 0 ULTIMATE.start_main_~pd1~0.offset)) (.cse6 (= ULTIMATE.start_main_~pa~0.offset ULTIMATE.start_main_~pd2~0.offset))) (or (and (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 (and (= |~#d2~0.offset| ULTIMATE.start_main_~pd1~0.offset) (and .cse0 .cse3)) .cse4 .cse5 .cse6 (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|)))) [2019-11-16 00:19:53,235 INFO L443 ceAbstractionStarter]: For program point L38-4(lines 38 40) no Hoare annotation was computed. [2019-11-16 00:19:53,236 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-16 00:19:53,236 INFO L443 ceAbstractionStarter]: For program point L22-2(line 22) no Hoare annotation was computed. [2019-11-16 00:19:53,236 INFO L439 ceAbstractionStarter]: At program point L22-3(lines 20 23) the Hoare annotation is: (let ((.cse0 (= 0 |~#d1~0.offset|)) (.cse1 (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|))) (or (and (= |~#d2~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) (= |ULTIMATE.start_get_dummy_#res.base| |~#d2~0.base|) (= 0 |~#d2~0.offset|) .cse0 (not .cse1)) (and (not (= |~#d1~0.base| |~#d2~0.base|)) (= |~#d1~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) .cse0 .cse1))) [2019-11-16 00:19:53,236 INFO L443 ceAbstractionStarter]: For program point L22-4(line 22) no Hoare annotation was computed. [2019-11-16 00:19:53,236 INFO L443 ceAbstractionStarter]: For program point L22-6(line 22) no Hoare annotation was computed. [2019-11-16 00:19:53,236 INFO L439 ceAbstractionStarter]: At program point L22-7(lines 20 23) the Hoare annotation is: (let ((.cse0 (not (= |~#d1~0.base| |~#d2~0.base|)))) (or (and (or (and (= |~#d2~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) (= |ULTIMATE.start_get_dummy_#res.offset| ULTIMATE.start_main_~pd1~0.offset) (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|) (not (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|))) (and .cse0 (= |~#d1~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|))) (= 0 |~#d1~0.offset|) (= 0 ULTIMATE.start_main_~pd1~0.offset)) (and (not (= ULTIMATE.start_main_~pd1~0.base |ULTIMATE.start_get_dummy_#res.base|)) .cse0))) [2019-11-16 00:19:53,236 INFO L443 ceAbstractionStarter]: For program point L22-8(line 22) no Hoare annotation was computed. [2019-11-16 00:19:53,236 INFO L443 ceAbstractionStarter]: For program point L22-10(line 22) no Hoare annotation was computed. [2019-11-16 00:19:53,237 INFO L439 ceAbstractionStarter]: At program point L22-11(lines 20 23) the Hoare annotation is: (let ((.cse0 (not (= |~#d1~0.base| |~#d2~0.base|)))) (or (and .cse0 (not (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base))) (and (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset) (let ((.cse1 (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|))) (or (and (not .cse1) (= |~#d2~0.offset| ULTIMATE.start_main_~pd1~0.offset) (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|)) (and .cse1 .cse0))) (= 0 |~#d1~0.offset|) (= 0 ULTIMATE.start_main_~pd1~0.offset)))) [2019-11-16 00:19:53,237 INFO L443 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-11-16 00:19:53,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,258 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,258 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,259 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,261 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,267 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,267 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:19:53 BoogieIcfgContainer [2019-11-16 00:19:53,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:19:53,273 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:19:53,274 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:19:53,274 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:19:53,274 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:19:27" (3/4) ... [2019-11-16 00:19:53,278 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:19:53,291 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-16 00:19:53,291 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:19:53,324 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((d2 == \result && \result == d2) && 0 == d2) && 0 == d1) && !(d1 == \result)) || (((!(d1 == d2) && d1 == \result) && 0 == d1) && d1 == \result) [2019-11-16 00:19:53,325 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((d2 == \result && \result == pd1) && pd1 == d2) && !(pd1 == d1)) || ((!(d1 == d2) && d1 == \result) && d1 == \result)) && 0 == d1) && 0 == pd1) || (!(pd1 == \result) && !(d1 == d2)) [2019-11-16 00:19:53,326 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((pd1 == pd2 && !(d1 == d2)) && 0 == d1) && unknown-#memory_int-unknown[pd2][pd2] <= i) && d2 == pd1) && !(0 == pd2)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && pd2 == pd1) && pd2 == pa) && 0 == pd1) && pa == pd2) && pd1 == d2) && 1 == \result) || ((((((((((pd1 == d1 && pd1 == pd2 && !(d1 == d2)) && unknown-#memory_int-unknown[pd2][pd2] <= i) && !(0 == pd2)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && pd2 == pd1) && 0 == d1) && pd2 == pa) && 0 == pd1) && pa == pd2) && 1 == \result) [2019-11-16 00:19:53,355 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_608bc634-e9f6-4a2d-89ff-c37b4a47fde1/bin/uautomizer/witness.graphml [2019-11-16 00:19:53,355 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:19:53,357 INFO L168 Benchmark]: Toolchain (without parser) took 27093.41 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 452.5 MB). Free memory was 951.5 MB in the beginning and 1.4 GB in the end (delta: -402.5 MB). Peak memory consumption was 50.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:53,357 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:19:53,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:53,358 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.76 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-16 00:19:53,358 INFO L168 Benchmark]: Boogie Preprocessor took 72.35 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-16 00:19:53,359 INFO L168 Benchmark]: RCFGBuilder took 577.82 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: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:53,360 INFO L168 Benchmark]: TraceAbstraction took 25918.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -239.2 MB). Peak memory consumption was 578.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:53,360 INFO L168 Benchmark]: Witness Printer took 81.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:53,363 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.76 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 72.35 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 577.82 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: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25918.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -239.2 MB). Peak memory consumption was 578.3 MB. Max. memory is 11.5 GB. * Witness Printer took 81.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((d2 == \result && \result == pd1) && pd1 == d2) && !(pd1 == d1)) || ((!(d1 == d2) && d1 == \result) && d1 == \result)) && 0 == d1) && 0 == pd1) || (!(pd1 == \result) && !(d1 == d2)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (!(d1 == d2) && !(pd1 == pd2)) || (((pd2 == pd1 && (((!(pd1 == d1) && d2 == pd1) && pd1 == d2) || (pd1 == d1 && !(d1 == d2)))) && 0 == d1) && 0 == pd1) - InvariantResult [Line: 25]: Loop Invariant [2019-11-16 00:19:53,375 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((((((pd1 == pd2 && !(d1 == d2)) && 0 == d1) && unknown-#memory_int-unknown[pd2][pd2] <= i) && d2 == pd1) && !(0 == pd2)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && pd2 == pd1) && pd2 == pa) && 0 == pd1) && pa == pd2) && pd1 == d2) && 1 == \result) || ((((((((((pd1 == d1 && pd1 == pd2 && !(d1 == d2)) && unknown-#memory_int-unknown[pd2][pd2] <= i) && !(0 == pd2)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && pd2 == pd1) && 0 == d1) && pd2 == pa) && 0 == pd1) && pa == pd2) && 1 == \result) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((d2 == \result && \result == d2) && 0 == d2) && 0 == d1) && !(d1 == \result)) || (((!(d1 == d2) && d1 == \result) && 0 == d1) && d1 == \result) - InvariantResult [Line: 38]: Loop Invariant [2019-11-16 00:19:53,382 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,383 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:19:53,385 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((pd1 == d1 && (pd1 == pd2 && !(d1 == d2)) && !(pd1 == 0)) && i <= unknown-#memory_int-unknown[pa][pa]) && pd2 == pd1) && 0 == d1) && pd2 == pa) && 0 == pd1) && pa == pd2) || ((((((i <= unknown-#memory_int-unknown[pa][pa] && pd2 == pd1) && d2 == pd1 && ((pd1 == pd2 && !(d1 == d2)) && !(pd1 == 0)) && 0 == d1) && pd2 == pa) && 0 == pd1) && pa == pd2) && pd1 == d2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Result: SAFE, OverallTime: 25.8s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, HoareTripleCheckerStatistics: 210 SDtfs, 1029 SDslu, 1303 SDs, 0 SdLazy, 2760 SolverSat, 404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 525 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3968 ImplicationChecksByTransitivity, 16.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 323 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 47 NumberOfFragments, 300 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1893627 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 134781 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 411 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 394 ConstructedInterpolants, 0 QuantifiedInterpolants, 65612 SizeOfPredicates, 70 NumberOfNonLiveVariables, 778 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 34/164 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...