/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread/triangular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:41:06,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:41:06,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:41:06,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:41:06,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:41:06,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:41:06,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:41:06,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:41:06,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:41:06,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:41:06,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:41:06,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:41:06,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:41:06,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:41:06,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:41:06,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:41:06,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:41:06,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:41:06,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:41:06,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:41:06,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:41:06,685 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:41:06,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:41:06,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:41:06,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:41:06,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:41:06,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:41:06,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:41:06,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:41:06,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:41:06,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:41:06,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:41:06,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:41:06,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:41:06,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:41:06,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:41:06,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:41:06,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:41:06,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:41:06,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:41:06,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:41:06,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 08:41:06,727 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:41:06,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:41:06,729 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:41:06,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:41:06,729 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:41:06,730 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:41:06,730 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:41:06,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:41:06,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:41:06,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:41:06,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:41:06,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:41:06,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:41:06,732 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:41:06,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:41:06,732 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:41:06,733 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:41:06,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:41:06,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:41:06,733 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:41:06,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:41:06,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:41:06,734 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:41:06,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:41:06,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:41:06,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:41:06,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:41:06,735 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 08:41:06,735 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:41:06,735 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:41:06,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:41:07,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:41:07,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:41:07,013 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:41:07,014 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:41:07,015 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-2.i [2019-12-27 08:41:07,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1cf5b13/f9ee319b53db4a76b6933f66ba57ebeb/FLAG7e969edf6 [2019-12-27 08:41:07,613 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:41:07,614 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i [2019-12-27 08:41:07,631 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1cf5b13/f9ee319b53db4a76b6933f66ba57ebeb/FLAG7e969edf6 [2019-12-27 08:41:08,042 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1cf5b13/f9ee319b53db4a76b6933f66ba57ebeb [2019-12-27 08:41:08,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:41:08,051 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:41:08,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:41:08,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:41:08,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:41:08,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:41:08" (1/1) ... [2019-12-27 08:41:08,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37429fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:08, skipping insertion in model container [2019-12-27 08:41:08,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:41:08" (1/1) ... [2019-12-27 08:41:08,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:41:08,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:41:08,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:41:08,568 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:41:08,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:41:08,684 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:41:08,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:08 WrapperNode [2019-12-27 08:41:08,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:41:08,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:41:08,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:41:08,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:41:08,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:08" (1/1) ... [2019-12-27 08:41:08,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:08" (1/1) ... [2019-12-27 08:41:08,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:41:08,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:41:08,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:41:08,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:41:08,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:08" (1/1) ... [2019-12-27 08:41:08,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:08" (1/1) ... [2019-12-27 08:41:08,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:08" (1/1) ... [2019-12-27 08:41:08,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:08" (1/1) ... [2019-12-27 08:41:08,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:08" (1/1) ... [2019-12-27 08:41:08,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:08" (1/1) ... [2019-12-27 08:41:08,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:08" (1/1) ... [2019-12-27 08:41:08,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:41:08,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:41:08,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:41:08,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:41:08,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:08" (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-12-27 08:41:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 08:41:08,827 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 08:41:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 08:41:08,827 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 08:41:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:41:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 08:41:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:41:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:41:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 08:41:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:41:08,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:41:08,830 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 08:41:09,155 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:41:09,155 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 08:41:09,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:41:09 BoogieIcfgContainer [2019-12-27 08:41:09,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:41:09,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:41:09,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:41:09,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:41:09,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:41:08" (1/3) ... [2019-12-27 08:41:09,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e720a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:41:09, skipping insertion in model container [2019-12-27 08:41:09,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:08" (2/3) ... [2019-12-27 08:41:09,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e720a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:41:09, skipping insertion in model container [2019-12-27 08:41:09,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:41:09" (3/3) ... [2019-12-27 08:41:09,165 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2019-12-27 08:41:09,178 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:41:09,178 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:41:09,189 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 08:41:09,191 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:41:09,216 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,217 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,217 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,220 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,220 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,221 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,221 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,221 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,222 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,222 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,222 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,222 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,225 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,225 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,226 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,226 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,226 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,226 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,227 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,227 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,227 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,232 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,232 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,233 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,233 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,233 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,233 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,234 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,237 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,238 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,238 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,238 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,238 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,239 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,244 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,244 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,244 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,244 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,245 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,245 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:09,259 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 08:41:09,275 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:41:09,275 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:41:09,275 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:41:09,275 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:41:09,276 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:41:09,276 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:41:09,276 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:41:09,276 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:41:09,285 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 51 transitions [2019-12-27 08:41:09,358 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1013 states. [2019-12-27 08:41:09,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states. [2019-12-27 08:41:09,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 08:41:09,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:09,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:09,371 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:09,377 INFO L82 PathProgramCache]: Analyzing trace with hash -910010, now seen corresponding path program 1 times [2019-12-27 08:41:09,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:09,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793320622] [2019-12-27 08:41:09,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:09,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793320622] [2019-12-27 08:41:09,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:09,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:41:09,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212751882] [2019-12-27 08:41:09,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:41:09,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:09,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:41:09,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:41:09,755 INFO L87 Difference]: Start difference. First operand 1013 states. Second operand 5 states. [2019-12-27 08:41:09,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:09,964 INFO L93 Difference]: Finished difference Result 1778 states and 5126 transitions. [2019-12-27 08:41:09,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 08:41:09,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 08:41:09,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:10,003 INFO L225 Difference]: With dead ends: 1778 [2019-12-27 08:41:10,003 INFO L226 Difference]: Without dead ends: 500 [2019-12-27 08:41:10,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:41:10,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-12-27 08:41:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 388. [2019-12-27 08:41:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-27 08:41:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 993 transitions. [2019-12-27 08:41:10,088 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 993 transitions. Word has length 20 [2019-12-27 08:41:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:10,089 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 993 transitions. [2019-12-27 08:41:10,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:41:10,089 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 993 transitions. [2019-12-27 08:41:10,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:41:10,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:10,092 INFO L411 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] [2019-12-27 08:41:10,092 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:10,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:10,093 INFO L82 PathProgramCache]: Analyzing trace with hash 723642448, now seen corresponding path program 1 times [2019-12-27 08:41:10,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:10,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058869640] [2019-12-27 08:41:10,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:10,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058869640] [2019-12-27 08:41:10,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:10,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:41:10,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270786135] [2019-12-27 08:41:10,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:41:10,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:10,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:41:10,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:41:10,297 INFO L87 Difference]: Start difference. First operand 388 states and 993 transitions. Second operand 5 states. [2019-12-27 08:41:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:10,364 INFO L93 Difference]: Finished difference Result 465 states and 1147 transitions. [2019-12-27 08:41:10,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:41:10,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 08:41:10,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:10,369 INFO L225 Difference]: With dead ends: 465 [2019-12-27 08:41:10,369 INFO L226 Difference]: Without dead ends: 344 [2019-12-27 08:41:10,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:41:10,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-12-27 08:41:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 320. [2019-12-27 08:41:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-27 08:41:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 815 transitions. [2019-12-27 08:41:10,418 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 815 transitions. Word has length 23 [2019-12-27 08:41:10,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:10,418 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 815 transitions. [2019-12-27 08:41:10,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:41:10,419 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 815 transitions. [2019-12-27 08:41:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:41:10,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:10,420 INFO L411 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] [2019-12-27 08:41:10,420 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:10,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:10,422 INFO L82 PathProgramCache]: Analyzing trace with hash -660572760, now seen corresponding path program 1 times [2019-12-27 08:41:10,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:10,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94578602] [2019-12-27 08:41:10,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:10,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94578602] [2019-12-27 08:41:10,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:10,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:41:10,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726715331] [2019-12-27 08:41:10,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:41:10,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:10,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:41:10,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:41:10,553 INFO L87 Difference]: Start difference. First operand 320 states and 815 transitions. Second operand 5 states. [2019-12-27 08:41:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:10,635 INFO L93 Difference]: Finished difference Result 421 states and 1017 transitions. [2019-12-27 08:41:10,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:41:10,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 08:41:10,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:10,638 INFO L225 Difference]: With dead ends: 421 [2019-12-27 08:41:10,638 INFO L226 Difference]: Without dead ends: 291 [2019-12-27 08:41:10,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:41:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-27 08:41:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2019-12-27 08:41:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-27 08:41:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 715 transitions. [2019-12-27 08:41:10,651 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 715 transitions. Word has length 23 [2019-12-27 08:41:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:10,651 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 715 transitions. [2019-12-27 08:41:10,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:41:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 715 transitions. [2019-12-27 08:41:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 08:41:10,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:10,653 INFO L411 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] [2019-12-27 08:41:10,653 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:10,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:10,654 INFO L82 PathProgramCache]: Analyzing trace with hash -962769584, now seen corresponding path program 1 times [2019-12-27 08:41:10,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:10,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359100207] [2019-12-27 08:41:10,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:10,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359100207] [2019-12-27 08:41:10,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:10,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:41:10,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352678605] [2019-12-27 08:41:10,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:41:10,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:10,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:41:10,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:41:10,755 INFO L87 Difference]: Start difference. First operand 291 states and 715 transitions. Second operand 6 states. [2019-12-27 08:41:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:10,877 INFO L93 Difference]: Finished difference Result 438 states and 1058 transitions. [2019-12-27 08:41:10,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 08:41:10,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 08:41:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:10,881 INFO L225 Difference]: With dead ends: 438 [2019-12-27 08:41:10,881 INFO L226 Difference]: Without dead ends: 310 [2019-12-27 08:41:10,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 08:41:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-12-27 08:41:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 300. [2019-12-27 08:41:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-12-27 08:41:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 733 transitions. [2019-12-27 08:41:10,894 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 733 transitions. Word has length 26 [2019-12-27 08:41:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:10,894 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 733 transitions. [2019-12-27 08:41:10,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:41:10,895 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 733 transitions. [2019-12-27 08:41:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 08:41:10,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:10,897 INFO L411 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] [2019-12-27 08:41:10,897 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:10,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:10,897 INFO L82 PathProgramCache]: Analyzing trace with hash -971706884, now seen corresponding path program 2 times [2019-12-27 08:41:10,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:10,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408892214] [2019-12-27 08:41:10,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:11,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408892214] [2019-12-27 08:41:11,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:11,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:41:11,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590116188] [2019-12-27 08:41:11,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:41:11,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:11,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:41:11,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:41:11,013 INFO L87 Difference]: Start difference. First operand 300 states and 733 transitions. Second operand 6 states. [2019-12-27 08:41:11,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:11,117 INFO L93 Difference]: Finished difference Result 457 states and 1096 transitions. [2019-12-27 08:41:11,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 08:41:11,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 08:41:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:11,120 INFO L225 Difference]: With dead ends: 457 [2019-12-27 08:41:11,121 INFO L226 Difference]: Without dead ends: 320 [2019-12-27 08:41:11,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:41:11,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-27 08:41:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-12-27 08:41:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-27 08:41:11,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 773 transitions. [2019-12-27 08:41:11,138 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 773 transitions. Word has length 26 [2019-12-27 08:41:11,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:11,139 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 773 transitions. [2019-12-27 08:41:11,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:41:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 773 transitions. [2019-12-27 08:41:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:41:11,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:11,147 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-12-27 08:41:11,149 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:11,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:11,150 INFO L82 PathProgramCache]: Analyzing trace with hash -327915495, now seen corresponding path program 1 times [2019-12-27 08:41:11,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:11,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129156224] [2019-12-27 08:41:11,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:11,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129156224] [2019-12-27 08:41:11,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603324890] [2019-12-27 08:41:11,297 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-12-27 08:41:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:11,387 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:41:11,396 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:11,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:11,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:11,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:11,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 08:41:11,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565169795] [2019-12-27 08:41:11,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 08:41:11,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:11,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 08:41:11,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:41:11,486 INFO L87 Difference]: Start difference. First operand 320 states and 773 transitions. Second operand 8 states. [2019-12-27 08:41:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:11,622 INFO L93 Difference]: Finished difference Result 565 states and 1361 transitions. [2019-12-27 08:41:11,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 08:41:11,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-12-27 08:41:11,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:11,626 INFO L225 Difference]: With dead ends: 565 [2019-12-27 08:41:11,627 INFO L226 Difference]: Without dead ends: 376 [2019-12-27 08:41:11,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:41:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-12-27 08:41:11,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 364. [2019-12-27 08:41:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-12-27 08:41:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 865 transitions. [2019-12-27 08:41:11,647 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 865 transitions. Word has length 30 [2019-12-27 08:41:11,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:11,648 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 865 transitions. [2019-12-27 08:41:11,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 08:41:11,648 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 865 transitions. [2019-12-27 08:41:11,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:41:11,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:11,651 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-12-27 08:41:11,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:11,855 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:11,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:11,856 INFO L82 PathProgramCache]: Analyzing trace with hash -243930643, now seen corresponding path program 1 times [2019-12-27 08:41:11,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:11,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733912320] [2019-12-27 08:41:11,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:11,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733912320] [2019-12-27 08:41:11,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139012363] [2019-12-27 08:41:11,939 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-12-27 08:41:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:12,028 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:41:12,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:12,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:12,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:12,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:12,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:12,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 08:41:12,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716187043] [2019-12-27 08:41:12,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 08:41:12,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:12,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 08:41:12,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:41:12,092 INFO L87 Difference]: Start difference. First operand 364 states and 865 transitions. Second operand 8 states. [2019-12-27 08:41:12,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:12,205 INFO L93 Difference]: Finished difference Result 649 states and 1529 transitions. [2019-12-27 08:41:12,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 08:41:12,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-12-27 08:41:12,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:12,210 INFO L225 Difference]: With dead ends: 649 [2019-12-27 08:41:12,210 INFO L226 Difference]: Without dead ends: 460 [2019-12-27 08:41:12,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:41:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-27 08:41:12,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 392. [2019-12-27 08:41:12,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-12-27 08:41:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 917 transitions. [2019-12-27 08:41:12,226 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 917 transitions. Word has length 30 [2019-12-27 08:41:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:12,227 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 917 transitions. [2019-12-27 08:41:12,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 08:41:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 917 transitions. [2019-12-27 08:41:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 08:41:12,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:12,228 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-12-27 08:41:12,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:12,440 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:12,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:12,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1246329683, now seen corresponding path program 1 times [2019-12-27 08:41:12,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:12,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539795621] [2019-12-27 08:41:12,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:12,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539795621] [2019-12-27 08:41:12,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129069053] [2019-12-27 08:41:12,596 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-12-27 08:41:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:12,674 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 08:41:12,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:12,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:12,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:12,704 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:12,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:12,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 08:41:12,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937411472] [2019-12-27 08:41:12,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 08:41:12,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:12,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 08:41:12,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 08:41:12,709 INFO L87 Difference]: Start difference. First operand 392 states and 917 transitions. Second operand 10 states. [2019-12-27 08:41:12,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:12,907 INFO L93 Difference]: Finished difference Result 775 states and 1830 transitions. [2019-12-27 08:41:12,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 08:41:12,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-12-27 08:41:12,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:12,910 INFO L225 Difference]: With dead ends: 775 [2019-12-27 08:41:12,911 INFO L226 Difference]: Without dead ends: 456 [2019-12-27 08:41:12,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-12-27 08:41:12,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-12-27 08:41:12,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 428. [2019-12-27 08:41:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-12-27 08:41:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 993 transitions. [2019-12-27 08:41:12,926 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 993 transitions. Word has length 38 [2019-12-27 08:41:12,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:12,928 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 993 transitions. [2019-12-27 08:41:12,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 08:41:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 993 transitions. [2019-12-27 08:41:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 08:41:12,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:12,929 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-12-27 08:41:13,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:13,133 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:13,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:13,134 INFO L82 PathProgramCache]: Analyzing trace with hash -40518361, now seen corresponding path program 2 times [2019-12-27 08:41:13,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:13,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8436518] [2019-12-27 08:41:13,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:13,244 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:13,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8436518] [2019-12-27 08:41:13,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110221796] [2019-12-27 08:41:13,245 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-12-27 08:41:13,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:41:13,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:13,322 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 08:41:13,333 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:13,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:13,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:13,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:13,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:13,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 08:41:13,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238437093] [2019-12-27 08:41:13,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 08:41:13,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:13,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 08:41:13,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 08:41:13,369 INFO L87 Difference]: Start difference. First operand 428 states and 993 transitions. Second operand 10 states. [2019-12-27 08:41:13,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:13,544 INFO L93 Difference]: Finished difference Result 685 states and 1601 transitions. [2019-12-27 08:41:13,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 08:41:13,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-12-27 08:41:13,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:13,548 INFO L225 Difference]: With dead ends: 685 [2019-12-27 08:41:13,548 INFO L226 Difference]: Without dead ends: 448 [2019-12-27 08:41:13,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-12-27 08:41:13,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-12-27 08:41:13,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 349. [2019-12-27 08:41:13,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-12-27 08:41:13,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 831 transitions. [2019-12-27 08:41:13,560 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 831 transitions. Word has length 38 [2019-12-27 08:41:13,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:13,561 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 831 transitions. [2019-12-27 08:41:13,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 08:41:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 831 transitions. [2019-12-27 08:41:13,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 08:41:13,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:13,562 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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] [2019-12-27 08:41:13,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:13,766 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:13,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:13,766 INFO L82 PathProgramCache]: Analyzing trace with hash 259200112, now seen corresponding path program 3 times [2019-12-27 08:41:13,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:13,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162414674] [2019-12-27 08:41:13,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:13,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162414674] [2019-12-27 08:41:13,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048279727] [2019-12-27 08:41:13,926 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:13,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 08:41:13,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:13,996 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 08:41:13,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:14,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:14,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:14,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:14,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 08:41:14,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608226485] [2019-12-27 08:41:14,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 08:41:14,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:14,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 08:41:14,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:41:14,045 INFO L87 Difference]: Start difference. First operand 349 states and 831 transitions. Second operand 11 states. [2019-12-27 08:41:14,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:14,235 INFO L93 Difference]: Finished difference Result 705 states and 1641 transitions. [2019-12-27 08:41:14,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 08:41:14,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-12-27 08:41:14,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:14,240 INFO L225 Difference]: With dead ends: 705 [2019-12-27 08:41:14,240 INFO L226 Difference]: Without dead ends: 516 [2019-12-27 08:41:14,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-12-27 08:41:14,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-12-27 08:41:14,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 476. [2019-12-27 08:41:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-12-27 08:41:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1089 transitions. [2019-12-27 08:41:14,254 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1089 transitions. Word has length 42 [2019-12-27 08:41:14,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:14,255 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 1089 transitions. [2019-12-27 08:41:14,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 08:41:14,255 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1089 transitions. [2019-12-27 08:41:14,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 08:41:14,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:14,257 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2019-12-27 08:41:14,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:14,462 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:14,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:14,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1361267571, now seen corresponding path program 4 times [2019-12-27 08:41:14,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:14,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743454994] [2019-12-27 08:41:14,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:14,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743454994] [2019-12-27 08:41:14,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486931325] [2019-12-27 08:41:14,633 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:14,680 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:41:14,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:14,681 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 08:41:14,683 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:14,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:14,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:14,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:14,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 08:41:14,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579571322] [2019-12-27 08:41:14,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:41:14,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:14,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:41:14,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:41:14,723 INFO L87 Difference]: Start difference. First operand 476 states and 1089 transitions. Second operand 12 states. [2019-12-27 08:41:14,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:14,919 INFO L93 Difference]: Finished difference Result 749 states and 1729 transitions. [2019-12-27 08:41:14,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 08:41:14,919 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2019-12-27 08:41:14,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:14,923 INFO L225 Difference]: With dead ends: 749 [2019-12-27 08:41:14,923 INFO L226 Difference]: Without dead ends: 560 [2019-12-27 08:41:14,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2019-12-27 08:41:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-12-27 08:41:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 405. [2019-12-27 08:41:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-12-27 08:41:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 943 transitions. [2019-12-27 08:41:14,938 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 943 transitions. Word has length 46 [2019-12-27 08:41:14,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:14,938 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 943 transitions. [2019-12-27 08:41:14,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:41:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 943 transitions. [2019-12-27 08:41:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 08:41:14,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:14,940 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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-12-27 08:41:15,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:15,153 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:15,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:15,154 INFO L82 PathProgramCache]: Analyzing trace with hash -316809046, now seen corresponding path program 5 times [2019-12-27 08:41:15,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:15,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016301457] [2019-12-27 08:41:15,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:15,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016301457] [2019-12-27 08:41:15,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649094624] [2019-12-27 08:41:15,326 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:15,381 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 08:41:15,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:15,383 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 08:41:15,385 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:15,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:15,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:15,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:15,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-27 08:41:15,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707521107] [2019-12-27 08:41:15,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 08:41:15,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:15,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 08:41:15,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:41:15,422 INFO L87 Difference]: Start difference. First operand 405 states and 943 transitions. Second operand 13 states. [2019-12-27 08:41:15,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:15,640 INFO L93 Difference]: Finished difference Result 887 states and 2054 transitions. [2019-12-27 08:41:15,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:41:15,641 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2019-12-27 08:41:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:15,644 INFO L225 Difference]: With dead ends: 887 [2019-12-27 08:41:15,644 INFO L226 Difference]: Without dead ends: 544 [2019-12-27 08:41:15,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2019-12-27 08:41:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-12-27 08:41:15,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 394. [2019-12-27 08:41:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-12-27 08:41:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 921 transitions. [2019-12-27 08:41:15,655 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 921 transitions. Word has length 50 [2019-12-27 08:41:15,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:15,656 INFO L462 AbstractCegarLoop]: Abstraction has 394 states and 921 transitions. [2019-12-27 08:41:15,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 08:41:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 921 transitions. [2019-12-27 08:41:15,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:41:15,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:15,657 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 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-12-27 08:41:15,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:15,861 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:15,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:15,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1532488761, now seen corresponding path program 6 times [2019-12-27 08:41:15,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:15,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646017048] [2019-12-27 08:41:15,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:16,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646017048] [2019-12-27 08:41:16,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466565522] [2019-12-27 08:41:16,010 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:16,085 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-27 08:41:16,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:41:16,086 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-27 08:41:16,089 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:41:16,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:16,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 08:41:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:16,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:41:16,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-27 08:41:16,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095256689] [2019-12-27 08:41:16,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 08:41:16,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:16,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 08:41:16,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:41:16,126 INFO L87 Difference]: Start difference. First operand 394 states and 921 transitions. Second operand 14 states. [2019-12-27 08:41:16,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:16,477 INFO L93 Difference]: Finished difference Result 789 states and 1809 transitions. [2019-12-27 08:41:16,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:41:16,478 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 08:41:16,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:16,481 INFO L225 Difference]: With dead ends: 789 [2019-12-27 08:41:16,482 INFO L226 Difference]: Without dead ends: 600 [2019-12-27 08:41:16,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2019-12-27 08:41:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-12-27 08:41:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 572. [2019-12-27 08:41:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-12-27 08:41:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1281 transitions. [2019-12-27 08:41:16,497 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1281 transitions. Word has length 54 [2019-12-27 08:41:16,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:16,497 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 1281 transitions. [2019-12-27 08:41:16,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 08:41:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1281 transitions. [2019-12-27 08:41:16,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 08:41:16,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:16,499 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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-12-27 08:41:16,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:41:16,712 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:16,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:16,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1598172444, now seen corresponding path program 7 times [2019-12-27 08:41:16,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:16,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741798009] [2019-12-27 08:41:16,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:41:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:41:16,787 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:41:16,787 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:41:16,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:41:16 BasicIcfg [2019-12-27 08:41:16,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:41:16,880 INFO L168 Benchmark]: Toolchain (without parser) took 8827.54 ms. Allocated memory was 139.5 MB in the beginning and 309.9 MB in the end (delta: 170.4 MB). Free memory was 102.6 MB in the beginning and 233.7 MB in the end (delta: -131.0 MB). Peak memory consumption was 39.4 MB. Max. memory is 7.1 GB. [2019-12-27 08:41:16,884 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 08:41:16,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.85 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 102.4 MB in the beginning and 162.8 MB in the end (delta: -60.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:41:16,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.87 ms. Allocated memory is still 202.9 MB. Free memory was 162.8 MB in the beginning and 160.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 08:41:16,886 INFO L168 Benchmark]: Boogie Preprocessor took 30.29 ms. Allocated memory is still 202.9 MB. Free memory was 160.2 MB in the beginning and 158.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 08:41:16,889 INFO L168 Benchmark]: RCFGBuilder took 392.68 ms. Allocated memory is still 202.9 MB. Free memory was 158.9 MB in the beginning and 139.6 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2019-12-27 08:41:16,890 INFO L168 Benchmark]: TraceAbstraction took 7718.16 ms. Allocated memory was 202.9 MB in the beginning and 309.9 MB in the end (delta: 107.0 MB). Free memory was 139.0 MB in the beginning and 233.7 MB in the end (delta: -94.7 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-12-27 08:41:16,900 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.42 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 632.85 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 102.4 MB in the beginning and 162.8 MB in the end (delta: -60.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.87 ms. Allocated memory is still 202.9 MB. Free memory was 162.8 MB in the beginning and 160.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.29 ms. Allocated memory is still 202.9 MB. Free memory was 160.2 MB in the beginning and 158.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 392.68 ms. Allocated memory is still 202.9 MB. Free memory was 158.9 MB in the beginning and 139.6 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7718.16 ms. Allocated memory was 202.9 MB in the beginning and 309.9 MB in the end (delta: 107.0 MB). Free memory was 139.0 MB in the beginning and 233.7 MB in the end (delta: -94.7 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 703]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L675] 0 int i = 3, j = 6; VAL [i=3, j=6] [L693] 0 pthread_t id1, id2; VAL [i=3, j=6] [L694] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L677] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L695] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L685] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L677] COND TRUE 1 k < 5 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=1, k=0] [L685] COND TRUE 2 k < 5 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L677] COND TRUE 1 k < 5 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L685] COND TRUE 2 k < 5 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L677] COND TRUE 1 k < 5 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=3, k=2] [L685] COND TRUE 2 k < 5 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=2] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L677] COND TRUE 1 k < 5 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=4, k=3] [L685] COND TRUE 2 k < 5 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=3] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L677] COND TRUE 1 k < 5 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L685] COND TRUE 2 k < 5 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L697] 0 int condI = i >= (2*5 +6); [L700] 0 int condJ = j >= (2*5 +6); VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L702] COND TRUE 0 condI || condJ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L703] 0 __VERIFIER_error() VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: UNSAFE, OverallTime: 7.5s, OverallIterations: 14, TraceHistogramMax: 5, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 747 SDtfs, 2153 SDslu, 2906 SDs, 0 SdLazy, 596 SolverSat, 234 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 500 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1013occurred 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: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 726 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 832 NumberOfCodeBlocks, 832 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 753 ConstructedInterpolants, 0 QuantifiedInterpolants, 88587 SizeOfPredicates, 70 NumberOfNonLiveVariables, 888 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 0/244 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 incorrect! Received shutdown request...