./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/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 18f8c11d6085f6594f0f2021411e68b8ac706f42 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 10:34:02,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:34:02,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:34:02,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:34:02,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:34:02,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:34:02,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:34:02,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:34:02,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:34:02,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:34:02,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:34:02,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:34:02,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:34:02,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:34:02,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:34:02,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:34:02,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:34:02,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:34:02,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:34:02,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:34:02,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:34:02,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:34:02,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:34:02,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:34:02,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:34:02,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:34:02,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:34:02,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:34:02,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:34:02,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:34:02,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:34:02,967 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:34:02,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:34:02,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:34:02,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:34:02,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:34:02,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:34:02,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:34:02,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:34:02,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:34:02,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:34:02,974 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 10:34:02,998 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:34:03,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:34:03,006 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:34:03,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:34:03,011 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:34:03,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:34:03,011 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:34:03,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:34:03,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:34:03,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:34:03,012 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:34:03,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:34:03,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:34:03,013 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:34:03,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:34:03,014 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:34:03,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:34:03,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:34:03,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:34:03,015 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:34:03,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:34:03,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:34:03,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:34:03,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:34:03,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:34:03,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:34:03,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:34:03,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:34:03,018 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_310c0a7c-d5fc-42b6-bf90-b133926f8abd/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 -> 18f8c11d6085f6594f0f2021411e68b8ac706f42 [2019-11-20 10:34:03,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:34:03,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:34:03,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:34:03,202 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:34:03,202 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:34:03,203 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2019-11-20 10:34:03,253 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/data/9a620b6b0/d19fc956355043298c796b28b1108ccd/FLAGf6fc01e68 [2019-11-20 10:34:03,722 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:34:03,723 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2019-11-20 10:34:03,736 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/data/9a620b6b0/d19fc956355043298c796b28b1108ccd/FLAGf6fc01e68 [2019-11-20 10:34:04,229 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/data/9a620b6b0/d19fc956355043298c796b28b1108ccd [2019-11-20 10:34:04,231 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:34:04,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:34:04,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:34:04,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:34:04,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:34:04,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:34:04" (1/1) ... [2019-11-20 10:34:04,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ec64bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:04, skipping insertion in model container [2019-11-20 10:34:04,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:34:04" (1/1) ... [2019-11-20 10:34:04,253 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:34:04,305 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:34:04,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:34:04,667 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:34:04,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:34:04,801 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:34:04,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:04 WrapperNode [2019-11-20 10:34:04,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:34:04,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:34:04,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:34:04,802 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:34:04,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:04" (1/1) ... [2019-11-20 10:34:04,824 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:04" (1/1) ... [2019-11-20 10:34:04,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:34:04,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:34:04,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:34:04,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:34:04,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:04" (1/1) ... [2019-11-20 10:34:04,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:04" (1/1) ... [2019-11-20 10:34:04,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:04" (1/1) ... [2019-11-20 10:34:04,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:04" (1/1) ... [2019-11-20 10:34:04,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:04" (1/1) ... [2019-11-20 10:34:04,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:04" (1/1) ... [2019-11-20 10:34:04,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:04" (1/1) ... [2019-11-20 10:34:04,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:34:04,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:34:04,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:34:04,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:34:04,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:34:04,923 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-11-20 10:34:04,923 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-11-20 10:34:04,923 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-11-20 10:34:04,923 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-11-20 10:34:04,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 10:34:04,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 10:34:04,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 10:34:04,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:34:04,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:34:04,925 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-20 10:34:05,209 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:34:05,209 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 10:34:05,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:34:05 BoogieIcfgContainer [2019-11-20 10:34:05,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:34:05,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:34:05,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:34:05,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:34:05,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:34:04" (1/3) ... [2019-11-20 10:34:05,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3598dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:34:05, skipping insertion in model container [2019-11-20 10:34:05,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:04" (2/3) ... [2019-11-20 10:34:05,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3598dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:34:05, skipping insertion in model container [2019-11-20 10:34:05,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:34:05" (3/3) ... [2019-11-20 10:34:05,216 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2019-11-20 10:34:05,256 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,256 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,256 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,256 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,257 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,257 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,257 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,257 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,258 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,258 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,258 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,258 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork4_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,258 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork4_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,259 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork4_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,259 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,259 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,259 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,260 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,260 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork2_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,260 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork2_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,260 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork2_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,261 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,261 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,261 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,261 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,262 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork5___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,262 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork5___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,262 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork5___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,262 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork5___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,263 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork5___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,263 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork5___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,263 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,264 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,264 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,264 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,264 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork3___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,264 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork3___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,265 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork3___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,265 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork3___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,265 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork3___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,265 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork3___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,266 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,266 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,266 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,266 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,266 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,267 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,267 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,267 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,267 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,268 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-20 10:34:05,321 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-20 10:34:05,322 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:34:05,330 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-20 10:34:05,340 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-20 10:34:05,355 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:34:05,355 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:34:05,355 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:34:05,355 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:34:05,355 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:34:05,355 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:34:05,355 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:34:05,356 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:34:05,365 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 83 transitions [2019-11-20 10:34:36,955 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 138880 states. [2019-11-20 10:34:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 138880 states. [2019-11-20 10:34:36,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 10:34:36,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:34:36,968 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-20 10:34:36,969 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:34:36,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:34:36,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1169103728, now seen corresponding path program 1 times [2019-11-20 10:34:36,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:34:36,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99580595] [2019-11-20 10:34:36,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:34:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:34:37,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:34:37,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99580595] [2019-11-20 10:34:37,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:34:37,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:34:37,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338721826] [2019-11-20 10:34:37,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:34:37,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:34:37,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:34:37,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:34:37,249 INFO L87 Difference]: Start difference. First operand 138880 states. Second operand 6 states. [2019-11-20 10:34:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:34:38,329 INFO L93 Difference]: Finished difference Result 151484 states and 599630 transitions. [2019-11-20 10:34:38,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 10:34:38,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-20 10:34:38,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:34:38,912 INFO L225 Difference]: With dead ends: 151484 [2019-11-20 10:34:38,912 INFO L226 Difference]: Without dead ends: 98641 [2019-11-20 10:34:38,914 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-20 10:34:39,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98641 states. [2019-11-20 10:34:42,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98641 to 98641. [2019-11-20 10:34:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98641 states. [2019-11-20 10:34:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98641 states to 98641 states and 387003 transitions. [2019-11-20 10:34:42,955 INFO L78 Accepts]: Start accepts. Automaton has 98641 states and 387003 transitions. Word has length 25 [2019-11-20 10:34:42,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:34:42,956 INFO L462 AbstractCegarLoop]: Abstraction has 98641 states and 387003 transitions. [2019-11-20 10:34:42,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:34:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 98641 states and 387003 transitions. [2019-11-20 10:34:42,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 10:34:42,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:34:42,962 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-20 10:34:42,963 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:34:42,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:34:42,963 INFO L82 PathProgramCache]: Analyzing trace with hash -15348943, now seen corresponding path program 1 times [2019-11-20 10:34:42,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:34:42,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235889828] [2019-11-20 10:34:42,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:34:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:34:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:34:43,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235889828] [2019-11-20 10:34:43,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:34:43,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:34:43,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892171339] [2019-11-20 10:34:43,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:34:43,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:34:43,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:34:43,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:34:43,076 INFO L87 Difference]: Start difference. First operand 98641 states and 387003 transitions. Second operand 6 states. [2019-11-20 10:34:43,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:34:43,824 INFO L93 Difference]: Finished difference Result 104705 states and 406098 transitions. [2019-11-20 10:34:43,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 10:34:43,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-20 10:34:43,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:34:44,049 INFO L225 Difference]: With dead ends: 104705 [2019-11-20 10:34:44,050 INFO L226 Difference]: Without dead ends: 89260 [2019-11-20 10:34:44,050 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-20 10:34:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89260 states. [2019-11-20 10:34:52,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89260 to 89260. [2019-11-20 10:34:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89260 states. [2019-11-20 10:34:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89260 states to 89260 states and 345999 transitions. [2019-11-20 10:34:53,153 INFO L78 Accepts]: Start accepts. Automaton has 89260 states and 345999 transitions. Word has length 25 [2019-11-20 10:34:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:34:53,154 INFO L462 AbstractCegarLoop]: Abstraction has 89260 states and 345999 transitions. [2019-11-20 10:34:53,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:34:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 89260 states and 345999 transitions. [2019-11-20 10:34:53,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 10:34:53,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:34:53,156 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-20 10:34:53,156 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:34:53,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:34:53,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1138405842, now seen corresponding path program 1 times [2019-11-20 10:34:53,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:34:53,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326612556] [2019-11-20 10:34:53,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:34:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:34:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:34:53,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326612556] [2019-11-20 10:34:53,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:34:53,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:34:53,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916181651] [2019-11-20 10:34:53,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:34:53,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:34:53,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:34:53,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:34:53,237 INFO L87 Difference]: Start difference. First operand 89260 states and 345999 transitions. Second operand 6 states. [2019-11-20 10:34:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:34:53,736 INFO L93 Difference]: Finished difference Result 95324 states and 365094 transitions. [2019-11-20 10:34:53,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 10:34:53,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-20 10:34:53,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:34:54,001 INFO L225 Difference]: With dead ends: 95324 [2019-11-20 10:34:54,002 INFO L226 Difference]: Without dead ends: 79879 [2019-11-20 10:34:54,002 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-20 10:34:54,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79879 states. [2019-11-20 10:34:55,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79879 to 79879. [2019-11-20 10:34:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79879 states. [2019-11-20 10:34:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79879 states to 79879 states and 304995 transitions. [2019-11-20 10:34:56,856 INFO L78 Accepts]: Start accepts. Automaton has 79879 states and 304995 transitions. Word has length 25 [2019-11-20 10:34:56,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:34:56,857 INFO L462 AbstractCegarLoop]: Abstraction has 79879 states and 304995 transitions. [2019-11-20 10:34:56,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:34:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 79879 states and 304995 transitions. [2019-11-20 10:34:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 10:34:56,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:34:56,863 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-20 10:34:56,863 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:34:56,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:34:56,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1003050420, now seen corresponding path program 1 times [2019-11-20 10:34:56,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:34:56,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58321727] [2019-11-20 10:34:56,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:34:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:34:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:34:56,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58321727] [2019-11-20 10:34:56,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:34:56,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 10:34:56,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273003669] [2019-11-20 10:34:56,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 10:34:56,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:34:56,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:34:56,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:34:56,978 INFO L87 Difference]: Start difference. First operand 79879 states and 304995 transitions. Second operand 8 states. [2019-11-20 10:34:57,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:34:57,702 INFO L93 Difference]: Finished difference Result 120499 states and 451455 transitions. [2019-11-20 10:34:57,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 10:34:57,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 10:34:57,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:34:57,996 INFO L225 Difference]: With dead ends: 120499 [2019-11-20 10:34:57,996 INFO L226 Difference]: Without dead ends: 113465 [2019-11-20 10:34:57,997 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-20 10:34:58,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113465 states. [2019-11-20 10:34:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113465 to 77825. [2019-11-20 10:34:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77825 states. [2019-11-20 10:34:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77825 states to 77825 states and 295958 transitions. [2019-11-20 10:34:59,897 INFO L78 Accepts]: Start accepts. Automaton has 77825 states and 295958 transitions. Word has length 34 [2019-11-20 10:34:59,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:34:59,898 INFO L462 AbstractCegarLoop]: Abstraction has 77825 states and 295958 transitions. [2019-11-20 10:34:59,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 10:34:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 77825 states and 295958 transitions. [2019-11-20 10:34:59,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 10:34:59,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:34:59,901 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-20 10:34:59,902 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:34:59,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:34:59,902 INFO L82 PathProgramCache]: Analyzing trace with hash 844060691, now seen corresponding path program 1 times [2019-11-20 10:34:59,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:34:59,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725958511] [2019-11-20 10:34:59,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:34:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:00,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725958511] [2019-11-20 10:35:00,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:00,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 10:35:00,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401449936] [2019-11-20 10:35:00,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 10:35:00,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:00,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:35:00,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:35:00,031 INFO L87 Difference]: Start difference. First operand 77825 states and 295958 transitions. Second operand 8 states. [2019-11-20 10:35:00,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:00,762 INFO L93 Difference]: Finished difference Result 116615 states and 435295 transitions. [2019-11-20 10:35:00,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 10:35:00,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 10:35:00,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:02,372 INFO L225 Difference]: With dead ends: 116615 [2019-11-20 10:35:02,372 INFO L226 Difference]: Without dead ends: 109261 [2019-11-20 10:35:02,373 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-20 10:35:02,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109261 states. [2019-11-20 10:35:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109261 to 75215. [2019-11-20 10:35:03,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75215 states. [2019-11-20 10:35:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75215 states to 75215 states and 284763 transitions. [2019-11-20 10:35:03,989 INFO L78 Accepts]: Start accepts. Automaton has 75215 states and 284763 transitions. Word has length 34 [2019-11-20 10:35:03,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:03,989 INFO L462 AbstractCegarLoop]: Abstraction has 75215 states and 284763 transitions. [2019-11-20 10:35:03,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 10:35:03,990 INFO L276 IsEmpty]: Start isEmpty. Operand 75215 states and 284763 transitions. [2019-11-20 10:35:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 10:35:03,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:03,993 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-20 10:35:03,994 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:03,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:03,994 INFO L82 PathProgramCache]: Analyzing trace with hash 572499634, now seen corresponding path program 1 times [2019-11-20 10:35:03,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:03,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986727549] [2019-11-20 10:35:03,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:04,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:04,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986727549] [2019-11-20 10:35:04,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:04,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 10:35:04,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144420936] [2019-11-20 10:35:04,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 10:35:04,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:04,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:35:04,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:35:04,092 INFO L87 Difference]: Start difference. First operand 75215 states and 284763 transitions. Second operand 8 states. [2019-11-20 10:35:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:04,811 INFO L93 Difference]: Finished difference Result 112055 states and 416505 transitions. [2019-11-20 10:35:04,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 10:35:04,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 10:35:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:05,109 INFO L225 Difference]: With dead ends: 112055 [2019-11-20 10:35:05,109 INFO L226 Difference]: Without dead ends: 104291 [2019-11-20 10:35:05,110 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-20 10:35:05,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104291 states. [2019-11-20 10:35:06,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104291 to 71839. [2019-11-20 10:35:06,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71839 states. [2019-11-20 10:35:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71839 states to 71839 states and 270749 transitions. [2019-11-20 10:35:07,822 INFO L78 Accepts]: Start accepts. Automaton has 71839 states and 270749 transitions. Word has length 34 [2019-11-20 10:35:07,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:07,822 INFO L462 AbstractCegarLoop]: Abstraction has 71839 states and 270749 transitions. [2019-11-20 10:35:07,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 10:35:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 71839 states and 270749 transitions. [2019-11-20 10:35:07,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 10:35:07,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:07,826 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-20 10:35:07,826 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:07,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:07,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1133662853, now seen corresponding path program 1 times [2019-11-20 10:35:07,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:07,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035307264] [2019-11-20 10:35:07,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:07,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035307264] [2019-11-20 10:35:07,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:07,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 10:35:07,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820420404] [2019-11-20 10:35:07,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 10:35:07,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:07,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:35:07,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:35:07,943 INFO L87 Difference]: Start difference. First operand 71839 states and 270749 transitions. Second operand 8 states. [2019-11-20 10:35:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:08,568 INFO L93 Difference]: Finished difference Result 107111 states and 396439 transitions. [2019-11-20 10:35:08,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 10:35:08,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 10:35:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:08,795 INFO L225 Difference]: With dead ends: 107111 [2019-11-20 10:35:08,795 INFO L226 Difference]: Without dead ends: 100077 [2019-11-20 10:35:08,796 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-20 10:35:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100077 states. [2019-11-20 10:35:10,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100077 to 69785. [2019-11-20 10:35:10,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69785 states. [2019-11-20 10:35:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69785 states to 69785 states and 261712 transitions. [2019-11-20 10:35:10,321 INFO L78 Accepts]: Start accepts. Automaton has 69785 states and 261712 transitions. Word has length 34 [2019-11-20 10:35:10,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:10,322 INFO L462 AbstractCegarLoop]: Abstraction has 69785 states and 261712 transitions. [2019-11-20 10:35:10,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 10:35:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 69785 states and 261712 transitions. [2019-11-20 10:35:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 10:35:10,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:10,325 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-20 10:35:10,325 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:10,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:10,326 INFO L82 PathProgramCache]: Analyzing trace with hash -357142042, now seen corresponding path program 1 times [2019-11-20 10:35:10,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:10,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946443349] [2019-11-20 10:35:10,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:10,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946443349] [2019-11-20 10:35:10,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:10,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 10:35:10,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622535391] [2019-11-20 10:35:10,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 10:35:10,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:10,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:35:10,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:35:10,413 INFO L87 Difference]: Start difference. First operand 69785 states and 261712 transitions. Second operand 8 states. [2019-11-20 10:35:10,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:10,986 INFO L93 Difference]: Finished difference Result 103227 states and 380279 transitions. [2019-11-20 10:35:10,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 10:35:10,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 10:35:10,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:11,187 INFO L225 Difference]: With dead ends: 103227 [2019-11-20 10:35:11,187 INFO L226 Difference]: Without dead ends: 95873 [2019-11-20 10:35:11,188 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-20 10:35:11,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95873 states. [2019-11-20 10:35:13,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95873 to 67175. [2019-11-20 10:35:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67175 states. [2019-11-20 10:35:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67175 states to 67175 states and 250517 transitions. [2019-11-20 10:35:13,298 INFO L78 Accepts]: Start accepts. Automaton has 67175 states and 250517 transitions. Word has length 34 [2019-11-20 10:35:13,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:13,298 INFO L462 AbstractCegarLoop]: Abstraction has 67175 states and 250517 transitions. [2019-11-20 10:35:13,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 10:35:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 67175 states and 250517 transitions. [2019-11-20 10:35:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 10:35:13,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:13,302 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-20 10:35:13,302 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:13,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:13,303 INFO L82 PathProgramCache]: Analyzing trace with hash -185600217, now seen corresponding path program 1 times [2019-11-20 10:35:13,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:13,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545648879] [2019-11-20 10:35:13,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:13,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545648879] [2019-11-20 10:35:13,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:13,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 10:35:13,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241160402] [2019-11-20 10:35:13,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 10:35:13,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:13,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:35:13,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:35:13,391 INFO L87 Difference]: Start difference. First operand 67175 states and 250517 transitions. Second operand 8 states. [2019-11-20 10:35:13,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:13,952 INFO L93 Difference]: Finished difference Result 98667 states and 361489 transitions. [2019-11-20 10:35:13,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 10:35:13,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 10:35:13,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:14,136 INFO L225 Difference]: With dead ends: 98667 [2019-11-20 10:35:14,136 INFO L226 Difference]: Without dead ends: 90903 [2019-11-20 10:35:14,136 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-20 10:35:14,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90903 states. [2019-11-20 10:35:15,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90903 to 63799. [2019-11-20 10:35:15,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63799 states. [2019-11-20 10:35:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63799 states to 63799 states and 236503 transitions. [2019-11-20 10:35:15,554 INFO L78 Accepts]: Start accepts. Automaton has 63799 states and 236503 transitions. Word has length 34 [2019-11-20 10:35:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:15,554 INFO L462 AbstractCegarLoop]: Abstraction has 63799 states and 236503 transitions. [2019-11-20 10:35:15,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 10:35:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 63799 states and 236503 transitions. [2019-11-20 10:35:15,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 10:35:15,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:15,557 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-20 10:35:15,557 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:15,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:15,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1365288342, now seen corresponding path program 1 times [2019-11-20 10:35:15,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:15,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755213725] [2019-11-20 10:35:15,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:15,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:15,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755213725] [2019-11-20 10:35:15,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:15,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 10:35:15,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285096331] [2019-11-20 10:35:15,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 10:35:15,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:15,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:35:15,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:35:15,640 INFO L87 Difference]: Start difference. First operand 63799 states and 236503 transitions. Second operand 8 states. [2019-11-20 10:35:16,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:16,182 INFO L93 Difference]: Finished difference Result 93723 states and 341423 transitions. [2019-11-20 10:35:16,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 10:35:16,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 10:35:16,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:16,363 INFO L225 Difference]: With dead ends: 93723 [2019-11-20 10:35:16,364 INFO L226 Difference]: Without dead ends: 86689 [2019-11-20 10:35:16,364 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-20 10:35:16,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86689 states. [2019-11-20 10:35:18,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86689 to 61745. [2019-11-20 10:35:18,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61745 states. [2019-11-20 10:35:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61745 states to 61745 states and 227466 transitions. [2019-11-20 10:35:18,166 INFO L78 Accepts]: Start accepts. Automaton has 61745 states and 227466 transitions. Word has length 34 [2019-11-20 10:35:18,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:18,166 INFO L462 AbstractCegarLoop]: Abstraction has 61745 states and 227466 transitions. [2019-11-20 10:35:18,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 10:35:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 61745 states and 227466 transitions. [2019-11-20 10:35:18,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 10:35:18,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:18,169 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-20 10:35:18,170 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:18,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:18,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1206298613, now seen corresponding path program 1 times [2019-11-20 10:35:18,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:18,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718279011] [2019-11-20 10:35:18,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:18,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718279011] [2019-11-20 10:35:18,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:18,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 10:35:18,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483823209] [2019-11-20 10:35:18,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 10:35:18,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:18,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:35:18,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:35:18,245 INFO L87 Difference]: Start difference. First operand 61745 states and 227466 transitions. Second operand 8 states. [2019-11-20 10:35:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:18,757 INFO L93 Difference]: Finished difference Result 89839 states and 325263 transitions. [2019-11-20 10:35:18,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 10:35:18,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 10:35:18,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:18,926 INFO L225 Difference]: With dead ends: 89839 [2019-11-20 10:35:18,927 INFO L226 Difference]: Without dead ends: 82485 [2019-11-20 10:35:18,927 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-20 10:35:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82485 states. [2019-11-20 10:35:20,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82485 to 59135. [2019-11-20 10:35:20,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59135 states. [2019-11-20 10:35:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59135 states to 59135 states and 216271 transitions. [2019-11-20 10:35:20,160 INFO L78 Accepts]: Start accepts. Automaton has 59135 states and 216271 transitions. Word has length 34 [2019-11-20 10:35:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:20,160 INFO L462 AbstractCegarLoop]: Abstraction has 59135 states and 216271 transitions. [2019-11-20 10:35:20,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 10:35:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 59135 states and 216271 transitions. [2019-11-20 10:35:20,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 10:35:20,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:20,162 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-20 10:35:20,162 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:20,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash 934737556, now seen corresponding path program 1 times [2019-11-20 10:35:20,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:20,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633324817] [2019-11-20 10:35:20,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:20,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633324817] [2019-11-20 10:35:20,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:20,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 10:35:20,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154904255] [2019-11-20 10:35:20,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 10:35:20,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:20,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:35:20,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:35:20,257 INFO L87 Difference]: Start difference. First operand 59135 states and 216271 transitions. Second operand 8 states. [2019-11-20 10:35:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:20,865 INFO L93 Difference]: Finished difference Result 85279 states and 306473 transitions. [2019-11-20 10:35:20,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 10:35:20,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-20 10:35:20,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:21,027 INFO L225 Difference]: With dead ends: 85279 [2019-11-20 10:35:21,027 INFO L226 Difference]: Without dead ends: 77515 [2019-11-20 10:35:21,028 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-20 10:35:21,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77515 states. [2019-11-20 10:35:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77515 to 55759. [2019-11-20 10:35:22,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55759 states. [2019-11-20 10:35:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55759 states to 55759 states and 202257 transitions. [2019-11-20 10:35:22,635 INFO L78 Accepts]: Start accepts. Automaton has 55759 states and 202257 transitions. Word has length 34 [2019-11-20 10:35:22,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:22,635 INFO L462 AbstractCegarLoop]: Abstraction has 55759 states and 202257 transitions. [2019-11-20 10:35:22,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 10:35:22,635 INFO L276 IsEmpty]: Start isEmpty. Operand 55759 states and 202257 transitions. [2019-11-20 10:35:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:22,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:22,652 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-20 10:35:22,653 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:22,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:22,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1533512390, now seen corresponding path program 1 times [2019-11-20 10:35:22,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:22,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803200417] [2019-11-20 10:35:22,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:22,753 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-20 10:35:22,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803200417] [2019-11-20 10:35:22,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:22,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 10:35:22,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864404807] [2019-11-20 10:35:22,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:35:22,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:22,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:35:22,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:35:22,755 INFO L87 Difference]: Start difference. First operand 55759 states and 202257 transitions. Second operand 10 states. [2019-11-20 10:35:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:23,476 INFO L93 Difference]: Finished difference Result 100843 states and 357569 transitions. [2019-11-20 10:35:23,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:35:23,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 10:35:23,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:23,666 INFO L225 Difference]: With dead ends: 100843 [2019-11-20 10:35:23,667 INFO L226 Difference]: Without dead ends: 97907 [2019-11-20 10:35:23,667 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-20 10:35:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97907 states. [2019-11-20 10:35:24,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97907 to 55255. [2019-11-20 10:35:24,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55255 states. [2019-11-20 10:35:24,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55255 states to 55255 states and 200141 transitions. [2019-11-20 10:35:24,956 INFO L78 Accepts]: Start accepts. Automaton has 55255 states and 200141 transitions. Word has length 45 [2019-11-20 10:35:24,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:24,957 INFO L462 AbstractCegarLoop]: Abstraction has 55255 states and 200141 transitions. [2019-11-20 10:35:24,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:35:24,957 INFO L276 IsEmpty]: Start isEmpty. Operand 55255 states and 200141 transitions. [2019-11-20 10:35:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:24,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:24,973 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-20 10:35:24,973 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:24,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:24,973 INFO L82 PathProgramCache]: Analyzing trace with hash -566900026, now seen corresponding path program 2 times [2019-11-20 10:35:24,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:24,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729026134] [2019-11-20 10:35:24,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:25,081 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-20 10:35:25,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729026134] [2019-11-20 10:35:25,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:25,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 10:35:25,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065622932] [2019-11-20 10:35:25,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:35:25,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:25,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:35:25,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:35:25,083 INFO L87 Difference]: Start difference. First operand 55255 states and 200141 transitions. Second operand 10 states. [2019-11-20 10:35:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:25,807 INFO L93 Difference]: Finished difference Result 98627 states and 349325 transitions. [2019-11-20 10:35:25,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:35:25,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 10:35:25,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:25,988 INFO L225 Difference]: With dead ends: 98627 [2019-11-20 10:35:25,989 INFO L226 Difference]: Without dead ends: 95547 [2019-11-20 10:35:25,989 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-20 10:35:26,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95547 states. [2019-11-20 10:35:27,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95547 to 52387. [2019-11-20 10:35:27,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52387 states. [2019-11-20 10:35:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52387 states to 52387 states and 189697 transitions. [2019-11-20 10:35:27,663 INFO L78 Accepts]: Start accepts. Automaton has 52387 states and 189697 transitions. Word has length 45 [2019-11-20 10:35:27,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:27,663 INFO L462 AbstractCegarLoop]: Abstraction has 52387 states and 189697 transitions. [2019-11-20 10:35:27,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:35:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 52387 states and 189697 transitions. [2019-11-20 10:35:27,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:27,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:27,679 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-20 10:35:27,679 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:27,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:27,680 INFO L82 PathProgramCache]: Analyzing trace with hash 924938725, now seen corresponding path program 1 times [2019-11-20 10:35:27,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:27,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123331208] [2019-11-20 10:35:27,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:27,790 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-20 10:35:27,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123331208] [2019-11-20 10:35:27,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:27,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 10:35:27,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529033060] [2019-11-20 10:35:27,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:35:27,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:27,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:35:27,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:35:27,792 INFO L87 Difference]: Start difference. First operand 52387 states and 189697 transitions. Second operand 10 states. [2019-11-20 10:35:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:28,473 INFO L93 Difference]: Finished difference Result 93303 states and 330561 transitions. [2019-11-20 10:35:28,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:35:28,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 10:35:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:28,645 INFO L225 Difference]: With dead ends: 93303 [2019-11-20 10:35:28,645 INFO L226 Difference]: Without dead ends: 89847 [2019-11-20 10:35:28,645 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-20 10:35:28,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89847 states. [2019-11-20 10:35:29,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89847 to 51035. [2019-11-20 10:35:29,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51035 states. [2019-11-20 10:35:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51035 states to 51035 states and 184911 transitions. [2019-11-20 10:35:29,815 INFO L78 Accepts]: Start accepts. Automaton has 51035 states and 184911 transitions. Word has length 45 [2019-11-20 10:35:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:29,815 INFO L462 AbstractCegarLoop]: Abstraction has 51035 states and 184911 transitions. [2019-11-20 10:35:29,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:35:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 51035 states and 184911 transitions. [2019-11-20 10:35:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:29,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:29,830 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-20 10:35:29,830 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:29,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:29,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2144267803, now seen corresponding path program 2 times [2019-11-20 10:35:29,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:29,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841131857] [2019-11-20 10:35:29,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:29,924 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-20 10:35:29,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841131857] [2019-11-20 10:35:29,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:29,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 10:35:29,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459456509] [2019-11-20 10:35:29,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:35:29,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:29,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:35:29,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:35:29,926 INFO L87 Difference]: Start difference. First operand 51035 states and 184911 transitions. Second operand 10 states. [2019-11-20 10:35:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:30,585 INFO L93 Difference]: Finished difference Result 90447 states and 320171 transitions. [2019-11-20 10:35:30,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:35:30,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 10:35:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:30,751 INFO L225 Difference]: With dead ends: 90447 [2019-11-20 10:35:30,751 INFO L226 Difference]: Without dead ends: 87367 [2019-11-20 10:35:30,752 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-20 10:35:31,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87367 states. [2019-11-20 10:35:32,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87367 to 48435. [2019-11-20 10:35:32,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48435 states. [2019-11-20 10:35:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48435 states to 48435 states and 175495 transitions. [2019-11-20 10:35:32,282 INFO L78 Accepts]: Start accepts. Automaton has 48435 states and 175495 transitions. Word has length 45 [2019-11-20 10:35:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:32,283 INFO L462 AbstractCegarLoop]: Abstraction has 48435 states and 175495 transitions. [2019-11-20 10:35:32,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:35:32,283 INFO L276 IsEmpty]: Start isEmpty. Operand 48435 states and 175495 transitions. [2019-11-20 10:35:32,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:32,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:32,297 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-20 10:35:32,298 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:32,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:32,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2036743062, now seen corresponding path program 1 times [2019-11-20 10:35:32,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:32,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430807355] [2019-11-20 10:35:32,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:32,394 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-20 10:35:32,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430807355] [2019-11-20 10:35:32,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679739249] [2019-11-20 10:35:32,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:35:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:32,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 10:35:32,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:35:32,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:35:32,672 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-20 10:35:32,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:35:32,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-20 10:35:32,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233494784] [2019-11-20 10:35:32,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 10:35:32,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:32,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 10:35:32,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-20 10:35:32,674 INFO L87 Difference]: Start difference. First operand 48435 states and 175495 transitions. Second operand 18 states. [2019-11-20 10:35:33,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:33,681 INFO L93 Difference]: Finished difference Result 86191 states and 305095 transitions. [2019-11-20 10:35:33,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:35:33,682 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-20 10:35:33,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:34,026 INFO L225 Difference]: With dead ends: 86191 [2019-11-20 10:35:34,026 INFO L226 Difference]: Without dead ends: 82735 [2019-11-20 10:35:34,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-20 10:35:34,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82735 states. [2019-11-20 10:35:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82735 to 48423. [2019-11-20 10:35:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48423 states. [2019-11-20 10:35:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48423 states to 48423 states and 175133 transitions. [2019-11-20 10:35:35,375 INFO L78 Accepts]: Start accepts. Automaton has 48423 states and 175133 transitions. Word has length 45 [2019-11-20 10:35:35,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:35,376 INFO L462 AbstractCegarLoop]: Abstraction has 48423 states and 175133 transitions. [2019-11-20 10:35:35,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 10:35:35,376 INFO L276 IsEmpty]: Start isEmpty. Operand 48423 states and 175133 transitions. [2019-11-20 10:35:35,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:35,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:35,413 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-20 10:35:35,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:35:35,620 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:35,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:35,620 INFO L82 PathProgramCache]: Analyzing trace with hash -347985400, now seen corresponding path program 2 times [2019-11-20 10:35:35,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:35,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098178406] [2019-11-20 10:35:35,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:35,756 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-20 10:35:35,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098178406] [2019-11-20 10:35:35,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:35,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 10:35:35,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773168338] [2019-11-20 10:35:35,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:35:35,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:35,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:35:35,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:35:35,758 INFO L87 Difference]: Start difference. First operand 48423 states and 175133 transitions. Second operand 10 states. [2019-11-20 10:35:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:36,377 INFO L93 Difference]: Finished difference Result 83215 states and 294293 transitions. [2019-11-20 10:35:36,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:35:36,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 10:35:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:36,555 INFO L225 Difference]: With dead ends: 83215 [2019-11-20 10:35:36,555 INFO L226 Difference]: Without dead ends: 79615 [2019-11-20 10:35:36,556 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-20 10:35:36,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79615 states. [2019-11-20 10:35:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79615 to 45511. [2019-11-20 10:35:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45511 states. [2019-11-20 10:35:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45511 states to 45511 states and 164655 transitions. [2019-11-20 10:35:38,013 INFO L78 Accepts]: Start accepts. Automaton has 45511 states and 164655 transitions. Word has length 45 [2019-11-20 10:35:38,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:38,013 INFO L462 AbstractCegarLoop]: Abstraction has 45511 states and 164655 transitions. [2019-11-20 10:35:38,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:35:38,013 INFO L276 IsEmpty]: Start isEmpty. Operand 45511 states and 164655 transitions. [2019-11-20 10:35:38,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:38,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:38,024 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-20 10:35:38,024 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:38,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:38,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1272339493, now seen corresponding path program 1 times [2019-11-20 10:35:38,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:38,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153342968] [2019-11-20 10:35:38,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:38,150 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-20 10:35:38,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153342968] [2019-11-20 10:35:38,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:38,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 10:35:38,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768739578] [2019-11-20 10:35:38,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:35:38,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:38,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:35:38,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:35:38,153 INFO L87 Difference]: Start difference. First operand 45511 states and 164655 transitions. Second operand 10 states. [2019-11-20 10:35:38,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:38,957 INFO L93 Difference]: Finished difference Result 79735 states and 281847 transitions. [2019-11-20 10:35:38,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:35:38,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 10:35:38,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:39,149 INFO L225 Difference]: With dead ends: 79735 [2019-11-20 10:35:39,149 INFO L226 Difference]: Without dead ends: 76799 [2019-11-20 10:35:39,150 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-20 10:35:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76799 states. [2019-11-20 10:35:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76799 to 45007. [2019-11-20 10:35:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45007 states. [2019-11-20 10:35:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45007 states to 45007 states and 162539 transitions. [2019-11-20 10:35:40,321 INFO L78 Accepts]: Start accepts. Automaton has 45007 states and 162539 transitions. Word has length 45 [2019-11-20 10:35:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:40,321 INFO L462 AbstractCegarLoop]: Abstraction has 45007 states and 162539 transitions. [2019-11-20 10:35:40,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:35:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 45007 states and 162539 transitions. [2019-11-20 10:35:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:40,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:40,334 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-20 10:35:40,335 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:40,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:40,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1293994311, now seen corresponding path program 2 times [2019-11-20 10:35:40,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:40,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073380976] [2019-11-20 10:35:40,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:40,443 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-20 10:35:40,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073380976] [2019-11-20 10:35:40,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:40,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 10:35:40,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254496072] [2019-11-20 10:35:40,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:35:40,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:40,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:35:40,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:35:40,445 INFO L87 Difference]: Start difference. First operand 45007 states and 162539 transitions. Second operand 10 states. [2019-11-20 10:35:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:41,085 INFO L93 Difference]: Finished difference Result 77519 states and 273603 transitions. [2019-11-20 10:35:41,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:35:41,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 10:35:41,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:41,222 INFO L225 Difference]: With dead ends: 77519 [2019-11-20 10:35:41,222 INFO L226 Difference]: Without dead ends: 74439 [2019-11-20 10:35:41,223 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-20 10:35:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74439 states. [2019-11-20 10:35:42,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74439 to 42139. [2019-11-20 10:35:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42139 states. [2019-11-20 10:35:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42139 states to 42139 states and 152095 transitions. [2019-11-20 10:35:42,132 INFO L78 Accepts]: Start accepts. Automaton has 42139 states and 152095 transitions. Word has length 45 [2019-11-20 10:35:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:42,132 INFO L462 AbstractCegarLoop]: Abstraction has 42139 states and 152095 transitions. [2019-11-20 10:35:42,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:35:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 42139 states and 152095 transitions. [2019-11-20 10:35:42,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:42,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:42,145 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-20 10:35:42,145 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:42,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:42,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1336713372, now seen corresponding path program 1 times [2019-11-20 10:35:42,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:42,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600674853] [2019-11-20 10:35:42,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:42,593 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-11-20 10:35:42,641 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-20 10:35:42,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600674853] [2019-11-20 10:35:42,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:42,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 10:35:42,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939495019] [2019-11-20 10:35:42,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:35:42,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:42,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:35:42,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:35:42,642 INFO L87 Difference]: Start difference. First operand 42139 states and 152095 transitions. Second operand 10 states. [2019-11-20 10:35:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:43,209 INFO L93 Difference]: Finished difference Result 72195 states and 254839 transitions. [2019-11-20 10:35:43,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:35:43,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 10:35:43,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:43,338 INFO L225 Difference]: With dead ends: 72195 [2019-11-20 10:35:43,338 INFO L226 Difference]: Without dead ends: 68739 [2019-11-20 10:35:43,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-20 10:35:43,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68739 states. [2019-11-20 10:35:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68739 to 40787. [2019-11-20 10:35:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40787 states. [2019-11-20 10:35:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40787 states to 40787 states and 147309 transitions. [2019-11-20 10:35:44,212 INFO L78 Accepts]: Start accepts. Automaton has 40787 states and 147309 transitions. Word has length 45 [2019-11-20 10:35:44,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:44,212 INFO L462 AbstractCegarLoop]: Abstraction has 40787 states and 147309 transitions. [2019-11-20 10:35:44,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:35:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 40787 states and 147309 transitions. [2019-11-20 10:35:44,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:44,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:44,222 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-20 10:35:44,222 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:44,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:44,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1385269498, now seen corresponding path program 2 times [2019-11-20 10:35:44,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:44,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14866620] [2019-11-20 10:35:44,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:44,330 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-20 10:35:44,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14866620] [2019-11-20 10:35:44,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:44,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 10:35:44,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399155740] [2019-11-20 10:35:44,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:35:44,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:44,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:35:44,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:35:44,331 INFO L87 Difference]: Start difference. First operand 40787 states and 147309 transitions. Second operand 10 states. [2019-11-20 10:35:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:44,987 INFO L93 Difference]: Finished difference Result 69339 states and 244449 transitions. [2019-11-20 10:35:44,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:35:44,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 10:35:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:45,120 INFO L225 Difference]: With dead ends: 69339 [2019-11-20 10:35:45,120 INFO L226 Difference]: Without dead ends: 66259 [2019-11-20 10:35:45,124 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-20 10:35:45,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66259 states. [2019-11-20 10:35:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66259 to 38187. [2019-11-20 10:35:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38187 states. [2019-11-20 10:35:45,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38187 states to 38187 states and 137893 transitions. [2019-11-20 10:35:45,971 INFO L78 Accepts]: Start accepts. Automaton has 38187 states and 137893 transitions. Word has length 45 [2019-11-20 10:35:45,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:45,971 INFO L462 AbstractCegarLoop]: Abstraction has 38187 states and 137893 transitions. [2019-11-20 10:35:45,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:35:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand 38187 states and 137893 transitions. [2019-11-20 10:35:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:45,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:45,983 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-20 10:35:45,983 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:45,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:45,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1138199401, now seen corresponding path program 1 times [2019-11-20 10:35:45,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:45,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100082337] [2019-11-20 10:35:45,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:46,063 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-20 10:35:46,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100082337] [2019-11-20 10:35:46,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390054059] [2019-11-20 10:35:46,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:35:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:46,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 10:35:46,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:35:46,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:35:46,348 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-20 10:35:46,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:35:46,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-20 10:35:46,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146952065] [2019-11-20 10:35:46,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 10:35:46,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:46,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 10:35:46,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-20 10:35:46,351 INFO L87 Difference]: Start difference. First operand 38187 states and 137893 transitions. Second operand 18 states. [2019-11-20 10:35:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:47,186 INFO L93 Difference]: Finished difference Result 65083 states and 229373 transitions. [2019-11-20 10:35:47,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:35:47,187 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-20 10:35:47,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:47,300 INFO L225 Difference]: With dead ends: 65083 [2019-11-20 10:35:47,301 INFO L226 Difference]: Without dead ends: 61627 [2019-11-20 10:35:47,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-20 10:35:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61627 states. [2019-11-20 10:35:48,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61627 to 38175. [2019-11-20 10:35:48,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38175 states. [2019-11-20 10:35:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38175 states to 38175 states and 137531 transitions. [2019-11-20 10:35:48,495 INFO L78 Accepts]: Start accepts. Automaton has 38175 states and 137531 transitions. Word has length 45 [2019-11-20 10:35:48,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:48,495 INFO L462 AbstractCegarLoop]: Abstraction has 38175 states and 137531 transitions. [2019-11-20 10:35:48,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 10:35:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 38175 states and 137531 transitions. [2019-11-20 10:35:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:48,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:48,508 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-20 10:35:48,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:35:48,712 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:48,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:48,712 INFO L82 PathProgramCache]: Analyzing trace with hash -326319431, now seen corresponding path program 2 times [2019-11-20 10:35:48,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:48,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128091199] [2019-11-20 10:35:48,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:48,825 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-20 10:35:48,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128091199] [2019-11-20 10:35:48,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:48,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 10:35:48,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844378266] [2019-11-20 10:35:48,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:35:48,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:48,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:35:48,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:35:48,830 INFO L87 Difference]: Start difference. First operand 38175 states and 137531 transitions. Second operand 10 states. [2019-11-20 10:35:49,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:49,350 INFO L93 Difference]: Finished difference Result 62107 states and 218571 transitions. [2019-11-20 10:35:49,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:35:49,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 10:35:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:49,458 INFO L225 Difference]: With dead ends: 62107 [2019-11-20 10:35:49,458 INFO L226 Difference]: Without dead ends: 58507 [2019-11-20 10:35:49,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-20 10:35:49,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58507 states. [2019-11-20 10:35:50,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58507 to 35263. [2019-11-20 10:35:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35263 states. [2019-11-20 10:35:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35263 states to 35263 states and 127053 transitions. [2019-11-20 10:35:50,216 INFO L78 Accepts]: Start accepts. Automaton has 35263 states and 127053 transitions. Word has length 45 [2019-11-20 10:35:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:50,216 INFO L462 AbstractCegarLoop]: Abstraction has 35263 states and 127053 transitions. [2019-11-20 10:35:50,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:35:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 35263 states and 127053 transitions. [2019-11-20 10:35:50,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:50,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:50,225 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-20 10:35:50,225 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:50,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:50,226 INFO L82 PathProgramCache]: Analyzing trace with hash -262692856, now seen corresponding path program 1 times [2019-11-20 10:35:50,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:50,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193989709] [2019-11-20 10:35:50,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:50,301 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-20 10:35:50,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193989709] [2019-11-20 10:35:50,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:50,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 10:35:50,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136930570] [2019-11-20 10:35:50,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:35:50,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:50,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:35:50,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:35:50,304 INFO L87 Difference]: Start difference. First operand 35263 states and 127053 transitions. Second operand 10 states. [2019-11-20 10:35:50,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:50,899 INFO L93 Difference]: Finished difference Result 58627 states and 206125 transitions. [2019-11-20 10:35:50,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:35:50,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 10:35:50,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:51,009 INFO L225 Difference]: With dead ends: 58627 [2019-11-20 10:35:51,009 INFO L226 Difference]: Without dead ends: 55691 [2019-11-20 10:35:51,010 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-20 10:35:51,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55691 states. [2019-11-20 10:35:51,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55691 to 34759. [2019-11-20 10:35:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34759 states. [2019-11-20 10:35:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34759 states to 34759 states and 124937 transitions. [2019-11-20 10:35:51,740 INFO L78 Accepts]: Start accepts. Automaton has 34759 states and 124937 transitions. Word has length 45 [2019-11-20 10:35:51,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:51,741 INFO L462 AbstractCegarLoop]: Abstraction has 34759 states and 124937 transitions. [2019-11-20 10:35:51,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:35:51,741 INFO L276 IsEmpty]: Start isEmpty. Operand 34759 states and 124937 transitions. [2019-11-20 10:35:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:51,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:51,749 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-20 10:35:51,749 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:51,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:51,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1931862024, now seen corresponding path program 2 times [2019-11-20 10:35:51,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:51,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033904355] [2019-11-20 10:35:51,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:51,878 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-20 10:35:51,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033904355] [2019-11-20 10:35:51,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:51,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 10:35:51,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214794928] [2019-11-20 10:35:51,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:35:51,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:51,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:35:51,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:35:51,880 INFO L87 Difference]: Start difference. First operand 34759 states and 124937 transitions. Second operand 10 states. [2019-11-20 10:35:52,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:52,401 INFO L93 Difference]: Finished difference Result 56411 states and 197881 transitions. [2019-11-20 10:35:52,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:35:52,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 10:35:52,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:52,518 INFO L225 Difference]: With dead ends: 56411 [2019-11-20 10:35:52,518 INFO L226 Difference]: Without dead ends: 53331 [2019-11-20 10:35:52,519 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-20 10:35:52,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53331 states. [2019-11-20 10:35:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53331 to 31891. [2019-11-20 10:35:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31891 states. [2019-11-20 10:35:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31891 states to 31891 states and 114493 transitions. [2019-11-20 10:35:53,209 INFO L78 Accepts]: Start accepts. Automaton has 31891 states and 114493 transitions. Word has length 45 [2019-11-20 10:35:53,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:53,210 INFO L462 AbstractCegarLoop]: Abstraction has 31891 states and 114493 transitions. [2019-11-20 10:35:53,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:35:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 31891 states and 114493 transitions. [2019-11-20 10:35:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:53,218 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:53,218 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-20 10:35:53,218 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:53,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:53,219 INFO L82 PathProgramCache]: Analyzing trace with hash -871266521, now seen corresponding path program 1 times [2019-11-20 10:35:53,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:53,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248424615] [2019-11-20 10:35:53,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:53,309 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-20 10:35:53,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248424615] [2019-11-20 10:35:53,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:53,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 10:35:53,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27499555] [2019-11-20 10:35:53,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:35:53,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:53,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:35:53,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:35:53,310 INFO L87 Difference]: Start difference. First operand 31891 states and 114493 transitions. Second operand 10 states. [2019-11-20 10:35:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:54,137 INFO L93 Difference]: Finished difference Result 51087 states and 179117 transitions. [2019-11-20 10:35:54,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:35:54,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 10:35:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:54,246 INFO L225 Difference]: With dead ends: 51087 [2019-11-20 10:35:54,246 INFO L226 Difference]: Without dead ends: 47631 [2019-11-20 10:35:54,247 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-20 10:35:54,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47631 states. [2019-11-20 10:35:54,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47631 to 30539. [2019-11-20 10:35:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30539 states. [2019-11-20 10:35:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30539 states to 30539 states and 109707 transitions. [2019-11-20 10:35:54,905 INFO L78 Accepts]: Start accepts. Automaton has 30539 states and 109707 transitions. Word has length 45 [2019-11-20 10:35:54,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:54,905 INFO L462 AbstractCegarLoop]: Abstraction has 30539 states and 109707 transitions. [2019-11-20 10:35:54,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:35:54,905 INFO L276 IsEmpty]: Start isEmpty. Operand 30539 states and 109707 transitions. [2019-11-20 10:35:54,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:54,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:54,913 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-20 10:35:54,913 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:54,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:54,914 INFO L82 PathProgramCache]: Analyzing trace with hash 354494247, now seen corresponding path program 2 times [2019-11-20 10:35:54,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:54,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803098961] [2019-11-20 10:35:54,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:54,988 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-20 10:35:54,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803098961] [2019-11-20 10:35:54,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:54,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 10:35:54,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477007851] [2019-11-20 10:35:54,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:35:54,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:54,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:35:54,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:35:54,990 INFO L87 Difference]: Start difference. First operand 30539 states and 109707 transitions. Second operand 10 states. [2019-11-20 10:35:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:55,554 INFO L93 Difference]: Finished difference Result 48231 states and 168727 transitions. [2019-11-20 10:35:55,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:35:55,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 10:35:55,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:55,658 INFO L225 Difference]: With dead ends: 48231 [2019-11-20 10:35:55,658 INFO L226 Difference]: Without dead ends: 45151 [2019-11-20 10:35:55,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-20 10:35:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45151 states. [2019-11-20 10:35:56,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45151 to 27939. [2019-11-20 10:35:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27939 states. [2019-11-20 10:35:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27939 states to 27939 states and 100291 transitions. [2019-11-20 10:35:56,461 INFO L78 Accepts]: Start accepts. Automaton has 27939 states and 100291 transitions. Word has length 45 [2019-11-20 10:35:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:56,462 INFO L462 AbstractCegarLoop]: Abstraction has 27939 states and 100291 transitions. [2019-11-20 10:35:56,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:35:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 27939 states and 100291 transitions. [2019-11-20 10:35:56,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:56,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:56,474 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-20 10:35:56,475 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:56,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:56,477 INFO L82 PathProgramCache]: Analyzing trace with hash 462018988, now seen corresponding path program 1 times [2019-11-20 10:35:56,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:56,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348836471] [2019-11-20 10:35:56,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:56,593 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-20 10:35:56,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348836471] [2019-11-20 10:35:56,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267637317] [2019-11-20 10:35:56,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:35:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:56,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 10:35:56,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:35:56,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:35:56,822 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-20 10:35:56,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:35:56,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-20 10:35:56,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145480202] [2019-11-20 10:35:56,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 10:35:56,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:56,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 10:35:56,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-20 10:35:56,824 INFO L87 Difference]: Start difference. First operand 27939 states and 100291 transitions. Second operand 18 states. [2019-11-20 10:35:57,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:57,506 INFO L93 Difference]: Finished difference Result 43975 states and 153651 transitions. [2019-11-20 10:35:57,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 10:35:57,506 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-20 10:35:57,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:57,577 INFO L225 Difference]: With dead ends: 43975 [2019-11-20 10:35:57,577 INFO L226 Difference]: Without dead ends: 40519 [2019-11-20 10:35:57,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2019-11-20 10:35:57,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40519 states. [2019-11-20 10:35:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40519 to 27927. [2019-11-20 10:35:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27927 states. [2019-11-20 10:35:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27927 states to 27927 states and 99929 transitions. [2019-11-20 10:35:58,122 INFO L78 Accepts]: Start accepts. Automaton has 27927 states and 99929 transitions. Word has length 45 [2019-11-20 10:35:58,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:58,122 INFO L462 AbstractCegarLoop]: Abstraction has 27927 states and 99929 transitions. [2019-11-20 10:35:58,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 10:35:58,123 INFO L276 IsEmpty]: Start isEmpty. Operand 27927 states and 99929 transitions. [2019-11-20 10:35:58,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:35:58,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:58,130 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-20 10:35:58,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:35:58,331 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:58,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:58,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2144190646, now seen corresponding path program 2 times [2019-11-20 10:35:58,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:58,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902743019] [2019-11-20 10:35:58,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:58,407 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-20 10:35:58,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902743019] [2019-11-20 10:35:58,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:35:58,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 10:35:58,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576977785] [2019-11-20 10:35:58,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:35:58,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:58,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:35:58,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:35:58,409 INFO L87 Difference]: Start difference. First operand 27927 states and 99929 transitions. Second operand 10 states. [2019-11-20 10:35:58,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:35:58,930 INFO L93 Difference]: Finished difference Result 40999 states and 142849 transitions. [2019-11-20 10:35:58,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 10:35:58,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-20 10:35:58,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:35:58,999 INFO L225 Difference]: With dead ends: 40999 [2019-11-20 10:35:58,999 INFO L226 Difference]: Without dead ends: 37399 [2019-11-20 10:35:59,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-20 10:35:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37399 states. [2019-11-20 10:35:59,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37399 to 25015. [2019-11-20 10:35:59,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25015 states. [2019-11-20 10:35:59,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25015 states to 25015 states and 89451 transitions. [2019-11-20 10:35:59,499 INFO L78 Accepts]: Start accepts. Automaton has 25015 states and 89451 transitions. Word has length 45 [2019-11-20 10:35:59,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:35:59,499 INFO L462 AbstractCegarLoop]: Abstraction has 25015 states and 89451 transitions. [2019-11-20 10:35:59,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:35:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 25015 states and 89451 transitions. [2019-11-20 10:35:59,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:35:59,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:35:59,524 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-20 10:35:59,524 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:35:59,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:59,524 INFO L82 PathProgramCache]: Analyzing trace with hash 974093843, now seen corresponding path program 1 times [2019-11-20 10:35:59,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:35:59,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034766434] [2019-11-20 10:35:59,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:35:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:59,656 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 10:35:59,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034766434] [2019-11-20 10:35:59,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312475087] [2019-11-20 10:35:59,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:35:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:59,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 10:35:59,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:35:59,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:35:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 10:35:59,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:35:59,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-20 10:35:59,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912097630] [2019-11-20 10:35:59,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 10:35:59,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:35:59,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 10:35:59,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-20 10:35:59,931 INFO L87 Difference]: Start difference. First operand 25015 states and 89451 transitions. Second operand 22 states. [2019-11-20 10:36:00,510 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-11-20 10:36:00,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:00,885 INFO L93 Difference]: Finished difference Result 39679 states and 137887 transitions. [2019-11-20 10:36:00,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 10:36:00,885 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-20 10:36:00,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:00,948 INFO L225 Difference]: With dead ends: 39679 [2019-11-20 10:36:00,948 INFO L226 Difference]: Without dead ends: 38335 [2019-11-20 10:36:00,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 10:36:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38335 states. [2019-11-20 10:36:01,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38335 to 24807. [2019-11-20 10:36:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24807 states. [2019-11-20 10:36:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24807 states to 24807 states and 88511 transitions. [2019-11-20 10:36:01,443 INFO L78 Accepts]: Start accepts. Automaton has 24807 states and 88511 transitions. Word has length 56 [2019-11-20 10:36:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:01,443 INFO L462 AbstractCegarLoop]: Abstraction has 24807 states and 88511 transitions. [2019-11-20 10:36:01,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 10:36:01,444 INFO L276 IsEmpty]: Start isEmpty. Operand 24807 states and 88511 transitions. [2019-11-20 10:36:01,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:01,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:36:01,467 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-20 10:36:01,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:36:01,670 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:36:01,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:36:01,670 INFO L82 PathProgramCache]: Analyzing trace with hash -2095112685, now seen corresponding path program 2 times [2019-11-20 10:36:01,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:36:01,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368881574] [2019-11-20 10:36:01,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:36:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 10:36:01,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368881574] [2019-11-20 10:36:01,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852455827] [2019-11-20 10:36:01,779 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:36:01,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 10:36:01,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:36:01,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 10:36:01,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:36:02,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:36:02,056 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 10:36:02,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:36:02,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-20 10:36:02,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794189268] [2019-11-20 10:36:02,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 10:36:02,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:36:02,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 10:36:02,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-20 10:36:02,058 INFO L87 Difference]: Start difference. First operand 24807 states and 88511 transitions. Second operand 22 states. [2019-11-20 10:36:02,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:02,994 INFO L93 Difference]: Finished difference Result 38095 states and 132395 transitions. [2019-11-20 10:36:02,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 10:36:02,994 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-20 10:36:02,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:03,054 INFO L225 Difference]: With dead ends: 38095 [2019-11-20 10:36:03,054 INFO L226 Difference]: Without dead ends: 35647 [2019-11-20 10:36:03,055 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-20 10:36:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35647 states. [2019-11-20 10:36:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35647 to 23495. [2019-11-20 10:36:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23495 states. [2019-11-20 10:36:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23495 states to 23495 states and 83611 transitions. [2019-11-20 10:36:03,524 INFO L78 Accepts]: Start accepts. Automaton has 23495 states and 83611 transitions. Word has length 56 [2019-11-20 10:36:03,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:03,525 INFO L462 AbstractCegarLoop]: Abstraction has 23495 states and 83611 transitions. [2019-11-20 10:36:03,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 10:36:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 23495 states and 83611 transitions. [2019-11-20 10:36:03,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:03,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:36:03,546 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-20 10:36:03,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:36:03,747 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:36:03,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:36:03,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1565530959, now seen corresponding path program 3 times [2019-11-20 10:36:03,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:36:03,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798961365] [2019-11-20 10:36:03,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:36:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:03,849 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-20 10:36:03,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798961365] [2019-11-20 10:36:03,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:36:03,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 10:36:03,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059211231] [2019-11-20 10:36:03,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 10:36:03,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:36:03,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 10:36:03,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:36:03,851 INFO L87 Difference]: Start difference. First operand 23495 states and 83611 transitions. Second operand 12 states. [2019-11-20 10:36:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:04,368 INFO L93 Difference]: Finished difference Result 35407 states and 122943 transitions. [2019-11-20 10:36:04,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 10:36:04,369 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 10:36:04,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:04,429 INFO L225 Difference]: With dead ends: 35407 [2019-11-20 10:36:04,430 INFO L226 Difference]: Without dead ends: 34063 [2019-11-20 10:36:04,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-20 10:36:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34063 states. [2019-11-20 10:36:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34063 to 22751. [2019-11-20 10:36:04,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22751 states. [2019-11-20 10:36:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22751 states to 22751 states and 80883 transitions. [2019-11-20 10:36:04,920 INFO L78 Accepts]: Start accepts. Automaton has 22751 states and 80883 transitions. Word has length 56 [2019-11-20 10:36:04,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:04,921 INFO L462 AbstractCegarLoop]: Abstraction has 22751 states and 80883 transitions. [2019-11-20 10:36:04,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 10:36:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 22751 states and 80883 transitions. [2019-11-20 10:36:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:04,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:36:04,944 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-20 10:36:04,944 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:36:04,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:36:04,944 INFO L82 PathProgramCache]: Analyzing trace with hash 629023921, now seen corresponding path program 4 times [2019-11-20 10:36:04,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:36:04,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85361398] [2019-11-20 10:36:04,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:36:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:05,063 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-20 10:36:05,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85361398] [2019-11-20 10:36:05,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:36:05,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 10:36:05,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506345086] [2019-11-20 10:36:05,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 10:36:05,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:36:05,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 10:36:05,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:36:05,065 INFO L87 Difference]: Start difference. First operand 22751 states and 80883 transitions. Second operand 12 states. [2019-11-20 10:36:05,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:05,608 INFO L93 Difference]: Finished difference Result 34663 states and 120215 transitions. [2019-11-20 10:36:05,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 10:36:05,608 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 10:36:05,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:05,663 INFO L225 Difference]: With dead ends: 34663 [2019-11-20 10:36:05,664 INFO L226 Difference]: Without dead ends: 32215 [2019-11-20 10:36:05,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-20 10:36:05,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32215 states. [2019-11-20 10:36:06,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32215 to 21439. [2019-11-20 10:36:06,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21439 states. [2019-11-20 10:36:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21439 states to 21439 states and 75983 transitions. [2019-11-20 10:36:06,077 INFO L78 Accepts]: Start accepts. Automaton has 21439 states and 75983 transitions. Word has length 56 [2019-11-20 10:36:06,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:06,077 INFO L462 AbstractCegarLoop]: Abstraction has 21439 states and 75983 transitions. [2019-11-20 10:36:06,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 10:36:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 21439 states and 75983 transitions. [2019-11-20 10:36:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:06,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:36:06,098 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-20 10:36:06,098 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:36:06,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:36:06,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1764082865, now seen corresponding path program 5 times [2019-11-20 10:36:06,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:36:06,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755500039] [2019-11-20 10:36:06,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:36:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:06,201 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-20 10:36:06,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755500039] [2019-11-20 10:36:06,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:36:06,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 10:36:06,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48232307] [2019-11-20 10:36:06,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 10:36:06,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:36:06,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 10:36:06,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:36:06,203 INFO L87 Difference]: Start difference. First operand 21439 states and 75983 transitions. Second operand 12 states. [2019-11-20 10:36:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:06,703 INFO L93 Difference]: Finished difference Result 31975 states and 110763 transitions. [2019-11-20 10:36:06,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 10:36:06,704 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 10:36:06,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:06,755 INFO L225 Difference]: With dead ends: 31975 [2019-11-20 10:36:06,755 INFO L226 Difference]: Without dead ends: 30631 [2019-11-20 10:36:06,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-20 10:36:06,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30631 states. [2019-11-20 10:36:07,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30631 to 20695. [2019-11-20 10:36:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20695 states. [2019-11-20 10:36:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20695 states to 20695 states and 73255 transitions. [2019-11-20 10:36:07,416 INFO L78 Accepts]: Start accepts. Automaton has 20695 states and 73255 transitions. Word has length 56 [2019-11-20 10:36:07,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:07,416 INFO L462 AbstractCegarLoop]: Abstraction has 20695 states and 73255 transitions. [2019-11-20 10:36:07,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 10:36:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 20695 states and 73255 transitions. [2019-11-20 10:36:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:07,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:36:07,437 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-20 10:36:07,437 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:36:07,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:36:07,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1313049423, now seen corresponding path program 6 times [2019-11-20 10:36:07,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:36:07,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244944311] [2019-11-20 10:36:07,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:36:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:07,560 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-20 10:36:07,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244944311] [2019-11-20 10:36:07,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:36:07,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 10:36:07,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422811456] [2019-11-20 10:36:07,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 10:36:07,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:36:07,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 10:36:07,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:36:07,562 INFO L87 Difference]: Start difference. First operand 20695 states and 73255 transitions. Second operand 12 states. [2019-11-20 10:36:08,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:08,156 INFO L93 Difference]: Finished difference Result 30391 states and 105271 transitions. [2019-11-20 10:36:08,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 10:36:08,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 10:36:08,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:08,201 INFO L225 Difference]: With dead ends: 30391 [2019-11-20 10:36:08,201 INFO L226 Difference]: Without dead ends: 26619 [2019-11-20 10:36:08,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-20 10:36:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26619 states. [2019-11-20 10:36:08,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26619 to 16683. [2019-11-20 10:36:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16683 states. [2019-11-20 10:36:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16683 states to 16683 states and 59640 transitions. [2019-11-20 10:36:08,525 INFO L78 Accepts]: Start accepts. Automaton has 16683 states and 59640 transitions. Word has length 56 [2019-11-20 10:36:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:08,525 INFO L462 AbstractCegarLoop]: Abstraction has 16683 states and 59640 transitions. [2019-11-20 10:36:08,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 10:36:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 16683 states and 59640 transitions. [2019-11-20 10:36:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:08,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:36:08,542 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-20 10:36:08,542 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:36:08,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:36:08,542 INFO L82 PathProgramCache]: Analyzing trace with hash 140283142, now seen corresponding path program 1 times [2019-11-20 10:36:08,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:36:08,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145630514] [2019-11-20 10:36:08,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:36:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 10:36:08,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145630514] [2019-11-20 10:36:08,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040533285] [2019-11-20 10:36:08,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:36:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:08,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 10:36:08,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:36:08,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:36:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 10:36:08,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:36:08,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-20 10:36:08,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084660006] [2019-11-20 10:36:08,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 10:36:08,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:36:08,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 10:36:08,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-20 10:36:08,918 INFO L87 Difference]: Start difference. First operand 16683 states and 59640 transitions. Second operand 22 states. [2019-11-20 10:36:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:09,681 INFO L93 Difference]: Finished difference Result 26379 states and 91656 transitions. [2019-11-20 10:36:09,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 10:36:09,681 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-20 10:36:09,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:09,723 INFO L225 Difference]: With dead ends: 26379 [2019-11-20 10:36:09,723 INFO L226 Difference]: Without dead ends: 25035 [2019-11-20 10:36:09,723 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-20 10:36:09,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25035 states. [2019-11-20 10:36:09,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25035 to 16475. [2019-11-20 10:36:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16475 states. [2019-11-20 10:36:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16475 states to 16475 states and 58700 transitions. [2019-11-20 10:36:10,029 INFO L78 Accepts]: Start accepts. Automaton has 16475 states and 58700 transitions. Word has length 56 [2019-11-20 10:36:10,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:10,029 INFO L462 AbstractCegarLoop]: Abstraction has 16475 states and 58700 transitions. [2019-11-20 10:36:10,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 10:36:10,029 INFO L276 IsEmpty]: Start isEmpty. Operand 16475 states and 58700 transitions. [2019-11-20 10:36:10,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:10,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:36:10,045 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-20 10:36:10,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:36:10,245 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:36:10,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:36:10,245 INFO L82 PathProgramCache]: Analyzing trace with hash 188839268, now seen corresponding path program 2 times [2019-11-20 10:36:10,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:36:10,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886240173] [2019-11-20 10:36:10,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:36:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 10:36:10,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886240173] [2019-11-20 10:36:10,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784244968] [2019-11-20 10:36:10,354 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:36:10,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 10:36:10,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:36:10,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 10:36:10,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:36:10,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:36:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 10:36:10,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:36:10,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-20 10:36:10,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17682224] [2019-11-20 10:36:10,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 10:36:10,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:36:10,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 10:36:10,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-20 10:36:10,589 INFO L87 Difference]: Start difference. First operand 16475 states and 58700 transitions. Second operand 22 states. [2019-11-20 10:36:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:11,266 INFO L93 Difference]: Finished difference Result 24795 states and 86164 transitions. [2019-11-20 10:36:11,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 10:36:11,267 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-20 10:36:11,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:11,301 INFO L225 Difference]: With dead ends: 24795 [2019-11-20 10:36:11,301 INFO L226 Difference]: Without dead ends: 22347 [2019-11-20 10:36:11,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 10:36:11,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22347 states. [2019-11-20 10:36:11,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22347 to 15163. [2019-11-20 10:36:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15163 states. [2019-11-20 10:36:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15163 states to 15163 states and 53800 transitions. [2019-11-20 10:36:11,578 INFO L78 Accepts]: Start accepts. Automaton has 15163 states and 53800 transitions. Word has length 56 [2019-11-20 10:36:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:11,579 INFO L462 AbstractCegarLoop]: Abstraction has 15163 states and 53800 transitions. [2019-11-20 10:36:11,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 10:36:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 15163 states and 53800 transitions. [2019-11-20 10:36:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:11,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:36:11,593 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-20 10:36:11,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:36:11,794 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:36:11,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:36:11,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1278674392, now seen corresponding path program 3 times [2019-11-20 10:36:11,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:36:11,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853988722] [2019-11-20 10:36:11,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:36:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:11,890 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-20 10:36:11,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853988722] [2019-11-20 10:36:11,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:36:11,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 10:36:11,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329401138] [2019-11-20 10:36:11,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 10:36:11,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:36:11,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 10:36:11,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:36:11,892 INFO L87 Difference]: Start difference. First operand 15163 states and 53800 transitions. Second operand 12 states. [2019-11-20 10:36:12,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:12,420 INFO L93 Difference]: Finished difference Result 22107 states and 76712 transitions. [2019-11-20 10:36:12,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 10:36:12,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 10:36:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:12,452 INFO L225 Difference]: With dead ends: 22107 [2019-11-20 10:36:12,452 INFO L226 Difference]: Without dead ends: 20763 [2019-11-20 10:36:12,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-20 10:36:12,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20763 states. [2019-11-20 10:36:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20763 to 14419. [2019-11-20 10:36:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14419 states. [2019-11-20 10:36:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14419 states to 14419 states and 51072 transitions. [2019-11-20 10:36:12,710 INFO L78 Accepts]: Start accepts. Automaton has 14419 states and 51072 transitions. Word has length 56 [2019-11-20 10:36:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:12,710 INFO L462 AbstractCegarLoop]: Abstraction has 14419 states and 51072 transitions. [2019-11-20 10:36:12,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 10:36:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 14419 states and 51072 transitions. [2019-11-20 10:36:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:12,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:36:12,723 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-20 10:36:12,724 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:36:12,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:36:12,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1300329210, now seen corresponding path program 4 times [2019-11-20 10:36:12,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:36:12,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729873918] [2019-11-20 10:36:12,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:36:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:12,839 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-20 10:36:12,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729873918] [2019-11-20 10:36:12,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:36:12,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 10:36:12,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842870465] [2019-11-20 10:36:12,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 10:36:12,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:36:12,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 10:36:12,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:36:12,840 INFO L87 Difference]: Start difference. First operand 14419 states and 51072 transitions. Second operand 12 states. [2019-11-20 10:36:13,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:13,337 INFO L93 Difference]: Finished difference Result 21363 states and 73984 transitions. [2019-11-20 10:36:13,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 10:36:13,337 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 10:36:13,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:13,367 INFO L225 Difference]: With dead ends: 21363 [2019-11-20 10:36:13,367 INFO L226 Difference]: Without dead ends: 18915 [2019-11-20 10:36:13,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-20 10:36:13,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18915 states. [2019-11-20 10:36:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18915 to 13107. [2019-11-20 10:36:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13107 states. [2019-11-20 10:36:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13107 states to 13107 states and 46172 transitions. [2019-11-20 10:36:13,605 INFO L78 Accepts]: Start accepts. Automaton has 13107 states and 46172 transitions. Word has length 56 [2019-11-20 10:36:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:13,605 INFO L462 AbstractCegarLoop]: Abstraction has 13107 states and 46172 transitions. [2019-11-20 10:36:13,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 10:36:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 13107 states and 46172 transitions. [2019-11-20 10:36:13,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:13,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:36:13,616 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-20 10:36:13,616 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:36:13,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:36:13,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1882532380, now seen corresponding path program 5 times [2019-11-20 10:36:13,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:36:13,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811321384] [2019-11-20 10:36:13,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:36:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:13,737 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-20 10:36:13,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811321384] [2019-11-20 10:36:13,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:36:13,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 10:36:13,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320788373] [2019-11-20 10:36:13,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 10:36:13,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:36:13,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 10:36:13,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:36:13,740 INFO L87 Difference]: Start difference. First operand 13107 states and 46172 transitions. Second operand 12 states. [2019-11-20 10:36:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:14,347 INFO L93 Difference]: Finished difference Result 18675 states and 64532 transitions. [2019-11-20 10:36:14,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 10:36:14,348 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 10:36:14,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:14,375 INFO L225 Difference]: With dead ends: 18675 [2019-11-20 10:36:14,375 INFO L226 Difference]: Without dead ends: 17331 [2019-11-20 10:36:14,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-20 10:36:14,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17331 states. [2019-11-20 10:36:14,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17331 to 12363. [2019-11-20 10:36:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12363 states. [2019-11-20 10:36:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12363 states to 12363 states and 43444 transitions. [2019-11-20 10:36:14,599 INFO L78 Accepts]: Start accepts. Automaton has 12363 states and 43444 transitions. Word has length 56 [2019-11-20 10:36:14,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:14,599 INFO L462 AbstractCegarLoop]: Abstraction has 12363 states and 43444 transitions. [2019-11-20 10:36:14,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 10:36:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 12363 states and 43444 transitions. [2019-11-20 10:36:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:14,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:36:14,610 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-20 10:36:14,610 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:36:14,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:36:14,611 INFO L82 PathProgramCache]: Analyzing trace with hash -664697372, now seen corresponding path program 6 times [2019-11-20 10:36:14,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:36:14,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453325336] [2019-11-20 10:36:14,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:36:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:14,724 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-20 10:36:14,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453325336] [2019-11-20 10:36:14,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:36:14,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 10:36:14,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647922613] [2019-11-20 10:36:14,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 10:36:14,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:36:14,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 10:36:14,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:36:14,726 INFO L87 Difference]: Start difference. First operand 12363 states and 43444 transitions. Second operand 12 states. [2019-11-20 10:36:15,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:15,429 INFO L93 Difference]: Finished difference Result 17091 states and 59040 transitions. [2019-11-20 10:36:15,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 10:36:15,430 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 10:36:15,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:15,450 INFO L225 Difference]: With dead ends: 17091 [2019-11-20 10:36:15,451 INFO L226 Difference]: Without dead ends: 13319 [2019-11-20 10:36:15,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-20 10:36:15,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13319 states. [2019-11-20 10:36:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13319 to 8351. [2019-11-20 10:36:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8351 states. [2019-11-20 10:36:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8351 states to 8351 states and 29829 transitions. [2019-11-20 10:36:15,605 INFO L78 Accepts]: Start accepts. Automaton has 8351 states and 29829 transitions. Word has length 56 [2019-11-20 10:36:15,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:15,605 INFO L462 AbstractCegarLoop]: Abstraction has 8351 states and 29829 transitions. [2019-11-20 10:36:15,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 10:36:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 8351 states and 29829 transitions. [2019-11-20 10:36:15,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:15,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:36:15,613 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-20 10:36:15,613 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:36:15,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:36:15,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1602728437, now seen corresponding path program 1 times [2019-11-20 10:36:15,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:36:15,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220143441] [2019-11-20 10:36:15,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:36:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 10:36:15,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220143441] [2019-11-20 10:36:15,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443390688] [2019-11-20 10:36:15,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:36:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:15,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 10:36:15,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:36:15,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:36:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 10:36:15,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:36:15,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-20 10:36:15,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362928794] [2019-11-20 10:36:15,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 10:36:15,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:36:15,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 10:36:15,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-20 10:36:15,976 INFO L87 Difference]: Start difference. First operand 8351 states and 29829 transitions. Second operand 22 states. [2019-11-20 10:36:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:16,665 INFO L93 Difference]: Finished difference Result 13079 states and 45425 transitions. [2019-11-20 10:36:16,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 10:36:16,666 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-20 10:36:16,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:16,683 INFO L225 Difference]: With dead ends: 13079 [2019-11-20 10:36:16,683 INFO L226 Difference]: Without dead ends: 11735 [2019-11-20 10:36:16,683 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-20 10:36:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11735 states. [2019-11-20 10:36:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11735 to 8143. [2019-11-20 10:36:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8143 states. [2019-11-20 10:36:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8143 states to 8143 states and 28889 transitions. [2019-11-20 10:36:16,829 INFO L78 Accepts]: Start accepts. Automaton has 8143 states and 28889 transitions. Word has length 56 [2019-11-20 10:36:16,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:16,829 INFO L462 AbstractCegarLoop]: Abstraction has 8143 states and 28889 transitions. [2019-11-20 10:36:16,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 10:36:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 8143 states and 28889 transitions. [2019-11-20 10:36:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:16,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:36:16,837 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-20 10:36:17,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:36:17,038 INFO L410 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:36:17,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:36:17,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1466478091, now seen corresponding path program 2 times [2019-11-20 10:36:17,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:36:17,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816571823] [2019-11-20 10:36:17,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:36:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 10:36:17,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816571823] [2019-11-20 10:36:17,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965872499] [2019-11-20 10:36:17,146 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:36:17,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 10:36:17,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:36:17,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 10:36:17,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:36:17,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:36:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 10:36:17,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:36:17,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-20 10:36:17,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244538377] [2019-11-20 10:36:17,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 10:36:17,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:36:17,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 10:36:17,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-20 10:36:17,480 INFO L87 Difference]: Start difference. First operand 8143 states and 28889 transitions. Second operand 22 states. [2019-11-20 10:36:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:18,384 INFO L93 Difference]: Finished difference Result 11495 states and 39933 transitions. [2019-11-20 10:36:18,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 10:36:18,384 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-20 10:36:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:18,402 INFO L225 Difference]: With dead ends: 11495 [2019-11-20 10:36:18,403 INFO L226 Difference]: Without dead ends: 9047 [2019-11-20 10:36:18,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2019-11-20 10:36:18,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9047 states. [2019-11-20 10:36:18,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9047 to 6831. [2019-11-20 10:36:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6831 states. [2019-11-20 10:36:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6831 states to 6831 states and 23989 transitions. [2019-11-20 10:36:18,562 INFO L78 Accepts]: Start accepts. Automaton has 6831 states and 23989 transitions. Word has length 56 [2019-11-20 10:36:18,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:18,562 INFO L462 AbstractCegarLoop]: Abstraction has 6831 states and 23989 transitions. [2019-11-20 10:36:18,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 10:36:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 6831 states and 23989 transitions. [2019-11-20 10:36:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:18,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:36:18,571 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-20 10:36:18,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:36:18,775 INFO L410 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:36:18,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:36:18,775 INFO L82 PathProgramCache]: Analyzing trace with hash -936896365, now seen corresponding path program 3 times [2019-11-20 10:36:18,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:36:18,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626148622] [2019-11-20 10:36:18,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:36:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:18,898 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-20 10:36:18,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626148622] [2019-11-20 10:36:18,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:36:18,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 10:36:18,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733226391] [2019-11-20 10:36:18,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 10:36:18,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:36:18,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 10:36:18,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:36:18,900 INFO L87 Difference]: Start difference. First operand 6831 states and 23989 transitions. Second operand 12 states. [2019-11-20 10:36:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:19,221 INFO L93 Difference]: Finished difference Result 8807 states and 30481 transitions. [2019-11-20 10:36:19,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:36:19,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 10:36:19,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:19,234 INFO L225 Difference]: With dead ends: 8807 [2019-11-20 10:36:19,234 INFO L226 Difference]: Without dead ends: 7463 [2019-11-20 10:36:19,234 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-20 10:36:19,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7463 states. [2019-11-20 10:36:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7463 to 6087. [2019-11-20 10:36:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6087 states. [2019-11-20 10:36:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6087 states to 6087 states and 21261 transitions. [2019-11-20 10:36:19,337 INFO L78 Accepts]: Start accepts. Automaton has 6087 states and 21261 transitions. Word has length 56 [2019-11-20 10:36:19,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:19,338 INFO L462 AbstractCegarLoop]: Abstraction has 6087 states and 21261 transitions. [2019-11-20 10:36:19,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 10:36:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 6087 states and 21261 transitions. [2019-11-20 10:36:19,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:19,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:36:19,344 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-20 10:36:19,344 INFO L410 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:36:19,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:36:19,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1257658515, now seen corresponding path program 4 times [2019-11-20 10:36:19,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:36:19,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312141303] [2019-11-20 10:36:19,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:36:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:19,446 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-20 10:36:19,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312141303] [2019-11-20 10:36:19,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:36:19,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 10:36:19,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214547680] [2019-11-20 10:36:19,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 10:36:19,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:36:19,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 10:36:19,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:36:19,448 INFO L87 Difference]: Start difference. First operand 6087 states and 21261 transitions. Second operand 12 states. [2019-11-20 10:36:19,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:19,789 INFO L93 Difference]: Finished difference Result 8063 states and 27753 transitions. [2019-11-20 10:36:19,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 10:36:19,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 10:36:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:19,797 INFO L225 Difference]: With dead ends: 8063 [2019-11-20 10:36:19,797 INFO L226 Difference]: Without dead ends: 5615 [2019-11-20 10:36:19,798 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-20 10:36:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5615 states. [2019-11-20 10:36:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5615 to 4775. [2019-11-20 10:36:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4775 states. [2019-11-20 10:36:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 16361 transitions. [2019-11-20 10:36:19,870 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 16361 transitions. Word has length 56 [2019-11-20 10:36:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:19,870 INFO L462 AbstractCegarLoop]: Abstraction has 4775 states and 16361 transitions. [2019-11-20 10:36:19,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 10:36:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 16361 transitions. [2019-11-20 10:36:19,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:19,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:36:19,874 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-20 10:36:19,874 INFO L410 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:36:19,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:36:19,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1902249837, now seen corresponding path program 5 times [2019-11-20 10:36:19,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:36:19,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025151785] [2019-11-20 10:36:19,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:36:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:20,001 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-20 10:36:20,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025151785] [2019-11-20 10:36:20,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:36:20,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 10:36:20,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208242116] [2019-11-20 10:36:20,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 10:36:20,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:36:20,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 10:36:20,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:36:20,003 INFO L87 Difference]: Start difference. First operand 4775 states and 16361 transitions. Second operand 12 states. [2019-11-20 10:36:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:20,274 INFO L93 Difference]: Finished difference Result 5375 states and 18301 transitions. [2019-11-20 10:36:20,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 10:36:20,275 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 10:36:20,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:20,280 INFO L225 Difference]: With dead ends: 5375 [2019-11-20 10:36:20,280 INFO L226 Difference]: Without dead ends: 4031 [2019-11-20 10:36:20,280 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-20 10:36:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4031 states. [2019-11-20 10:36:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4031 to 4031. [2019-11-20 10:36:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4031 states. [2019-11-20 10:36:20,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 13633 transitions. [2019-11-20 10:36:20,333 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 13633 transitions. Word has length 56 [2019-11-20 10:36:20,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:20,334 INFO L462 AbstractCegarLoop]: Abstraction has 4031 states and 13633 transitions. [2019-11-20 10:36:20,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 10:36:20,334 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 13633 transitions. [2019-11-20 10:36:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:20,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:36:20,338 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-20 10:36:20,338 INFO L410 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:36:20,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:36:20,338 INFO L82 PathProgramCache]: Analyzing trace with hash -684414829, now seen corresponding path program 6 times [2019-11-20 10:36:20,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:36:20,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862603542] [2019-11-20 10:36:20,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:36:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:20,469 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-20 10:36:20,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862603542] [2019-11-20 10:36:20,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:36:20,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 10:36:20,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11168237] [2019-11-20 10:36:20,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 10:36:20,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:36:20,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 10:36:20,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:36:20,470 INFO L87 Difference]: Start difference. First operand 4031 states and 13633 transitions. Second operand 12 states. [2019-11-20 10:36:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:36:20,668 INFO L93 Difference]: Finished difference Result 3791 states and 12809 transitions. [2019-11-20 10:36:20,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 10:36:20,668 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-20 10:36:20,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:36:20,668 INFO L225 Difference]: With dead ends: 3791 [2019-11-20 10:36:20,668 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 10:36:20,669 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-20 10:36:20,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 10:36:20,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 10:36:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 10:36:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 10:36:20,669 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-11-20 10:36:20,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:36:20,670 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 10:36:20,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 10:36:20,670 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 10:36:20,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 10:36:20,672 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-20 10:36:20,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:36:20 BasicIcfg [2019-11-20 10:36:20,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 10:36:20,674 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:36:20,674 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:36:20,674 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:36:20,675 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:34:05" (3/4) ... [2019-11-20 10:36:20,678 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 10:36:20,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2019-11-20 10:36:20,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2019-11-20 10:36:20,686 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-20 10:36:20,686 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 10:36:20,686 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 10:36:20,714 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_310c0a7c-d5fc-42b6-bf90-b133926f8abd/bin/uautomizer/witness.graphml [2019-11-20 10:36:20,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:36:20,715 INFO L168 Benchmark]: Toolchain (without parser) took 136482.53 ms. Allocated memory was 1.0 GB in the beginning and 6.0 GB in the end (delta: 4.9 GB). Free memory was 944.7 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-11-20 10:36:20,715 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:36:20,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 568.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:36:20,716 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:36:20,716 INFO L168 Benchmark]: Boogie Preprocessor took 24.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:36:20,716 INFO L168 Benchmark]: RCFGBuilder took 342.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:36:20,717 INFO L168 Benchmark]: TraceAbstraction took 135462.20 ms. Allocated memory was 1.2 GB in the beginning and 6.0 GB in the end (delta: 4.8 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-11-20 10:36:20,717 INFO L168 Benchmark]: Witness Printer took 39.65 ms. Allocated memory is still 6.0 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-11-20 10:36:20,719 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 568.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 342.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 135462.20 ms. Allocated memory was 1.2 GB in the beginning and 6.0 GB in the end (delta: 4.8 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 39.65 ms. Allocated memory is still 6.0 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 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: 135.3s, OverallIterations: 48, TraceHistogramMax: 3, AutomataDifference: 38.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9357 SDtfs, 26345 SDslu, 52897 SDs, 0 SdLazy, 13572 SolverSat, 594 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1531 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 1057 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5618 ImplicationChecksByTransitivity, 14.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138880occurred 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: 54.8s AutomataMinimizationTime, 48 MinimizatonAttempts, 872214 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2670 NumberOfCodeBlocks, 2670 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 2613 ConstructedInterpolants, 0 QuantifiedInterpolants, 617412 SizeOfPredicates, 84 NumberOfNonLiveVariables, 1137 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 57 InterpolantComputations, 39 PerfectInterpolantSequences, 285/375 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...