./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3d056a1f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 64bit --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-3d056a1 [2019-11-22 13:43:49,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 13:43:49,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 13:43:49,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 13:43:49,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 13:43:49,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 13:43:49,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 13:43:49,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 13:43:49,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 13:43:49,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 13:43:49,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 13:43:49,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 13:43:49,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 13:43:49,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 13:43:49,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 13:43:49,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 13:43:49,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 13:43:49,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 13:43:49,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 13:43:49,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 13:43:49,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 13:43:49,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 13:43:49,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 13:43:49,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 13:43:49,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 13:43:49,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 13:43:49,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 13:43:49,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 13:43:49,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 13:43:49,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 13:43:49,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 13:43:49,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 13:43:49,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 13:43:49,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 13:43:49,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 13:43:49,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 13:43:49,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 13:43:49,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 13:43:49,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 13:43:49,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 13:43:49,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 13:43:49,649 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-22 13:43:49,663 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 13:43:49,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 13:43:49,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 13:43:49,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 13:43:49,665 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 13:43:49,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 13:43:49,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 13:43:49,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 13:43:49,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-22 13:43:49,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 13:43:49,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-22 13:43:49,667 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 13:43:49,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-22 13:43:49,668 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 13:43:49,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-22 13:43:49,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 13:43:49,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 13:43:49,669 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 13:43:49,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 13:43:49,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 13:43:49,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 13:43:49,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 13:43:49,671 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-22 13:43:49,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 13:43:49,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 13:43:49,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-22 13:43:49,672 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 13:43:49,672 INFO L138 SettingsManager]: * To the following directory=dump/ 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18f8c11d6085f6594f0f2021411e68b8ac706f42 [2019-11-22 13:43:49,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 13:43:49,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 13:43:49,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 13:43:49,981 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 13:43:49,981 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 13:43:49,982 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2019-11-22 13:43:50,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c89bf5619/05a3e54e802f4ed591d125153efecb63/FLAG3695f8423 [2019-11-22 13:43:50,571 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 13:43:50,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2019-11-22 13:43:50,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c89bf5619/05a3e54e802f4ed591d125153efecb63/FLAG3695f8423 [2019-11-22 13:43:50,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c89bf5619/05a3e54e802f4ed591d125153efecb63 [2019-11-22 13:43:50,883 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 13:43:50,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-22 13:43:50,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 13:43:50,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 13:43:50,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 13:43:50,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:43:50" (1/1) ... [2019-11-22 13:43:50,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7496d8e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:43:50, skipping insertion in model container [2019-11-22 13:43:50,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:43:50" (1/1) ... [2019-11-22 13:43:50,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 13:43:50,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 13:43:51,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:43:51,394 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 13:43:51,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:43:51,567 INFO L208 MainTranslator]: Completed translation [2019-11-22 13:43:51,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:43:51 WrapperNode [2019-11-22 13:43:51,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 13:43:51,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-22 13:43:51,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-22 13:43:51,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-22 13:43:51,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:43:51" (1/1) ... [2019-11-22 13:43:51,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:43:51" (1/1) ... [2019-11-22 13:43:51,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-22 13:43:51,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 13:43:51,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 13:43:51,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 13:43:51,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:43:51" (1/1) ... [2019-11-22 13:43:51,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:43:51" (1/1) ... [2019-11-22 13:43:51,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:43:51" (1/1) ... [2019-11-22 13:43:51,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:43:51" (1/1) ... [2019-11-22 13:43:51,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:43:51" (1/1) ... [2019-11-22 13:43:51,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:43:51" (1/1) ... [2019-11-22 13:43:51,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:43:51" (1/1) ... [2019-11-22 13:43:51,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 13:43:51,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 13:43:51,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 13:43:51,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 13:43:51,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:43:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 13:43:51,737 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-11-22 13:43:51,738 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-11-22 13:43:51,738 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-11-22 13:43:51,738 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-11-22 13:43:51,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 13:43:51,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 13:43:51,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 13:43:51,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 13:43:51,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 13:43:51,741 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-22 13:43:52,071 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 13:43:52,071 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-22 13:43:52,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:43:52 BoogieIcfgContainer [2019-11-22 13:43:52,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 13:43:52,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 13:43:52,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 13:43:52,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 13:43:52,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:43:50" (1/3) ... [2019-11-22 13:43:52,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6811be99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:43:52, skipping insertion in model container [2019-11-22 13:43:52,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:43:51" (2/3) ... [2019-11-22 13:43:52,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6811be99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:43:52, skipping insertion in model container [2019-11-22 13:43:52,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:43:52" (3/3) ... [2019-11-22 13:43:52,081 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2019-11-22 13:43:52,125 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,125 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,125 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,126 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,126 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,126 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,127 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,127 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,128 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,128 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,128 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,129 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,129 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,129 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,130 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,130 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,130 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,130 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,131 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,131 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,131 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,132 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,132 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,132 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,133 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,133 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,133 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,134 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,134 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,134 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,134 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,135 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,135 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,135 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,136 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,136 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,136 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,136 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,137 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,137 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,137 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,138 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,138 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,138 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,138 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,138 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,139 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,139 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,139 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,139 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,140 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 13:43:52,163 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-22 13:43:52,164 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 13:43:52,172 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-22 13:43:52,182 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-22 13:43:52,199 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 13:43:52,199 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-22 13:43:52,199 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 13:43:52,199 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 13:43:52,199 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 13:43:52,200 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 13:43:52,200 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 13:43:52,200 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 13:43:52,211 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 83 transitions [2019-11-22 13:43:56,179 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34966 states. [2019-11-22 13:43:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 34966 states. [2019-11-22 13:43:56,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 13:43:56,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:43:56,191 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-22 13:43:56,192 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 13:43:56,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:43:56,197 INFO L82 PathProgramCache]: Analyzing trace with hash -902852624, now seen corresponding path program 1 times [2019-11-22 13:43:56,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:43:56,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972119437] [2019-11-22 13:43:56,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:43:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:43:56,519 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-22 13:43:56,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972119437] [2019-11-22 13:43:56,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:43:56,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 13:43:56,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348730301] [2019-11-22 13:43:56,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:43:56,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:43:56,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:43:56,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:43:56,549 INFO L87 Difference]: Start difference. First operand 34966 states. Second operand 6 states. [2019-11-22 13:43:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:43:57,746 INFO L93 Difference]: Finished difference Result 45470 states and 184962 transitions. [2019-11-22 13:43:57,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:43:57,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-22 13:43:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:43:57,968 INFO L225 Difference]: With dead ends: 45470 [2019-11-22 13:43:57,968 INFO L226 Difference]: Without dead ends: 20819 [2019-11-22 13:43:57,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-22 13:43:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20819 states. [2019-11-22 13:43:58,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20819 to 20819. [2019-11-22 13:43:58,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20819 states. [2019-11-22 13:43:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20819 states to 20819 states and 82977 transitions. [2019-11-22 13:43:59,090 INFO L78 Accepts]: Start accepts. Automaton has 20819 states and 82977 transitions. Word has length 25 [2019-11-22 13:43:59,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:43:59,092 INFO L462 AbstractCegarLoop]: Abstraction has 20819 states and 82977 transitions. [2019-11-22 13:43:59,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:43:59,093 INFO L276 IsEmpty]: Start isEmpty. Operand 20819 states and 82977 transitions. [2019-11-22 13:43:59,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-22 13:43:59,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:43:59,109 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-22 13:43:59,110 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 13:43:59,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:43:59,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1950343494, now seen corresponding path program 1 times [2019-11-22 13:43:59,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:43:59,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149342828] [2019-11-22 13:43:59,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:43:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:43:59,297 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-22 13:43:59,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149342828] [2019-11-22 13:43:59,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:43:59,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 13:43:59,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145398697] [2019-11-22 13:43:59,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:43:59,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:43:59,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:43:59,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:43:59,301 INFO L87 Difference]: Start difference. First operand 20819 states and 82977 transitions. Second operand 8 states. [2019-11-22 13:44:00,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:44:00,314 INFO L93 Difference]: Finished difference Result 35069 states and 134196 transitions. [2019-11-22 13:44:00,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 13:44:00,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-22 13:44:00,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:44:00,458 INFO L225 Difference]: With dead ends: 35069 [2019-11-22 13:44:00,458 INFO L226 Difference]: Without dead ends: 28819 [2019-11-22 13:44:00,459 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-22 13:44:00,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28819 states. [2019-11-22 13:44:01,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28819 to 19249. [2019-11-22 13:44:01,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19249 states. [2019-11-22 13:44:01,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19249 states to 19249 states and 75732 transitions. [2019-11-22 13:44:01,326 INFO L78 Accepts]: Start accepts. Automaton has 19249 states and 75732 transitions. Word has length 34 [2019-11-22 13:44:01,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:44:01,327 INFO L462 AbstractCegarLoop]: Abstraction has 19249 states and 75732 transitions. [2019-11-22 13:44:01,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:44:01,327 INFO L276 IsEmpty]: Start isEmpty. Operand 19249 states and 75732 transitions. [2019-11-22 13:44:01,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-22 13:44:01,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:44:01,332 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:44:01,333 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 13:44:01,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:44:01,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1707268840, now seen corresponding path program 1 times [2019-11-22 13:44:01,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:44:01,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566401512] [2019-11-22 13:44:01,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:44:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:44:01,472 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-22 13:44:01,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566401512] [2019-11-22 13:44:01,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:44:01,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 13:44:01,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327530676] [2019-11-22 13:44:01,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:44:01,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:44:01,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:44:01,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:44:01,476 INFO L87 Difference]: Start difference. First operand 19249 states and 75732 transitions. Second operand 8 states. [2019-11-22 13:44:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:44:01,931 INFO L93 Difference]: Finished difference Result 31729 states and 119978 transitions. [2019-11-22 13:44:01,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 13:44:01,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-22 13:44:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:44:02,044 INFO L225 Difference]: With dead ends: 31729 [2019-11-22 13:44:02,045 INFO L226 Difference]: Without dead ends: 25345 [2019-11-22 13:44:02,045 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-22 13:44:02,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25345 states. [2019-11-22 13:44:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25345 to 17369. [2019-11-22 13:44:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17369 states. [2019-11-22 13:44:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17369 states to 17369 states and 66928 transitions. [2019-11-22 13:44:03,276 INFO L78 Accepts]: Start accepts. Automaton has 17369 states and 66928 transitions. Word has length 41 [2019-11-22 13:44:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:44:03,280 INFO L462 AbstractCegarLoop]: Abstraction has 17369 states and 66928 transitions. [2019-11-22 13:44:03,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:44:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 17369 states and 66928 transitions. [2019-11-22 13:44:03,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-22 13:44:03,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:44:03,290 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-22 13:44:03,291 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 13:44:03,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:44:03,293 INFO L82 PathProgramCache]: Analyzing trace with hash -539445418, now seen corresponding path program 1 times [2019-11-22 13:44:03,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:44:03,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298323801] [2019-11-22 13:44:03,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:44:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:44:03,437 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-22 13:44:03,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298323801] [2019-11-22 13:44:03,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563851011] [2019-11-22 13:44:03,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 13:44:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:44:03,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 13:44:03,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:44:03,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:44:03,741 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-22 13:44:03,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:44:03,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-22 13:44:03,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475052104] [2019-11-22 13:44:03,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-22 13:44:03,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:44:03,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-22 13:44:03,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-22 13:44:03,744 INFO L87 Difference]: Start difference. First operand 17369 states and 66928 transitions. Second operand 18 states. [2019-11-22 13:44:04,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:44:04,691 INFO L93 Difference]: Finished difference Result 34675 states and 128863 transitions. [2019-11-22 13:44:04,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 13:44:04,692 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-22 13:44:04,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:44:04,822 INFO L225 Difference]: With dead ends: 34675 [2019-11-22 13:44:04,823 INFO L226 Difference]: Without dead ends: 32095 [2019-11-22 13:44:04,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-22 13:44:04,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32095 states. [2019-11-22 13:44:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32095 to 16565. [2019-11-22 13:44:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16565 states. [2019-11-22 13:44:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16565 states to 16565 states and 63900 transitions. [2019-11-22 13:44:05,643 INFO L78 Accepts]: Start accepts. Automaton has 16565 states and 63900 transitions. Word has length 45 [2019-11-22 13:44:05,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:44:05,647 INFO L462 AbstractCegarLoop]: Abstraction has 16565 states and 63900 transitions. [2019-11-22 13:44:05,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-22 13:44:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 16565 states and 63900 transitions. [2019-11-22 13:44:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-22 13:44:05,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:44:05,655 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-22 13:44:06,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:44:06,255 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 13:44:06,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:44:06,256 INFO L82 PathProgramCache]: Analyzing trace with hash -548416362, now seen corresponding path program 2 times [2019-11-22 13:44:06,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:44:06,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447434018] [2019-11-22 13:44:06,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:44:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:44:06,479 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-22 13:44:06,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447434018] [2019-11-22 13:44:06,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:44:06,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 13:44:06,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582225691] [2019-11-22 13:44:06,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 13:44:06,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:44:06,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 13:44:06,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:44:06,484 INFO L87 Difference]: Start difference. First operand 16565 states and 63900 transitions. Second operand 10 states. [2019-11-22 13:44:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:44:07,083 INFO L93 Difference]: Finished difference Result 32695 states and 121435 transitions. [2019-11-22 13:44:07,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 13:44:07,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-22 13:44:07,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:44:07,170 INFO L225 Difference]: With dead ends: 32695 [2019-11-22 13:44:07,171 INFO L226 Difference]: Without dead ends: 29971 [2019-11-22 13:44:07,171 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-22 13:44:07,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29971 states. [2019-11-22 13:44:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29971 to 13517. [2019-11-22 13:44:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13517 states. [2019-11-22 13:44:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13517 states to 13517 states and 52896 transitions. [2019-11-22 13:44:07,709 INFO L78 Accepts]: Start accepts. Automaton has 13517 states and 52896 transitions. Word has length 45 [2019-11-22 13:44:07,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:44:07,710 INFO L462 AbstractCegarLoop]: Abstraction has 13517 states and 52896 transitions. [2019-11-22 13:44:07,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 13:44:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 13517 states and 52896 transitions. [2019-11-22 13:44:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-22 13:44:07,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:44:07,722 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:44:07,722 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 13:44:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:44:07,723 INFO L82 PathProgramCache]: Analyzing trace with hash 337207879, now seen corresponding path program 1 times [2019-11-22 13:44:07,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:44:07,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589568555] [2019-11-22 13:44:07,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:44:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:44:07,811 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-22 13:44:07,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589568555] [2019-11-22 13:44:07,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:44:07,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 13:44:07,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662704693] [2019-11-22 13:44:07,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:44:07,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:44:07,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:44:07,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:44:07,816 INFO L87 Difference]: Start difference. First operand 13517 states and 52896 transitions. Second operand 8 states. [2019-11-22 13:44:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:44:08,102 INFO L93 Difference]: Finished difference Result 22637 states and 85048 transitions. [2019-11-22 13:44:08,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 13:44:08,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-11-22 13:44:08,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:44:08,138 INFO L225 Difference]: With dead ends: 22637 [2019-11-22 13:44:08,138 INFO L226 Difference]: Without dead ends: 16787 [2019-11-22 13:44:08,139 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-22 13:44:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16787 states. [2019-11-22 13:44:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16787 to 12107. [2019-11-22 13:44:08,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12107 states. [2019-11-22 13:44:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12107 states to 12107 states and 45415 transitions. [2019-11-22 13:44:08,523 INFO L78 Accepts]: Start accepts. Automaton has 12107 states and 45415 transitions. Word has length 48 [2019-11-22 13:44:08,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:44:08,524 INFO L462 AbstractCegarLoop]: Abstraction has 12107 states and 45415 transitions. [2019-11-22 13:44:08,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:44:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand 12107 states and 45415 transitions. [2019-11-22 13:44:08,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 13:44:08,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:44:08,540 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:44:08,540 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 13:44:08,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:44:08,541 INFO L82 PathProgramCache]: Analyzing trace with hash -297898423, now seen corresponding path program 1 times [2019-11-22 13:44:08,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:44:08,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25624308] [2019-11-22 13:44:08,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:44:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:44:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 13:44:08,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25624308] [2019-11-22 13:44:08,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354084581] [2019-11-22 13:44:08,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 13:44:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:44:08,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 13:44:08,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:44:08,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:44:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 13:44:08,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:44:08,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-22 13:44:08,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918094633] [2019-11-22 13:44:08,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-22 13:44:08,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:44:08,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-22 13:44:08,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-22 13:44:08,874 INFO L87 Difference]: Start difference. First operand 12107 states and 45415 transitions. Second operand 18 states. [2019-11-22 13:44:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:44:09,586 INFO L93 Difference]: Finished difference Result 22447 states and 81039 transitions. [2019-11-22 13:44:09,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 13:44:09,586 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-11-22 13:44:09,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:44:09,623 INFO L225 Difference]: With dead ends: 22447 [2019-11-22 13:44:09,623 INFO L226 Difference]: Without dead ends: 19931 [2019-11-22 13:44:09,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-22 13:44:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19931 states. [2019-11-22 13:44:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19931 to 12075. [2019-11-22 13:44:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12075 states. [2019-11-22 13:44:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12075 states to 12075 states and 44995 transitions. [2019-11-22 13:44:10,524 INFO L78 Accepts]: Start accepts. Automaton has 12075 states and 44995 transitions. Word has length 52 [2019-11-22 13:44:10,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:44:10,524 INFO L462 AbstractCegarLoop]: Abstraction has 12075 states and 44995 transitions. [2019-11-22 13:44:10,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-22 13:44:10,524 INFO L276 IsEmpty]: Start isEmpty. Operand 12075 states and 44995 transitions. [2019-11-22 13:44:10,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 13:44:10,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:44:10,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] [2019-11-22 13:44:10,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:44:10,748 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 13:44:10,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:44:10,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2054262665, now seen corresponding path program 2 times [2019-11-22 13:44:10,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:44:10,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374213764] [2019-11-22 13:44:10,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:44:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:44:10,927 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-22 13:44:10,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374213764] [2019-11-22 13:44:10,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:44:10,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 13:44:10,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760164466] [2019-11-22 13:44:10,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 13:44:10,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:44:10,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 13:44:10,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:44:10,934 INFO L87 Difference]: Start difference. First operand 12075 states and 44995 transitions. Second operand 10 states. [2019-11-22 13:44:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:44:11,412 INFO L93 Difference]: Finished difference Result 20531 states and 73675 transitions. [2019-11-22 13:44:11,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 13:44:11,413 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-22 13:44:11,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:44:11,460 INFO L225 Difference]: With dead ends: 20531 [2019-11-22 13:44:11,461 INFO L226 Difference]: Without dead ends: 17621 [2019-11-22 13:44:11,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-22 13:44:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17621 states. [2019-11-22 13:44:11,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17621 to 9225. [2019-11-22 13:44:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9225 states. [2019-11-22 13:44:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9225 states to 9225 states and 34430 transitions. [2019-11-22 13:44:11,700 INFO L78 Accepts]: Start accepts. Automaton has 9225 states and 34430 transitions. Word has length 52 [2019-11-22 13:44:11,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:44:11,700 INFO L462 AbstractCegarLoop]: Abstraction has 9225 states and 34430 transitions. [2019-11-22 13:44:11,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 13:44:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 9225 states and 34430 transitions. [2019-11-22 13:44:11,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 13:44:11,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:44:11,712 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:44:11,712 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 13:44:11,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:44:11,713 INFO L82 PathProgramCache]: Analyzing trace with hash 795640873, now seen corresponding path program 1 times [2019-11-22 13:44:11,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:44:11,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576959207] [2019-11-22 13:44:11,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:44:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:44:11,815 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-22 13:44:11,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576959207] [2019-11-22 13:44:11,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:44:11,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 13:44:11,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724878488] [2019-11-22 13:44:11,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 13:44:11,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:44:11,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 13:44:11,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:44:11,817 INFO L87 Difference]: Start difference. First operand 9225 states and 34430 transitions. Second operand 10 states. [2019-11-22 13:44:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:44:12,218 INFO L93 Difference]: Finished difference Result 16565 states and 59274 transitions. [2019-11-22 13:44:12,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 13:44:12,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-22 13:44:12,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:44:12,245 INFO L225 Difference]: With dead ends: 16565 [2019-11-22 13:44:12,245 INFO L226 Difference]: Without dead ends: 13655 [2019-11-22 13:44:12,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-22 13:44:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13655 states. [2019-11-22 13:44:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13655 to 9375. [2019-11-22 13:44:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9375 states. [2019-11-22 13:44:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9375 states to 9375 states and 34645 transitions. [2019-11-22 13:44:12,448 INFO L78 Accepts]: Start accepts. Automaton has 9375 states and 34645 transitions. Word has length 52 [2019-11-22 13:44:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:44:12,449 INFO L462 AbstractCegarLoop]: Abstraction has 9375 states and 34645 transitions. [2019-11-22 13:44:12,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 13:44:12,449 INFO L276 IsEmpty]: Start isEmpty. Operand 9375 states and 34645 transitions. [2019-11-22 13:44:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 13:44:12,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:44:12,457 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:44:12,457 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 13:44:12,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:44:12,458 INFO L82 PathProgramCache]: Analyzing trace with hash 844196999, now seen corresponding path program 2 times [2019-11-22 13:44:12,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:44:12,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330261018] [2019-11-22 13:44:12,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:44:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:44:12,595 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-22 13:44:12,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330261018] [2019-11-22 13:44:12,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:44:12,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 13:44:12,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113024252] [2019-11-22 13:44:12,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 13:44:12,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:44:12,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 13:44:12,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:44:12,598 INFO L87 Difference]: Start difference. First operand 9375 states and 34645 transitions. Second operand 10 states. [2019-11-22 13:44:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:44:13,073 INFO L93 Difference]: Finished difference Result 14255 states and 50473 transitions. [2019-11-22 13:44:13,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 13:44:13,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-22 13:44:13,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:44:13,093 INFO L225 Difference]: With dead ends: 14255 [2019-11-22 13:44:13,093 INFO L226 Difference]: Without dead ends: 11219 [2019-11-22 13:44:13,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-22 13:44:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11219 states. [2019-11-22 13:44:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11219 to 7203. [2019-11-22 13:44:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7203 states. [2019-11-22 13:44:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7203 states to 7203 states and 26359 transitions. [2019-11-22 13:44:13,230 INFO L78 Accepts]: Start accepts. Automaton has 7203 states and 26359 transitions. Word has length 52 [2019-11-22 13:44:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:44:13,230 INFO L462 AbstractCegarLoop]: Abstraction has 7203 states and 26359 transitions. [2019-11-22 13:44:13,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 13:44:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 7203 states and 26359 transitions. [2019-11-22 13:44:13,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 13:44:13,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:44:13,240 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-22 13:44:13,240 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 13:44:13,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:44:13,241 INFO L82 PathProgramCache]: Analyzing trace with hash 407355179, now seen corresponding path program 1 times [2019-11-22 13:44:13,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:44:13,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506499996] [2019-11-22 13:44:13,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:44:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:44:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 13:44:13,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506499996] [2019-11-22 13:44:13,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306292382] [2019-11-22 13:44:13,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 13:44:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:44:13,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 13:44:13,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:44:13,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:44:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 13:44:13,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:44:13,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-22 13:44:13,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526605108] [2019-11-22 13:44:13,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-22 13:44:13,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:44:13,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-22 13:44:13,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-22 13:44:13,632 INFO L87 Difference]: Start difference. First operand 7203 states and 26359 transitions. Second operand 22 states. [2019-11-22 13:44:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:44:14,523 INFO L93 Difference]: Finished difference Result 11819 states and 41675 transitions. [2019-11-22 13:44:14,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-22 13:44:14,524 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-22 13:44:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:44:14,542 INFO L225 Difference]: With dead ends: 11819 [2019-11-22 13:44:14,542 INFO L226 Difference]: Without dead ends: 10559 [2019-11-22 13:44:14,543 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-22 13:44:14,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2019-11-22 13:44:14,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 7023. [2019-11-22 13:44:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7023 states. [2019-11-22 13:44:14,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 25531 transitions. [2019-11-22 13:44:14,672 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 25531 transitions. Word has length 56 [2019-11-22 13:44:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:44:14,673 INFO L462 AbstractCegarLoop]: Abstraction has 7023 states and 25531 transitions. [2019-11-22 13:44:14,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-22 13:44:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 25531 transitions. [2019-11-22 13:44:14,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 13:44:14,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:44:14,682 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-22 13:44:14,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:44:14,883 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 13:44:14,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:44:14,884 INFO L82 PathProgramCache]: Analyzing trace with hash 455911305, now seen corresponding path program 2 times [2019-11-22 13:44:14,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:44:14,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474056] [2019-11-22 13:44:14,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:44:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:44:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 13:44:15,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474056] [2019-11-22 13:44:15,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397882997] [2019-11-22 13:44:15,222 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 13:44:15,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-22 13:44:15,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-22 13:44:15,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 13:44:15,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:44:15,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:44:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 13:44:15,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:44:15,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-22 13:44:15,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117444891] [2019-11-22 13:44:15,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-22 13:44:15,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:44:15,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-22 13:44:15,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-22 13:44:15,524 INFO L87 Difference]: Start difference. First operand 7023 states and 25531 transitions. Second operand 22 states. [2019-11-22 13:44:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:44:16,244 INFO L93 Difference]: Finished difference Result 10319 states and 36435 transitions. [2019-11-22 13:44:16,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-22 13:44:16,245 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-22 13:44:16,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:44:16,258 INFO L225 Difference]: With dead ends: 10319 [2019-11-22 13:44:16,258 INFO L226 Difference]: Without dead ends: 7997 [2019-11-22 13:44:16,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2019-11-22 13:44:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7997 states. [2019-11-22 13:44:16,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7997 to 5837. [2019-11-22 13:44:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5837 states. [2019-11-22 13:44:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5837 states to 5837 states and 21036 transitions. [2019-11-22 13:44:16,359 INFO L78 Accepts]: Start accepts. Automaton has 5837 states and 21036 transitions. Word has length 56 [2019-11-22 13:44:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:44:16,359 INFO L462 AbstractCegarLoop]: Abstraction has 5837 states and 21036 transitions. [2019-11-22 13:44:16,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-22 13:44:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 5837 states and 21036 transitions. [2019-11-22 13:44:16,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 13:44:16,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:44:16,367 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-22 13:44:16,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:44:16,568 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 13:44:16,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:44:16,569 INFO L82 PathProgramCache]: Analyzing trace with hash 663240811, now seen corresponding path program 3 times [2019-11-22 13:44:16,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:44:16,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461520912] [2019-11-22 13:44:16,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:44:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:44:16,674 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-22 13:44:16,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461520912] [2019-11-22 13:44:16,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:44:16,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 13:44:16,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864437856] [2019-11-22 13:44:16,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 13:44:16,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:44:16,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 13:44:16,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-22 13:44:16,677 INFO L87 Difference]: Start difference. First operand 5837 states and 21036 transitions. Second operand 12 states. [2019-11-22 13:44:17,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:44:17,064 INFO L93 Difference]: Finished difference Result 7757 states and 27388 transitions. [2019-11-22 13:44:17,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 13:44:17,065 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-22 13:44:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:44:17,077 INFO L225 Difference]: With dead ends: 7757 [2019-11-22 13:44:17,077 INFO L226 Difference]: Without dead ends: 6497 [2019-11-22 13:44:17,077 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-22 13:44:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6497 states. [2019-11-22 13:44:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6497 to 5177. [2019-11-22 13:44:17,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5177 states. [2019-11-22 13:44:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5177 states to 5177 states and 18560 transitions. [2019-11-22 13:44:17,160 INFO L78 Accepts]: Start accepts. Automaton has 5177 states and 18560 transitions. Word has length 56 [2019-11-22 13:44:17,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:44:17,161 INFO L462 AbstractCegarLoop]: Abstraction has 5177 states and 18560 transitions. [2019-11-22 13:44:17,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 13:44:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 5177 states and 18560 transitions. [2019-11-22 13:44:17,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 13:44:17,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:44:17,168 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-22 13:44:17,168 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 13:44:17,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:44:17,168 INFO L82 PathProgramCache]: Analyzing trace with hash 641585993, now seen corresponding path program 4 times [2019-11-22 13:44:17,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:44:17,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164557135] [2019-11-22 13:44:17,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:44:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:44:17,284 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-22 13:44:17,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164557135] [2019-11-22 13:44:17,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:44:17,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 13:44:17,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118950677] [2019-11-22 13:44:17,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 13:44:17,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:44:17,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 13:44:17,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-22 13:44:17,286 INFO L87 Difference]: Start difference. First operand 5177 states and 18560 transitions. Second operand 12 states. [2019-11-22 13:44:17,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:44:17,670 INFO L93 Difference]: Finished difference Result 7097 states and 24912 transitions. [2019-11-22 13:44:17,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 13:44:17,670 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-22 13:44:17,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:44:17,679 INFO L225 Difference]: With dead ends: 7097 [2019-11-22 13:44:17,679 INFO L226 Difference]: Without dead ends: 5027 [2019-11-22 13:44:17,679 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-22 13:44:17,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2019-11-22 13:44:17,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 4187. [2019-11-22 13:44:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4187 states. [2019-11-22 13:44:17,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 14681 transitions. [2019-11-22 13:44:17,742 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 14681 transitions. Word has length 56 [2019-11-22 13:44:17,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:44:17,742 INFO L462 AbstractCegarLoop]: Abstraction has 4187 states and 14681 transitions. [2019-11-22 13:44:17,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 13:44:17,742 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 14681 transitions. [2019-11-22 13:44:17,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 13:44:17,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:44:17,747 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-22 13:44:17,748 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 13:44:17,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:44:17,748 INFO L82 PathProgramCache]: Analyzing trace with hash 59382823, now seen corresponding path program 5 times [2019-11-22 13:44:17,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:44:17,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104180533] [2019-11-22 13:44:17,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:44:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:44:17,888 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-22 13:44:17,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104180533] [2019-11-22 13:44:17,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:44:17,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 13:44:17,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731694727] [2019-11-22 13:44:17,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 13:44:17,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:44:17,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 13:44:17,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-22 13:44:17,891 INFO L87 Difference]: Start difference. First operand 4187 states and 14681 transitions. Second operand 12 states. [2019-11-22 13:44:18,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:44:18,214 INFO L93 Difference]: Finished difference Result 4787 states and 16621 transitions. [2019-11-22 13:44:18,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 13:44:18,214 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-22 13:44:18,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:44:18,221 INFO L225 Difference]: With dead ends: 4787 [2019-11-22 13:44:18,221 INFO L226 Difference]: Without dead ends: 3527 [2019-11-22 13:44:18,223 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-22 13:44:18,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3527 states. [2019-11-22 13:44:18,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3527 to 3527. [2019-11-22 13:44:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3527 states. [2019-11-22 13:44:18,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 12205 transitions. [2019-11-22 13:44:18,270 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 12205 transitions. Word has length 56 [2019-11-22 13:44:18,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:44:18,270 INFO L462 AbstractCegarLoop]: Abstraction has 3527 states and 12205 transitions. [2019-11-22 13:44:18,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 13:44:18,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 12205 transitions. [2019-11-22 13:44:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 13:44:18,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:44:18,274 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-22 13:44:18,275 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 13:44:18,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:44:18,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1277217831, now seen corresponding path program 6 times [2019-11-22 13:44:18,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:44:18,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536068828] [2019-11-22 13:44:18,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:44:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:44:18,394 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-22 13:44:18,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536068828] [2019-11-22 13:44:18,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:44:18,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 13:44:18,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178200266] [2019-11-22 13:44:18,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 13:44:18,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:44:18,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 13:44:18,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-22 13:44:18,396 INFO L87 Difference]: Start difference. First operand 3527 states and 12205 transitions. Second operand 12 states. [2019-11-22 13:44:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:44:18,628 INFO L93 Difference]: Finished difference Result 3287 states and 11381 transitions. [2019-11-22 13:44:18,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 13:44:18,629 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-22 13:44:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:44:18,629 INFO L225 Difference]: With dead ends: 3287 [2019-11-22 13:44:18,629 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 13:44:18,629 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-22 13:44:18,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 13:44:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 13:44:18,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 13:44:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 13:44:18,630 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-11-22 13:44:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:44:18,630 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 13:44:18,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 13:44:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 13:44:18,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 13:44:18,634 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-22 13:44:18,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:44:18 BasicIcfg [2019-11-22 13:44:18,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 13:44:18,637 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 13:44:18,637 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 13:44:18,637 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 13:44:18,638 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:43:52" (3/4) ... [2019-11-22 13:44:18,641 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 13:44:18,647 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2019-11-22 13:44:18,647 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2019-11-22 13:44:18,651 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-22 13:44:18,652 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-22 13:44:18,652 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-22 13:44:18,687 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 13:44:18,687 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 13:44:18,690 INFO L168 Benchmark]: Toolchain (without parser) took 27804.10 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 961.7 MB in the beginning and 1.5 GB in the end (delta: -504.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-22 13:44:18,690 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 13:44:18,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 683.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -139.6 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-22 13:44:18,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-22 13:44:18,692 INFO L168 Benchmark]: Boogie Preprocessor took 28.25 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-22 13:44:18,693 INFO L168 Benchmark]: RCFGBuilder took 398.75 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: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-11-22 13:44:18,693 INFO L168 Benchmark]: TraceAbstraction took 26562.53 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -436.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-22 13:44:18,694 INFO L168 Benchmark]: Witness Printer took 50.46 ms. Allocated memory is still 2.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2019-11-22 13:44:18,698 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 683.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -139.6 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.25 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 398.75 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: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26562.53 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -436.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 50.46 ms. Allocated memory is still 2.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 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: 26.4s, OverallIterations: 16, TraceHistogramMax: 3, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2462 SDtfs, 7849 SDslu, 13500 SDs, 0 SdLazy, 3663 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34966occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 86614 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 991 NumberOfCodeBlocks, 991 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 971 ConstructedInterpolants, 0 QuantifiedInterpolants, 244626 SizeOfPredicates, 36 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 128/194 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...