./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/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 70388197a28bd3be848acf07d15b703eb0dba0f2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:51:55,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:51:55,041 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:51:55,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:51:55,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:51:55,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:51:55,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:51:55,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:51:55,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:51:55,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:51:55,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:51:55,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:51:55,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:51:55,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:51:55,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:51:55,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:51:55,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:51:55,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:51:55,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:51:55,085 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:51:55,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:51:55,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:51:55,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:51:55,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:51:55,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:51:55,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:51:55,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:51:55,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:51:55,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:51:55,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:51:55,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:51:55,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:51:55,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:51:55,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:51:55,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:51:55,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:51:55,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:51:55,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:51:55,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:51:55,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:51:55,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:51:55,108 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:51:55,133 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:51:55,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:51:55,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:51:55,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:51:55,135 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:51:55,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:51:55,135 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:51:55,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:51:55,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:51:55,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:51:55,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:51:55,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:51:55,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:51:55,137 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:51:55,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:51:55,137 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:51:55,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:51:55,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:51:55,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:51:55,138 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:51:55,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:51:55,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:51:55,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:51:55,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:51:55,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:51:55,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:51:55,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:51:55,139 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:51:55,139 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_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/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 -> 70388197a28bd3be848acf07d15b703eb0dba0f2 [2019-11-25 08:51:55,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:51:55,333 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:51:55,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:51:55,337 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:51:55,338 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:51:55,339 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/bin/uautomizer/../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-2.i [2019-11-25 08:51:55,400 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/bin/uautomizer/data/7714eac6c/bf7e2ac2ee3440b69b634ac8302bebc3/FLAG4e48730a7 [2019-11-25 08:51:55,899 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:51:55,900 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-2.i [2019-11-25 08:51:55,915 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/bin/uautomizer/data/7714eac6c/bf7e2ac2ee3440b69b634ac8302bebc3/FLAG4e48730a7 [2019-11-25 08:51:56,231 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/bin/uautomizer/data/7714eac6c/bf7e2ac2ee3440b69b634ac8302bebc3 [2019-11-25 08:51:56,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:51:56,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:51:56,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:51:56,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:51:56,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:51:56,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:51:56" (1/1) ... [2019-11-25 08:51:56,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@670f65fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:56, skipping insertion in model container [2019-11-25 08:51:56,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:51:56" (1/1) ... [2019-11-25 08:51:56,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:51:56,306 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:51:56,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:51:56,689 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:51:56,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:51:56,823 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:51:56,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:56 WrapperNode [2019-11-25 08:51:56,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:51:56,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:51:56,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:51:56,825 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:51:56,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:56" (1/1) ... [2019-11-25 08:51:56,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:56" (1/1) ... [2019-11-25 08:51:56,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:51:56,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:51:56,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:51:56,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:51:56,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:56" (1/1) ... [2019-11-25 08:51:56,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:56" (1/1) ... [2019-11-25 08:51:56,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:56" (1/1) ... [2019-11-25 08:51:56,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:56" (1/1) ... [2019-11-25 08:51:56,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:56" (1/1) ... [2019-11-25 08:51:56,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:56" (1/1) ... [2019-11-25 08:51:56,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:56" (1/1) ... [2019-11-25 08:51:56,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:51:56,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:51:56,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:51:56,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:51:56,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/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-25 08:51:56,990 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-11-25 08:51:56,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-11-25 08:51:56,991 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-11-25 08:51:56,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-11-25 08:51:56,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:51:56,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:51:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:51:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:51:56,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:51:56,996 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-25 08:51:57,377 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:51:57,378 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:51:57,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:51:57 BoogieIcfgContainer [2019-11-25 08:51:57,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:51:57,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:51:57,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:51:57,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:51:57,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:51:56" (1/3) ... [2019-11-25 08:51:57,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc1c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:51:57, skipping insertion in model container [2019-11-25 08:51:57,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:56" (2/3) ... [2019-11-25 08:51:57,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc1c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:51:57, skipping insertion in model container [2019-11-25 08:51:57,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:51:57" (3/3) ... [2019-11-25 08:51:57,387 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-2.i [2019-11-25 08:51:57,427 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,427 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,428 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,428 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,428 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,428 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,429 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,429 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,429 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,429 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,430 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,430 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,430 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,430 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,431 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,431 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,431 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,431 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,432 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,432 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,432 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,433 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,433 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,433 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,434 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,434 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,434 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,434 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,434 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,435 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,435 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,436 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,436 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,436 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,436 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,437 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,437 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,437 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,437 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,437 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,438 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,438 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,439 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,439 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,439 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,439 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,439 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,440 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,440 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,440 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,440 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:51:57,472 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-25 08:51:57,472 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:51:57,480 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-25 08:51:57,492 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-25 08:51:57,512 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:51:57,513 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:51:57,513 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:51:57,513 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:51:57,513 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:51:57,513 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:51:57,513 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:51:57,514 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:51:57,531 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 83 transitions [2019-11-25 08:52:01,292 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34966 states. [2019-11-25 08:52:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 34966 states. [2019-11-25 08:52:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:52:01,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:01,304 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:01,305 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:01,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:01,311 INFO L82 PathProgramCache]: Analyzing trace with hash -902852624, now seen corresponding path program 1 times [2019-11-25 08:52:01,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:01,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751406051] [2019-11-25 08:52:01,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:01,586 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-25 08:52:01,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751406051] [2019-11-25 08:52:01,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:01,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:52:01,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138770623] [2019-11-25 08:52:01,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:52:01,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:01,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:52:01,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:52:01,610 INFO L87 Difference]: Start difference. First operand 34966 states. Second operand 6 states. [2019-11-25 08:52:02,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:02,659 INFO L93 Difference]: Finished difference Result 45470 states and 184962 transitions. [2019-11-25 08:52:02,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:52:02,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-25 08:52:02,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:02,910 INFO L225 Difference]: With dead ends: 45470 [2019-11-25 08:52:02,911 INFO L226 Difference]: Without dead ends: 20819 [2019-11-25 08:52:02,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:52:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20819 states. [2019-11-25 08:52:03,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20819 to 20819. [2019-11-25 08:52:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20819 states. [2019-11-25 08:52:04,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20819 states to 20819 states and 82977 transitions. [2019-11-25 08:52:04,145 INFO L78 Accepts]: Start accepts. Automaton has 20819 states and 82977 transitions. Word has length 25 [2019-11-25 08:52:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:04,146 INFO L462 AbstractCegarLoop]: Abstraction has 20819 states and 82977 transitions. [2019-11-25 08:52:04,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:52:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 20819 states and 82977 transitions. [2019-11-25 08:52:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 08:52:04,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:04,157 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:04,158 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:04,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:04,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1950343494, now seen corresponding path program 1 times [2019-11-25 08:52:04,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:04,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970443312] [2019-11-25 08:52:04,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:04,372 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-25 08:52:04,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970443312] [2019-11-25 08:52:04,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:04,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:52:04,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281687060] [2019-11-25 08:52:04,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:52:04,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:04,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:52:04,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:52:04,375 INFO L87 Difference]: Start difference. First operand 20819 states and 82977 transitions. Second operand 8 states. [2019-11-25 08:52:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:05,357 INFO L93 Difference]: Finished difference Result 35069 states and 134196 transitions. [2019-11-25 08:52:05,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:52:05,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-25 08:52:05,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:05,486 INFO L225 Difference]: With dead ends: 35069 [2019-11-25 08:52:05,486 INFO L226 Difference]: Without dead ends: 28819 [2019-11-25 08:52:05,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:52:05,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28819 states. [2019-11-25 08:52:06,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28819 to 19249. [2019-11-25 08:52:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19249 states. [2019-11-25 08:52:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19249 states to 19249 states and 75732 transitions. [2019-11-25 08:52:06,275 INFO L78 Accepts]: Start accepts. Automaton has 19249 states and 75732 transitions. Word has length 34 [2019-11-25 08:52:06,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:06,276 INFO L462 AbstractCegarLoop]: Abstraction has 19249 states and 75732 transitions. [2019-11-25 08:52:06,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:52:06,276 INFO L276 IsEmpty]: Start isEmpty. Operand 19249 states and 75732 transitions. [2019-11-25 08:52:06,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-25 08:52:06,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:06,280 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:06,281 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:06,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:06,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1707268840, now seen corresponding path program 1 times [2019-11-25 08:52:06,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:06,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286332746] [2019-11-25 08:52:06,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:52:06,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286332746] [2019-11-25 08:52:06,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:06,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:52:06,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542488082] [2019-11-25 08:52:06,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:52:06,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:06,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:52:06,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:52:06,416 INFO L87 Difference]: Start difference. First operand 19249 states and 75732 transitions. Second operand 8 states. [2019-11-25 08:52:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:07,104 INFO L93 Difference]: Finished difference Result 31729 states and 119978 transitions. [2019-11-25 08:52:07,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:52:07,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-25 08:52:07,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:07,215 INFO L225 Difference]: With dead ends: 31729 [2019-11-25 08:52:07,216 INFO L226 Difference]: Without dead ends: 25345 [2019-11-25 08:52:07,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:52:07,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25345 states. [2019-11-25 08:52:07,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25345 to 17369. [2019-11-25 08:52:07,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17369 states. [2019-11-25 08:52:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17369 states to 17369 states and 66928 transitions. [2019-11-25 08:52:07,828 INFO L78 Accepts]: Start accepts. Automaton has 17369 states and 66928 transitions. Word has length 41 [2019-11-25 08:52:07,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:07,829 INFO L462 AbstractCegarLoop]: Abstraction has 17369 states and 66928 transitions. [2019-11-25 08:52:07,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:52:07,829 INFO L276 IsEmpty]: Start isEmpty. Operand 17369 states and 66928 transitions. [2019-11-25 08:52:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:52:07,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:07,835 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:07,836 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:07,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:07,836 INFO L82 PathProgramCache]: Analyzing trace with hash -539445418, now seen corresponding path program 1 times [2019-11-25 08:52:07,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:07,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657067021] [2019-11-25 08:52:07,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:07,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657067021] [2019-11-25 08:52:07,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969107340] [2019-11-25 08:52:07,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/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-25 08:52:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:08,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:52:08,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:08,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:52:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:08,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:52:08,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-25 08:52:08,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904306108] [2019-11-25 08:52:08,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-25 08:52:08,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:08,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 08:52:08,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-25 08:52:08,289 INFO L87 Difference]: Start difference. First operand 17369 states and 66928 transitions. Second operand 18 states. [2019-11-25 08:52:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:09,188 INFO L93 Difference]: Finished difference Result 34675 states and 128863 transitions. [2019-11-25 08:52:09,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 08:52:09,189 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-25 08:52:09,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:09,303 INFO L225 Difference]: With dead ends: 34675 [2019-11-25 08:52:09,303 INFO L226 Difference]: Without dead ends: 32095 [2019-11-25 08:52:09,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-25 08:52:09,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32095 states. [2019-11-25 08:52:10,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32095 to 16565. [2019-11-25 08:52:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16565 states. [2019-11-25 08:52:10,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16565 states to 16565 states and 63900 transitions. [2019-11-25 08:52:10,375 INFO L78 Accepts]: Start accepts. Automaton has 16565 states and 63900 transitions. Word has length 45 [2019-11-25 08:52:10,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:10,376 INFO L462 AbstractCegarLoop]: Abstraction has 16565 states and 63900 transitions. [2019-11-25 08:52:10,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-25 08:52:10,376 INFO L276 IsEmpty]: Start isEmpty. Operand 16565 states and 63900 transitions. [2019-11-25 08:52:10,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:52:10,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:10,382 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:10,598 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:10,599 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:10,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:10,599 INFO L82 PathProgramCache]: Analyzing trace with hash -548416362, now seen corresponding path program 2 times [2019-11-25 08:52:10,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:10,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583652019] [2019-11-25 08:52:10,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:52:10,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583652019] [2019-11-25 08:52:10,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:10,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 08:52:10,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364805834] [2019-11-25 08:52:10,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:52:10,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:10,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:52:10,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:52:10,709 INFO L87 Difference]: Start difference. First operand 16565 states and 63900 transitions. Second operand 10 states. [2019-11-25 08:52:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:11,229 INFO L93 Difference]: Finished difference Result 32695 states and 121435 transitions. [2019-11-25 08:52:11,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 08:52:11,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-25 08:52:11,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:11,324 INFO L225 Difference]: With dead ends: 32695 [2019-11-25 08:52:11,325 INFO L226 Difference]: Without dead ends: 29971 [2019-11-25 08:52:11,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-25 08:52:11,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29971 states. [2019-11-25 08:52:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29971 to 13517. [2019-11-25 08:52:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13517 states. [2019-11-25 08:52:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13517 states to 13517 states and 52896 transitions. [2019-11-25 08:52:11,879 INFO L78 Accepts]: Start accepts. Automaton has 13517 states and 52896 transitions. Word has length 45 [2019-11-25 08:52:11,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:11,880 INFO L462 AbstractCegarLoop]: Abstraction has 13517 states and 52896 transitions. [2019-11-25 08:52:11,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:52:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 13517 states and 52896 transitions. [2019-11-25 08:52:11,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-25 08:52:11,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:11,888 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:11,889 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:11,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:11,889 INFO L82 PathProgramCache]: Analyzing trace with hash 337207879, now seen corresponding path program 1 times [2019-11-25 08:52:11,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:11,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804740572] [2019-11-25 08:52:11,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:52:12,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804740572] [2019-11-25 08:52:12,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:12,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:52:12,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061524405] [2019-11-25 08:52:12,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:52:12,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:12,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:52:12,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:52:12,057 INFO L87 Difference]: Start difference. First operand 13517 states and 52896 transitions. Second operand 8 states. [2019-11-25 08:52:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:12,299 INFO L93 Difference]: Finished difference Result 22637 states and 85048 transitions. [2019-11-25 08:52:12,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:52:12,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-11-25 08:52:12,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:12,336 INFO L225 Difference]: With dead ends: 22637 [2019-11-25 08:52:12,337 INFO L226 Difference]: Without dead ends: 16787 [2019-11-25 08:52:12,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:52:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16787 states. [2019-11-25 08:52:12,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16787 to 12107. [2019-11-25 08:52:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12107 states. [2019-11-25 08:52:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12107 states to 12107 states and 45415 transitions. [2019-11-25 08:52:12,867 INFO L78 Accepts]: Start accepts. Automaton has 12107 states and 45415 transitions. Word has length 48 [2019-11-25 08:52:12,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:12,868 INFO L462 AbstractCegarLoop]: Abstraction has 12107 states and 45415 transitions. [2019-11-25 08:52:12,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:52:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 12107 states and 45415 transitions. [2019-11-25 08:52:12,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:52:12,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:12,883 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:12,884 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:12,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:12,884 INFO L82 PathProgramCache]: Analyzing trace with hash -297898423, now seen corresponding path program 1 times [2019-11-25 08:52:12,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:12,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382291756] [2019-11-25 08:52:12,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:12,985 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:52:12,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382291756] [2019-11-25 08:52:12,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268911537] [2019-11-25 08:52:12,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/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-25 08:52:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:13,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:52:13,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:13,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:52:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:52:13,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:52:13,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-25 08:52:13,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508829842] [2019-11-25 08:52:13,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-25 08:52:13,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:13,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 08:52:13,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-25 08:52:13,214 INFO L87 Difference]: Start difference. First operand 12107 states and 45415 transitions. Second operand 18 states. [2019-11-25 08:52:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:13,797 INFO L93 Difference]: Finished difference Result 22447 states and 81039 transitions. [2019-11-25 08:52:13,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 08:52:13,798 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-11-25 08:52:13,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:13,832 INFO L225 Difference]: With dead ends: 22447 [2019-11-25 08:52:13,832 INFO L226 Difference]: Without dead ends: 19931 [2019-11-25 08:52:13,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-25 08:52:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19931 states. [2019-11-25 08:52:14,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19931 to 12075. [2019-11-25 08:52:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12075 states. [2019-11-25 08:52:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12075 states to 12075 states and 44995 transitions. [2019-11-25 08:52:14,153 INFO L78 Accepts]: Start accepts. Automaton has 12075 states and 44995 transitions. Word has length 52 [2019-11-25 08:52:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:14,153 INFO L462 AbstractCegarLoop]: Abstraction has 12075 states and 44995 transitions. [2019-11-25 08:52:14,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-25 08:52:14,154 INFO L276 IsEmpty]: Start isEmpty. Operand 12075 states and 44995 transitions. [2019-11-25 08:52:14,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:52:14,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:14,167 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:14,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:14,370 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:14,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:14,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2054262665, now seen corresponding path program 2 times [2019-11-25 08:52:14,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:14,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733363475] [2019-11-25 08:52:14,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:52:14,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733363475] [2019-11-25 08:52:14,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:14,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 08:52:14,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905186241] [2019-11-25 08:52:14,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:52:14,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:14,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:52:14,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:52:14,506 INFO L87 Difference]: Start difference. First operand 12075 states and 44995 transitions. Second operand 10 states. [2019-11-25 08:52:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:14,939 INFO L93 Difference]: Finished difference Result 20531 states and 73675 transitions. [2019-11-25 08:52:14,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 08:52:14,939 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-25 08:52:14,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:14,969 INFO L225 Difference]: With dead ends: 20531 [2019-11-25 08:52:14,969 INFO L226 Difference]: Without dead ends: 17621 [2019-11-25 08:52:14,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-25 08:52:15,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17621 states. [2019-11-25 08:52:15,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17621 to 9225. [2019-11-25 08:52:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9225 states. [2019-11-25 08:52:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9225 states to 9225 states and 34430 transitions. [2019-11-25 08:52:15,214 INFO L78 Accepts]: Start accepts. Automaton has 9225 states and 34430 transitions. Word has length 52 [2019-11-25 08:52:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:15,215 INFO L462 AbstractCegarLoop]: Abstraction has 9225 states and 34430 transitions. [2019-11-25 08:52:15,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:52:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 9225 states and 34430 transitions. [2019-11-25 08:52:15,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:52:15,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:15,223 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:15,223 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:15,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:15,223 INFO L82 PathProgramCache]: Analyzing trace with hash 795640873, now seen corresponding path program 1 times [2019-11-25 08:52:15,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:15,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054181376] [2019-11-25 08:52:15,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:52:15,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054181376] [2019-11-25 08:52:15,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:15,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 08:52:15,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782179796] [2019-11-25 08:52:15,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:52:15,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:15,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:52:15,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:52:15,330 INFO L87 Difference]: Start difference. First operand 9225 states and 34430 transitions. Second operand 10 states. [2019-11-25 08:52:15,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:15,700 INFO L93 Difference]: Finished difference Result 16565 states and 59274 transitions. [2019-11-25 08:52:15,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-25 08:52:15,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-25 08:52:15,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:15,724 INFO L225 Difference]: With dead ends: 16565 [2019-11-25 08:52:15,724 INFO L226 Difference]: Without dead ends: 13655 [2019-11-25 08:52:15,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-25 08:52:15,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13655 states. [2019-11-25 08:52:15,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13655 to 9375. [2019-11-25 08:52:15,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9375 states. [2019-11-25 08:52:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9375 states to 9375 states and 34645 transitions. [2019-11-25 08:52:15,917 INFO L78 Accepts]: Start accepts. Automaton has 9375 states and 34645 transitions. Word has length 52 [2019-11-25 08:52:15,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:15,917 INFO L462 AbstractCegarLoop]: Abstraction has 9375 states and 34645 transitions. [2019-11-25 08:52:15,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:52:15,917 INFO L276 IsEmpty]: Start isEmpty. Operand 9375 states and 34645 transitions. [2019-11-25 08:52:15,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:52:15,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:15,925 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:15,925 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:15,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:15,926 INFO L82 PathProgramCache]: Analyzing trace with hash 844196999, now seen corresponding path program 2 times [2019-11-25 08:52:15,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:15,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703508991] [2019-11-25 08:52:15,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:52:16,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703508991] [2019-11-25 08:52:16,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:16,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 08:52:16,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708093995] [2019-11-25 08:52:16,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:52:16,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:16,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:52:16,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:52:16,046 INFO L87 Difference]: Start difference. First operand 9375 states and 34645 transitions. Second operand 10 states. [2019-11-25 08:52:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:16,493 INFO L93 Difference]: Finished difference Result 14255 states and 50473 transitions. [2019-11-25 08:52:16,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-25 08:52:16,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-25 08:52:16,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:16,514 INFO L225 Difference]: With dead ends: 14255 [2019-11-25 08:52:16,514 INFO L226 Difference]: Without dead ends: 11219 [2019-11-25 08:52:16,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-25 08:52:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11219 states. [2019-11-25 08:52:16,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11219 to 7203. [2019-11-25 08:52:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7203 states. [2019-11-25 08:52:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7203 states to 7203 states and 26359 transitions. [2019-11-25 08:52:16,669 INFO L78 Accepts]: Start accepts. Automaton has 7203 states and 26359 transitions. Word has length 52 [2019-11-25 08:52:16,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:16,670 INFO L462 AbstractCegarLoop]: Abstraction has 7203 states and 26359 transitions. [2019-11-25 08:52:16,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:52:16,670 INFO L276 IsEmpty]: Start isEmpty. Operand 7203 states and 26359 transitions. [2019-11-25 08:52:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:52:16,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:16,680 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:16,680 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:16,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:16,680 INFO L82 PathProgramCache]: Analyzing trace with hash 407355179, now seen corresponding path program 1 times [2019-11-25 08:52:16,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:16,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219076834] [2019-11-25 08:52:16,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:52:16,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219076834] [2019-11-25 08:52:16,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348218368] [2019-11-25 08:52:16,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/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-25 08:52:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:16,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:52:16,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:17,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:52:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:52:17,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:52:17,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-25 08:52:17,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998249059] [2019-11-25 08:52:17,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-25 08:52:17,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:17,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-25 08:52:17,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-25 08:52:17,121 INFO L87 Difference]: Start difference. First operand 7203 states and 26359 transitions. Second operand 22 states. [2019-11-25 08:52:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:17,880 INFO L93 Difference]: Finished difference Result 11819 states and 41675 transitions. [2019-11-25 08:52:17,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-25 08:52:17,880 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-25 08:52:17,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:17,896 INFO L225 Difference]: With dead ends: 11819 [2019-11-25 08:52:17,896 INFO L226 Difference]: Without dead ends: 10559 [2019-11-25 08:52:17,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2019-11-25 08:52:17,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2019-11-25 08:52:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 7023. [2019-11-25 08:52:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7023 states. [2019-11-25 08:52:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 25531 transitions. [2019-11-25 08:52:18,059 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 25531 transitions. Word has length 56 [2019-11-25 08:52:18,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:18,059 INFO L462 AbstractCegarLoop]: Abstraction has 7023 states and 25531 transitions. [2019-11-25 08:52:18,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-25 08:52:18,059 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 25531 transitions. [2019-11-25 08:52:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:52:18,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:18,070 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:18,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:18,274 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:18,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:18,274 INFO L82 PathProgramCache]: Analyzing trace with hash 455911305, now seen corresponding path program 2 times [2019-11-25 08:52:18,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:18,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343547593] [2019-11-25 08:52:18,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:52:18,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343547593] [2019-11-25 08:52:18,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311776705] [2019-11-25 08:52:18,429 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/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-25 08:52:18,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:52:18,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:52:18,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:52:18,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:52:18,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:52:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:52:18,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:52:18,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-25 08:52:18,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172011527] [2019-11-25 08:52:18,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-25 08:52:18,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:18,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-25 08:52:18,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-25 08:52:18,718 INFO L87 Difference]: Start difference. First operand 7023 states and 25531 transitions. Second operand 22 states. [2019-11-25 08:52:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:19,376 INFO L93 Difference]: Finished difference Result 10319 states and 36435 transitions. [2019-11-25 08:52:19,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-25 08:52:19,376 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-25 08:52:19,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:19,393 INFO L225 Difference]: With dead ends: 10319 [2019-11-25 08:52:19,393 INFO L226 Difference]: Without dead ends: 7997 [2019-11-25 08:52:19,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2019-11-25 08:52:19,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7997 states. [2019-11-25 08:52:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7997 to 5837. [2019-11-25 08:52:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5837 states. [2019-11-25 08:52:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5837 states to 5837 states and 21036 transitions. [2019-11-25 08:52:19,525 INFO L78 Accepts]: Start accepts. Automaton has 5837 states and 21036 transitions. Word has length 56 [2019-11-25 08:52:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:19,525 INFO L462 AbstractCegarLoop]: Abstraction has 5837 states and 21036 transitions. [2019-11-25 08:52:19,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-25 08:52:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5837 states and 21036 transitions. [2019-11-25 08:52:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:52:19,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:19,533 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:19,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:52:19,733 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:19,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:19,734 INFO L82 PathProgramCache]: Analyzing trace with hash 663240811, now seen corresponding path program 3 times [2019-11-25 08:52:19,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:19,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601494346] [2019-11-25 08:52:19,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:52:19,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601494346] [2019-11-25 08:52:19,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:19,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-25 08:52:19,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395588993] [2019-11-25 08:52:19,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:52:19,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:19,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:52:19,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:52:19,861 INFO L87 Difference]: Start difference. First operand 5837 states and 21036 transitions. Second operand 12 states. [2019-11-25 08:52:20,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:20,164 INFO L93 Difference]: Finished difference Result 7757 states and 27388 transitions. [2019-11-25 08:52:20,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 08:52:20,165 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-25 08:52:20,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:20,175 INFO L225 Difference]: With dead ends: 7757 [2019-11-25 08:52:20,175 INFO L226 Difference]: Without dead ends: 6497 [2019-11-25 08:52:20,176 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-11-25 08:52:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6497 states. [2019-11-25 08:52:20,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6497 to 5177. [2019-11-25 08:52:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5177 states. [2019-11-25 08:52:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5177 states to 5177 states and 18560 transitions. [2019-11-25 08:52:20,271 INFO L78 Accepts]: Start accepts. Automaton has 5177 states and 18560 transitions. Word has length 56 [2019-11-25 08:52:20,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:20,271 INFO L462 AbstractCegarLoop]: Abstraction has 5177 states and 18560 transitions. [2019-11-25 08:52:20,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:52:20,271 INFO L276 IsEmpty]: Start isEmpty. Operand 5177 states and 18560 transitions. [2019-11-25 08:52:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:52:20,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:20,278 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:20,279 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:20,279 INFO L82 PathProgramCache]: Analyzing trace with hash 641585993, now seen corresponding path program 4 times [2019-11-25 08:52:20,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:20,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553696053] [2019-11-25 08:52:20,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:20,391 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:52:20,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553696053] [2019-11-25 08:52:20,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:20,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-25 08:52:20,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350821183] [2019-11-25 08:52:20,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:52:20,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:20,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:52:20,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:52:20,392 INFO L87 Difference]: Start difference. First operand 5177 states and 18560 transitions. Second operand 12 states. [2019-11-25 08:52:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:20,688 INFO L93 Difference]: Finished difference Result 7097 states and 24912 transitions. [2019-11-25 08:52:20,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 08:52:20,688 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-25 08:52:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:20,696 INFO L225 Difference]: With dead ends: 7097 [2019-11-25 08:52:20,696 INFO L226 Difference]: Without dead ends: 5027 [2019-11-25 08:52:20,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2019-11-25 08:52:20,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2019-11-25 08:52:20,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 4187. [2019-11-25 08:52:20,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4187 states. [2019-11-25 08:52:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 14681 transitions. [2019-11-25 08:52:20,813 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 14681 transitions. Word has length 56 [2019-11-25 08:52:20,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:20,813 INFO L462 AbstractCegarLoop]: Abstraction has 4187 states and 14681 transitions. [2019-11-25 08:52:20,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:52:20,813 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 14681 transitions. [2019-11-25 08:52:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:52:20,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:20,818 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:20,818 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:20,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:20,819 INFO L82 PathProgramCache]: Analyzing trace with hash 59382823, now seen corresponding path program 5 times [2019-11-25 08:52:20,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:20,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176944638] [2019-11-25 08:52:20,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:52:20,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176944638] [2019-11-25 08:52:20,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:20,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-25 08:52:20,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616954158] [2019-11-25 08:52:20,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:52:20,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:20,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:52:20,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:52:20,942 INFO L87 Difference]: Start difference. First operand 4187 states and 14681 transitions. Second operand 12 states. [2019-11-25 08:52:21,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:21,230 INFO L93 Difference]: Finished difference Result 4787 states and 16621 transitions. [2019-11-25 08:52:21,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 08:52:21,231 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-25 08:52:21,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:21,236 INFO L225 Difference]: With dead ends: 4787 [2019-11-25 08:52:21,236 INFO L226 Difference]: Without dead ends: 3527 [2019-11-25 08:52:21,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-11-25 08:52:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3527 states. [2019-11-25 08:52:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3527 to 3527. [2019-11-25 08:52:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3527 states. [2019-11-25 08:52:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 12205 transitions. [2019-11-25 08:52:21,287 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 12205 transitions. Word has length 56 [2019-11-25 08:52:21,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:21,287 INFO L462 AbstractCegarLoop]: Abstraction has 3527 states and 12205 transitions. [2019-11-25 08:52:21,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:52:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 12205 transitions. [2019-11-25 08:52:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:52:21,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:21,291 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:21,292 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:21,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:21,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1277217831, now seen corresponding path program 6 times [2019-11-25 08:52:21,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:21,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068042161] [2019-11-25 08:52:21,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:52:21,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068042161] [2019-11-25 08:52:21,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:21,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-25 08:52:21,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047277835] [2019-11-25 08:52:21,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:52:21,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:21,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:52:21,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:52:21,401 INFO L87 Difference]: Start difference. First operand 3527 states and 12205 transitions. Second operand 12 states. [2019-11-25 08:52:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:21,584 INFO L93 Difference]: Finished difference Result 3287 states and 11381 transitions. [2019-11-25 08:52:21,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:52:21,584 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-25 08:52:21,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:21,584 INFO L225 Difference]: With dead ends: 3287 [2019-11-25 08:52:21,584 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:52:21,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-25 08:52:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:52:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:52:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:52:21,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:52:21,585 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-11-25 08:52:21,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:21,586 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:52:21,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:52:21,586 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:52:21,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:52:21,589 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-25 08:52:21,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:52:21 BasicIcfg [2019-11-25 08:52:21,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:52:21,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:52:21,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:52:21,591 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:52:21,591 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:51:57" (3/4) ... [2019-11-25 08:52:21,594 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:52:21,601 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2019-11-25 08:52:21,601 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2019-11-25 08:52:21,605 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-25 08:52:21,605 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-25 08:52:21,605 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:52:21,638 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f2a3d6b0-e1bb-4d16-bb12-a542766640ab/bin/uautomizer/witness.graphml [2019-11-25 08:52:21,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:52:21,640 INFO L168 Benchmark]: Toolchain (without parser) took 25403.71 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 942.1 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 360.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:21,640 INFO L168 Benchmark]: CDTParser took 0.22 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-25 08:52:21,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 584.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 942.1 MB in the beginning and 1.2 GB in the end (delta: -239.7 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:21,641 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:21,642 INFO L168 Benchmark]: Boogie Preprocessor took 25.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:21,642 INFO L168 Benchmark]: RCFGBuilder took 466.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:21,643 INFO L168 Benchmark]: TraceAbstraction took 24210.46 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 351.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:21,643 INFO L168 Benchmark]: Witness Printer took 47.71 ms. Allocated memory is still 2.6 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:21,645 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.22 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 584.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 942.1 MB in the beginning and 1.2 GB in the end (delta: -239.7 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 466.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24210.46 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 351.4 MB. Max. memory is 11.5 GB. * Witness Printer took 47.71 ms. Allocated memory is still 2.6 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 96 locations, 4 error locations. Result: SAFE, OverallTime: 24.0s, OverallIterations: 16, TraceHistogramMax: 3, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2462 SDtfs, 7849 SDslu, 13500 SDs, 0 SdLazy, 3663 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34966occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 86614 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 991 NumberOfCodeBlocks, 991 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 971 ConstructedInterpolants, 0 QuantifiedInterpolants, 244626 SizeOfPredicates, 36 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 128/194 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...