/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread/sigma.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:46:35,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:46:35,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:46:36,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:46:36,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:46:36,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:46:36,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:46:36,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:46:36,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:46:36,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:46:36,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:46:36,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:46:36,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:46:36,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:46:36,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:46:36,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:46:36,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:46:36,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:46:36,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:46:36,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:46:36,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:46:36,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:46:36,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:46:36,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:46:36,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:46:36,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:46:36,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:46:36,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:46:36,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:46:36,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:46:36,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:46:36,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:46:36,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:46:36,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:46:36,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:46:36,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:46:36,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:46:36,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:46:36,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:46:36,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:46:36,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:46:36,067 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-SemanticLbe.epf [2019-12-27 00:46:36,094 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:46:36,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:46:36,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:46:36,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:46:36,096 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:46:36,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:46:36,098 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:46:36,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:46:36,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:46:36,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:46:36,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:46:36,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:46:36,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:46:36,100 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:46:36,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:46:36,100 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:46:36,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:46:36,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:46:36,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:46:36,103 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:46:36,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:46:36,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:46:36,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:46:36,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:46:36,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:46:36,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:46:36,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:46:36,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:46:36,104 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:46:36,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:46:36,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:46:36,429 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:46:36,430 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:46:36,431 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:46:36,431 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/sigma.i [2019-12-27 00:46:36,499 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a508c2f9/112831502a7a46c69e97fb4576efea64/FLAG4cda42691 [2019-12-27 00:46:37,079 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:46:37,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/sigma.i [2019-12-27 00:46:37,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a508c2f9/112831502a7a46c69e97fb4576efea64/FLAG4cda42691 [2019-12-27 00:46:37,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a508c2f9/112831502a7a46c69e97fb4576efea64 [2019-12-27 00:46:37,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:46:37,339 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:46:37,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:46:37,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:46:37,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:46:37,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:46:37" (1/1) ... [2019-12-27 00:46:37,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef2d690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:37, skipping insertion in model container [2019-12-27 00:46:37,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:46:37" (1/1) ... [2019-12-27 00:46:37,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:46:37,405 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:46:37,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:46:38,007 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:46:38,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:46:38,255 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:46:38,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:38 WrapperNode [2019-12-27 00:46:38,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:46:38,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:46:38,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:46:38,257 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:46:38,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:38" (1/1) ... [2019-12-27 00:46:38,290 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:38" (1/1) ... [2019-12-27 00:46:38,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:46:38,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:46:38,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:46:38,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:46:38,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:38" (1/1) ... [2019-12-27 00:46:38,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:38" (1/1) ... [2019-12-27 00:46:38,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:38" (1/1) ... [2019-12-27 00:46:38,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:38" (1/1) ... [2019-12-27 00:46:38,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:38" (1/1) ... [2019-12-27 00:46:38,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:38" (1/1) ... [2019-12-27 00:46:38,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:38" (1/1) ... [2019-12-27 00:46:38,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:46:38,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:46:38,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:46:38,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:46:38,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:38" (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 00:46:38,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:46:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-27 00:46:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:46:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 00:46:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:46:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-27 00:46:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-27 00:46:38,414 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2019-12-27 00:46:38,414 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2019-12-27 00:46:38,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:46:38,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:46:38,416 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 00:46:38,855 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:46:38,855 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-27 00:46:38,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:46:38 BoogieIcfgContainer [2019-12-27 00:46:38,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:46:38,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:46:38,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:46:38,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:46:38,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:46:37" (1/3) ... [2019-12-27 00:46:38,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219a23a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:46:38, skipping insertion in model container [2019-12-27 00:46:38,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:46:38" (2/3) ... [2019-12-27 00:46:38,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219a23a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:46:38, skipping insertion in model container [2019-12-27 00:46:38,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:46:38" (3/3) ... [2019-12-27 00:46:38,865 INFO L109 eAbstractionObserver]: Analyzing ICFG sigma.i [2019-12-27 00:46:38,888 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:46:38,889 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:46:38,896 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 00:46:38,897 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:46:38,922 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:38,922 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:38,922 WARN L315 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:38,922 WARN L315 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:38,923 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:38,923 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:38,926 WARN L315 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:38,927 WARN L315 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:38,927 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:38,927 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:38,944 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 00:46:38,962 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:46:38,962 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:46:38,962 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:46:38,962 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:46:38,962 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:46:38,963 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:46:38,963 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:46:38,963 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:46:38,977 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 74 transitions [2019-12-27 00:46:38,979 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 71 places, 74 transitions [2019-12-27 00:46:39,030 INFO L132 PetriNetUnfolder]: 11/111 cut-off events. [2019-12-27 00:46:39,031 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 00:46:39,036 INFO L76 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 111 events. 11/111 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 194 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2019-12-27 00:46:39,038 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 71 places, 74 transitions [2019-12-27 00:46:39,067 INFO L132 PetriNetUnfolder]: 11/111 cut-off events. [2019-12-27 00:46:39,067 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 00:46:39,068 INFO L76 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 111 events. 11/111 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 194 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2019-12-27 00:46:39,070 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 344 [2019-12-27 00:46:39,071 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:46:40,257 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:40,304 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:40,310 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:40,354 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:40,355 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:40,356 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:46:40,372 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:40,412 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:40,419 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:40,471 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:40,472 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:40,473 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:46:42,615 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-12-27 00:46:42,885 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:42,938 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:42,944 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:42,986 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:42,988 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:42,988 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:46:43,005 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:43,048 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:43,054 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:43,100 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:43,102 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:43,102 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:46:45,449 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-12-27 00:46:45,857 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-12-27 00:46:45,988 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-12-27 00:46:45,991 INFO L206 etLargeBlockEncoding]: Checked pairs total: 278 [2019-12-27 00:46:45,991 INFO L214 etLargeBlockEncoding]: Total number of compositions: 61 [2019-12-27 00:46:45,994 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 17 places, 17 transitions [2019-12-27 00:46:46,003 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 36 states. [2019-12-27 00:46:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-12-27 00:46:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 00:46:46,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:46:46,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 00:46:46,014 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:46:46,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:46:46,020 INFO L82 PathProgramCache]: Analyzing trace with hash 8650828, now seen corresponding path program 1 times [2019-12-27 00:46:46,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:46:46,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065870150] [2019-12-27 00:46:46,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:46:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:46:46,288 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 00:46:46,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065870150] [2019-12-27 00:46:46,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:46:46,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:46:46,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148411606] [2019-12-27 00:46:46,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:46:46,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:46:46,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:46:46,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:46:46,315 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states. [2019-12-27 00:46:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:46:46,409 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-12-27 00:46:46,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:46:46,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-27 00:46:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:46:46,425 INFO L225 Difference]: With dead ends: 31 [2019-12-27 00:46:46,426 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 00:46:46,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:46:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 00:46:46,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-27 00:46:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 00:46:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-12-27 00:46:46,459 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 4 [2019-12-27 00:46:46,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:46:46,460 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-12-27 00:46:46,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:46:46,460 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-12-27 00:46:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 00:46:46,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:46:46,461 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-12-27 00:46:46,461 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:46:46,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:46:46,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1422843402, now seen corresponding path program 1 times [2019-12-27 00:46:46,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:46:46,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832622543] [2019-12-27 00:46:46,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:46:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:46:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:46:46,566 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:46:46,566 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:46:46,567 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:46:46,568 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 00:46:46,574 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,574 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,574 WARN L315 ript$VariableManager]: TermVariabe threadThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,574 WARN L315 ript$VariableManager]: TermVariabe threadThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,575 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,575 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,575 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,575 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,575 WARN L315 ript$VariableManager]: TermVariabe threadThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,576 WARN L315 ript$VariableManager]: TermVariabe threadThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,576 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,576 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,576 WARN L315 ript$VariableManager]: TermVariabe threadThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,577 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,577 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,577 WARN L315 ript$VariableManager]: TermVariabe threadThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,579 WARN L315 ript$VariableManager]: TermVariabe threadThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,579 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,579 WARN L315 ript$VariableManager]: TermVariabe threadThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,580 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:46,582 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 00:46:46,583 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:46:46,583 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:46:46,583 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:46:46,583 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:46:46,584 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:46:46,584 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:46:46,584 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:46:46,585 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:46:46,588 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 80 transitions [2019-12-27 00:46:46,588 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 78 places, 80 transitions [2019-12-27 00:46:46,630 INFO L132 PetriNetUnfolder]: 22/199 cut-off events. [2019-12-27 00:46:46,630 INFO L133 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2019-12-27 00:46:46,633 INFO L76 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 199 events. 22/199 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 423 event pairs. 0/169 useless extension candidates. Maximal degree in co-relation 113. Up to 8 conditions per place. [2019-12-27 00:46:46,637 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 78 places, 80 transitions [2019-12-27 00:46:46,698 INFO L132 PetriNetUnfolder]: 22/199 cut-off events. [2019-12-27 00:46:46,701 INFO L133 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2019-12-27 00:46:46,706 INFO L76 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 199 events. 22/199 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 423 event pairs. 0/169 useless extension candidates. Maximal degree in co-relation 113. Up to 8 conditions per place. [2019-12-27 00:46:46,711 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 824 [2019-12-27 00:46:46,711 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:46:47,212 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:47,235 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:47,239 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:47,258 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:47,260 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:47,260 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 00:46:47,272 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:47,303 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:47,308 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:47,333 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:47,334 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:47,335 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 00:46:49,827 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:49,861 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:49,866 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:49,897 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:49,898 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:49,898 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:46:49,918 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:49,952 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:49,956 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:49,985 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:49,986 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:49,986 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:46:52,491 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:52,521 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:52,525 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:52,554 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:52,555 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:52,555 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:46:52,571 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:52,601 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:52,605 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:52,633 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:52,634 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:52,634 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:46:54,741 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:54,791 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:54,794 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:54,835 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:54,836 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:54,837 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:46:54,847 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:54,888 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:54,896 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:54,930 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:54,931 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:54,931 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:46:57,118 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-12-27 00:46:57,470 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-12-27 00:46:57,594 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-12-27 00:46:57,598 INFO L206 etLargeBlockEncoding]: Checked pairs total: 733 [2019-12-27 00:46:57,598 INFO L214 etLargeBlockEncoding]: Total number of compositions: 62 [2019-12-27 00:46:57,599 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 22 transitions [2019-12-27 00:46:57,603 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109 states. [2019-12-27 00:46:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2019-12-27 00:46:57,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 00:46:57,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:46:57,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 00:46:57,605 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:46:57,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:46:57,605 INFO L82 PathProgramCache]: Analyzing trace with hash 13330920, now seen corresponding path program 1 times [2019-12-27 00:46:57,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:46:57,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502854778] [2019-12-27 00:46:57,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:46:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:46:57,663 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 00:46:57,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502854778] [2019-12-27 00:46:57,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:46:57,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:46:57,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522608952] [2019-12-27 00:46:57,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:46:57,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:46:57,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:46:57,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:46:57,666 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 4 states. [2019-12-27 00:46:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:46:57,718 INFO L93 Difference]: Finished difference Result 110 states and 180 transitions. [2019-12-27 00:46:57,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:46:57,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-27 00:46:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:46:57,722 INFO L225 Difference]: With dead ends: 110 [2019-12-27 00:46:57,722 INFO L226 Difference]: Without dead ends: 103 [2019-12-27 00:46:57,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:46:57,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-27 00:46:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2019-12-27 00:46:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-27 00:46:57,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 164 transitions. [2019-12-27 00:46:57,737 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 164 transitions. Word has length 4 [2019-12-27 00:46:57,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:46:57,737 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 164 transitions. [2019-12-27 00:46:57,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:46:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 164 transitions. [2019-12-27 00:46:57,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:46:57,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:46:57,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:46:57,739 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:46:57,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:46:57,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1478794564, now seen corresponding path program 1 times [2019-12-27 00:46:57,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:46:57,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628355075] [2019-12-27 00:46:57,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:46:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:46:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:46:57,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628355075] [2019-12-27 00:46:57,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665516363] [2019-12-27 00:46:57,809 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 00:46:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:46:57,881 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 00:46:57,883 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:46:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:46:57,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:46:57,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-12-27 00:46:57,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35744637] [2019-12-27 00:46:57,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:46:57,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:46:57,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:46:57,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:46:57,920 INFO L87 Difference]: Start difference. First operand 97 states and 164 transitions. Second operand 6 states. [2019-12-27 00:46:57,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:46:57,982 INFO L93 Difference]: Finished difference Result 95 states and 159 transitions. [2019-12-27 00:46:57,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:46:57,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 00:46:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:46:57,986 INFO L225 Difference]: With dead ends: 95 [2019-12-27 00:46:57,986 INFO L226 Difference]: Without dead ends: 95 [2019-12-27 00:46:57,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:46:57,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-27 00:46:58,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-12-27 00:46:58,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-27 00:46:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 159 transitions. [2019-12-27 00:46:58,005 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 159 transitions. Word has length 17 [2019-12-27 00:46:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:46:58,006 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 159 transitions. [2019-12-27 00:46:58,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:46:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 159 transitions. [2019-12-27 00:46:58,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:46:58,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:46:58,007 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-12-27 00:46:58,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:46:58,211 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:46:58,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:46:58,211 INFO L82 PathProgramCache]: Analyzing trace with hash -273903233, now seen corresponding path program 1 times [2019-12-27 00:46:58,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:46:58,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652357962] [2019-12-27 00:46:58,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:46:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:46:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:46:58,282 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:46:58,282 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:46:58,282 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:46:58,283 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 00:46:58,293 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,293 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,293 WARN L315 ript$VariableManager]: TermVariabe threadThread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,293 WARN L315 ript$VariableManager]: TermVariabe threadThread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,294 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,294 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,294 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,295 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,295 WARN L315 ript$VariableManager]: TermVariabe threadThread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,295 WARN L315 ript$VariableManager]: TermVariabe threadThread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,295 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,295 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,296 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,296 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,296 WARN L315 ript$VariableManager]: TermVariabe threadThread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,296 WARN L315 ript$VariableManager]: TermVariabe threadThread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,296 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,296 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,298 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,298 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,298 WARN L315 ript$VariableManager]: TermVariabe threadThread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,298 WARN L315 ript$VariableManager]: TermVariabe threadThread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,311 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,312 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,312 WARN L315 ript$VariableManager]: TermVariabe threadThread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,312 WARN L315 ript$VariableManager]: TermVariabe threadThread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,314 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,314 WARN L315 ript$VariableManager]: TermVariabe threadThread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,314 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,314 WARN L315 ript$VariableManager]: TermVariabe threadThread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:46:58,318 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 00:46:58,318 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:46:58,318 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:46:58,319 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:46:58,319 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:46:58,319 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:46:58,319 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:46:58,319 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:46:58,319 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:46:58,324 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 86 transitions [2019-12-27 00:46:58,324 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 85 places, 86 transitions [2019-12-27 00:46:58,389 INFO L132 PetriNetUnfolder]: 44/358 cut-off events. [2019-12-27 00:46:58,389 INFO L133 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2019-12-27 00:46:58,392 INFO L76 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 358 events. 44/358 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1032 event pairs. 0/302 useless extension candidates. Maximal degree in co-relation 207. Up to 16 conditions per place. [2019-12-27 00:46:58,397 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 85 places, 86 transitions [2019-12-27 00:46:58,435 INFO L132 PetriNetUnfolder]: 44/358 cut-off events. [2019-12-27 00:46:58,435 INFO L133 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2019-12-27 00:46:58,438 INFO L76 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 358 events. 44/358 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1032 event pairs. 0/302 useless extension candidates. Maximal degree in co-relation 207. Up to 16 conditions per place. [2019-12-27 00:46:58,444 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1320 [2019-12-27 00:46:58,445 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:46:58,954 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:58,995 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:58,999 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:59,025 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:59,026 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:59,026 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 00:46:59,042 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:59,065 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:59,075 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:59,094 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:46:59,095 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:46:59,095 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 00:47:01,606 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:01,644 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:01,649 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:01,683 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:01,684 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:01,684 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:47:01,703 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:01,747 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:01,753 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:01,798 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:01,799 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:01,800 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:47:04,086 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:04,125 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:04,128 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:04,163 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:04,164 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:04,165 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:47:04,174 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:04,216 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:04,220 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:04,259 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:04,259 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:04,260 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:47:06,581 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-12-27 00:47:06,958 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-12-27 00:47:07,059 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1071 [2019-12-27 00:47:07,059 INFO L214 etLargeBlockEncoding]: Total number of compositions: 67 [2019-12-27 00:47:07,059 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 25 transitions [2019-12-27 00:47:07,072 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 297 states. [2019-12-27 00:47:07,072 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states. [2019-12-27 00:47:07,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 00:47:07,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:07,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 00:47:07,073 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:07,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:07,073 INFO L82 PathProgramCache]: Analyzing trace with hash 18343786, now seen corresponding path program 1 times [2019-12-27 00:47:07,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:07,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153781893] [2019-12-27 00:47:07,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:07,113 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 00:47:07,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153781893] [2019-12-27 00:47:07,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:47:07,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:47:07,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981325158] [2019-12-27 00:47:07,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:47:07,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:07,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:47:07,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:47:07,115 INFO L87 Difference]: Start difference. First operand 297 states. Second operand 3 states. [2019-12-27 00:47:07,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:07,144 INFO L93 Difference]: Finished difference Result 297 states and 636 transitions. [2019-12-27 00:47:07,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:47:07,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-27 00:47:07,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:07,149 INFO L225 Difference]: With dead ends: 297 [2019-12-27 00:47:07,149 INFO L226 Difference]: Without dead ends: 268 [2019-12-27 00:47:07,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:47:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-27 00:47:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2019-12-27 00:47:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-12-27 00:47:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 580 transitions. [2019-12-27 00:47:07,176 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 580 transitions. Word has length 4 [2019-12-27 00:47:07,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:07,177 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 580 transitions. [2019-12-27 00:47:07,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:47:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 580 transitions. [2019-12-27 00:47:07,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 00:47:07,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:07,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:07,178 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:07,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:07,178 INFO L82 PathProgramCache]: Analyzing trace with hash -193871239, now seen corresponding path program 1 times [2019-12-27 00:47:07,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:07,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697503683] [2019-12-27 00:47:07,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 00:47:07,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697503683] [2019-12-27 00:47:07,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:47:07,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:47:07,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397893372] [2019-12-27 00:47:07,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:47:07,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:07,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:47:07,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:47:07,225 INFO L87 Difference]: Start difference. First operand 268 states and 580 transitions. Second operand 4 states. [2019-12-27 00:47:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:07,267 INFO L93 Difference]: Finished difference Result 299 states and 612 transitions. [2019-12-27 00:47:07,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:47:07,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-27 00:47:07,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:07,272 INFO L225 Difference]: With dead ends: 299 [2019-12-27 00:47:07,272 INFO L226 Difference]: Without dead ends: 299 [2019-12-27 00:47:07,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:47:07,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-27 00:47:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 277. [2019-12-27 00:47:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-27 00:47:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 577 transitions. [2019-12-27 00:47:07,301 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 577 transitions. Word has length 10 [2019-12-27 00:47:07,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:07,301 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 577 transitions. [2019-12-27 00:47:07,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:47:07,301 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 577 transitions. [2019-12-27 00:47:07,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:47:07,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:07,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:07,305 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:07,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:07,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1584588976, now seen corresponding path program 1 times [2019-12-27 00:47:07,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:07,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821437997] [2019-12-27 00:47:07,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:07,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821437997] [2019-12-27 00:47:07,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596947621] [2019-12-27 00:47:07,383 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 00:47:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:07,445 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 00:47:07,447 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:07,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:07,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-12-27 00:47:07,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159887870] [2019-12-27 00:47:07,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:47:07,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:07,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:47:07,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:47:07,469 INFO L87 Difference]: Start difference. First operand 277 states and 577 transitions. Second operand 6 states. [2019-12-27 00:47:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:07,510 INFO L93 Difference]: Finished difference Result 275 states and 572 transitions. [2019-12-27 00:47:07,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:47:07,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 00:47:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:07,514 INFO L225 Difference]: With dead ends: 275 [2019-12-27 00:47:07,514 INFO L226 Difference]: Without dead ends: 275 [2019-12-27 00:47:07,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:47:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-27 00:47:07,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2019-12-27 00:47:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-12-27 00:47:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 572 transitions. [2019-12-27 00:47:07,526 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 572 transitions. Word has length 17 [2019-12-27 00:47:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:07,527 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 572 transitions. [2019-12-27 00:47:07,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:47:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 572 transitions. [2019-12-27 00:47:07,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:47:07,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:07,529 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:07,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:07,733 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:07,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:07,733 INFO L82 PathProgramCache]: Analyzing trace with hash 2065278432, now seen corresponding path program 1 times [2019-12-27 00:47:07,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:07,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338258634] [2019-12-27 00:47:07,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:07,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338258634] [2019-12-27 00:47:07,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008469619] [2019-12-27 00:47:07,828 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 00:47:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:07,892 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-27 00:47:07,893 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:07,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:07,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-12-27 00:47:07,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80299752] [2019-12-27 00:47:07,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 00:47:07,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:07,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 00:47:07,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:47:07,935 INFO L87 Difference]: Start difference. First operand 275 states and 572 transitions. Second operand 8 states. [2019-12-27 00:47:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:08,001 INFO L93 Difference]: Finished difference Result 271 states and 560 transitions. [2019-12-27 00:47:08,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:47:08,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-12-27 00:47:08,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:08,003 INFO L225 Difference]: With dead ends: 271 [2019-12-27 00:47:08,004 INFO L226 Difference]: Without dead ends: 271 [2019-12-27 00:47:08,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:47:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-27 00:47:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2019-12-27 00:47:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-12-27 00:47:08,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 560 transitions. [2019-12-27 00:47:08,016 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 560 transitions. Word has length 23 [2019-12-27 00:47:08,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:08,016 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 560 transitions. [2019-12-27 00:47:08,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 00:47:08,016 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 560 transitions. [2019-12-27 00:47:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:47:08,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:08,018 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2019-12-27 00:47:08,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:08,223 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:08,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:08,223 INFO L82 PathProgramCache]: Analyzing trace with hash -319556423, now seen corresponding path program 1 times [2019-12-27 00:47:08,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:08,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821789953] [2019-12-27 00:47:08,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:47:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:47:08,297 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:47:08,298 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:47:08,298 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:47:08,298 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 00:47:08,304 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,305 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,305 WARN L315 ript$VariableManager]: TermVariabe threadThread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,305 WARN L315 ript$VariableManager]: TermVariabe threadThread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,305 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,305 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,306 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,306 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,306 WARN L315 ript$VariableManager]: TermVariabe threadThread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,306 WARN L315 ript$VariableManager]: TermVariabe threadThread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,306 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,306 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,307 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,307 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,307 WARN L315 ript$VariableManager]: TermVariabe threadThread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,307 WARN L315 ript$VariableManager]: TermVariabe threadThread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,307 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,307 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,308 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,308 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,308 WARN L315 ript$VariableManager]: TermVariabe threadThread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,308 WARN L315 ript$VariableManager]: TermVariabe threadThread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,308 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,308 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,309 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,309 WARN L315 ript$VariableManager]: TermVariabe threadThread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,309 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,309 WARN L315 ript$VariableManager]: TermVariabe threadThread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,310 WARN L315 ript$VariableManager]: TermVariabe threadThread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,311 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,311 WARN L315 ript$VariableManager]: TermVariabe threadThread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,311 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,317 WARN L315 ript$VariableManager]: TermVariabe threadThread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,317 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,318 WARN L315 ript$VariableManager]: TermVariabe threadThread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,318 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,319 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,319 WARN L315 ript$VariableManager]: TermVariabe threadThread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,319 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,320 WARN L315 ript$VariableManager]: TermVariabe threadThread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:08,328 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 00:47:08,329 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:47:08,329 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:47:08,329 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:47:08,329 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:47:08,329 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:47:08,329 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:47:08,329 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:47:08,329 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:47:08,331 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 92 transitions [2019-12-27 00:47:08,331 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 92 places, 92 transitions [2019-12-27 00:47:08,408 INFO L132 PetriNetUnfolder]: 90/661 cut-off events. [2019-12-27 00:47:08,408 INFO L133 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2019-12-27 00:47:08,413 INFO L76 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 661 events. 90/661 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2629 event pairs. 0/555 useless extension candidates. Maximal degree in co-relation 378. Up to 32 conditions per place. [2019-12-27 00:47:08,426 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 92 places, 92 transitions [2019-12-27 00:47:08,525 INFO L132 PetriNetUnfolder]: 90/661 cut-off events. [2019-12-27 00:47:08,526 INFO L133 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2019-12-27 00:47:08,531 INFO L76 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 661 events. 90/661 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2629 event pairs. 0/555 useless extension candidates. Maximal degree in co-relation 378. Up to 32 conditions per place. [2019-12-27 00:47:08,548 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1872 [2019-12-27 00:47:08,548 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:47:09,129 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:09,161 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:09,166 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:09,199 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:09,200 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:09,200 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:47:09,211 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:09,245 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:09,250 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:09,280 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:09,281 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:09,281 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:47:11,852 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:11,890 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:11,895 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:11,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:11,937 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:11,937 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:47:11,947 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:11,985 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:11,989 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:12,024 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:12,025 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:12,026 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:47:14,404 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-27 00:47:14,729 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-12-27 00:47:15,047 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-12-27 00:47:15,149 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1448 [2019-12-27 00:47:15,149 INFO L214 etLargeBlockEncoding]: Total number of compositions: 68 [2019-12-27 00:47:15,149 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 28 transitions [2019-12-27 00:47:15,173 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 817 states. [2019-12-27 00:47:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states. [2019-12-27 00:47:15,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 00:47:15,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:15,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 00:47:15,174 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:15,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:15,174 INFO L82 PathProgramCache]: Analyzing trace with hash 23578740, now seen corresponding path program 1 times [2019-12-27 00:47:15,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:15,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800575727] [2019-12-27 00:47:15,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:15,216 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 00:47:15,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800575727] [2019-12-27 00:47:15,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:47:15,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:47:15,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540291235] [2019-12-27 00:47:15,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:47:15,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:15,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:47:15,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:47:15,218 INFO L87 Difference]: Start difference. First operand 817 states. Second operand 4 states. [2019-12-27 00:47:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:15,277 INFO L93 Difference]: Finished difference Result 910 states and 2204 transitions. [2019-12-27 00:47:15,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:47:15,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-27 00:47:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:15,284 INFO L225 Difference]: With dead ends: 910 [2019-12-27 00:47:15,284 INFO L226 Difference]: Without dead ends: 843 [2019-12-27 00:47:15,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:47:15,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-12-27 00:47:15,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 781. [2019-12-27 00:47:15,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-12-27 00:47:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1934 transitions. [2019-12-27 00:47:15,314 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1934 transitions. Word has length 4 [2019-12-27 00:47:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:15,315 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 1934 transitions. [2019-12-27 00:47:15,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:47:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1934 transitions. [2019-12-27 00:47:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:47:15,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:15,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:15,316 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:15,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:15,317 INFO L82 PathProgramCache]: Analyzing trace with hash -174506730, now seen corresponding path program 1 times [2019-12-27 00:47:15,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:15,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656161514] [2019-12-27 00:47:15,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:15,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656161514] [2019-12-27 00:47:15,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078984559] [2019-12-27 00:47:15,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 00:47:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:15,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 00:47:15,436 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:15,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:15,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-12-27 00:47:15,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898805975] [2019-12-27 00:47:15,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:47:15,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:15,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:47:15,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:47:15,478 INFO L87 Difference]: Start difference. First operand 781 states and 1934 transitions. Second operand 7 states. [2019-12-27 00:47:15,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:15,549 INFO L93 Difference]: Finished difference Result 834 states and 1946 transitions. [2019-12-27 00:47:15,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:47:15,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-27 00:47:15,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:15,556 INFO L225 Difference]: With dead ends: 834 [2019-12-27 00:47:15,556 INFO L226 Difference]: Without dead ends: 834 [2019-12-27 00:47:15,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:47:15,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-12-27 00:47:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 788. [2019-12-27 00:47:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-12-27 00:47:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1868 transitions. [2019-12-27 00:47:15,585 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1868 transitions. Word has length 17 [2019-12-27 00:47:15,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:15,585 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1868 transitions. [2019-12-27 00:47:15,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:47:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1868 transitions. [2019-12-27 00:47:15,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 00:47:15,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:15,587 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:15,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:15,791 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:15,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:15,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1444925388, now seen corresponding path program 1 times [2019-12-27 00:47:15,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:15,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174812346] [2019-12-27 00:47:15,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:47:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:47:15,873 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:47:15,874 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:47:15,874 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:47:15,874 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 00:47:15,882 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,882 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,882 WARN L315 ript$VariableManager]: TermVariabe threadThread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,882 WARN L315 ript$VariableManager]: TermVariabe threadThread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,883 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,883 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,883 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,883 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,883 WARN L315 ript$VariableManager]: TermVariabe threadThread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,883 WARN L315 ript$VariableManager]: TermVariabe threadThread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,884 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,884 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,884 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,884 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,884 WARN L315 ript$VariableManager]: TermVariabe threadThread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,884 WARN L315 ript$VariableManager]: TermVariabe threadThread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,885 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,885 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,885 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,885 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,885 WARN L315 ript$VariableManager]: TermVariabe threadThread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,885 WARN L315 ript$VariableManager]: TermVariabe threadThread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,885 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,886 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,886 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,886 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,886 WARN L315 ript$VariableManager]: TermVariabe threadThread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,886 WARN L315 ript$VariableManager]: TermVariabe threadThread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,886 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,886 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,887 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,887 WARN L315 ript$VariableManager]: TermVariabe threadThread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,887 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,887 WARN L315 ript$VariableManager]: TermVariabe threadThread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,889 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,889 WARN L315 ript$VariableManager]: TermVariabe threadThread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,889 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,889 WARN L315 ript$VariableManager]: TermVariabe threadThread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,890 WARN L315 ript$VariableManager]: TermVariabe threadThread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,891 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,891 WARN L315 ript$VariableManager]: TermVariabe threadThread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,891 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,893 WARN L315 ript$VariableManager]: TermVariabe threadThread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,893 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,893 WARN L315 ript$VariableManager]: TermVariabe threadThread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,893 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,899 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,899 WARN L315 ript$VariableManager]: TermVariabe threadThread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,899 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,899 WARN L315 ript$VariableManager]: TermVariabe threadThread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:15,903 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 00:47:15,904 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:47:15,904 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:47:15,904 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:47:15,904 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:47:15,904 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:47:15,905 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:47:15,905 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:47:15,905 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:47:15,908 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 98 transitions [2019-12-27 00:47:15,908 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 99 places, 98 transitions [2019-12-27 00:47:16,127 INFO L132 PetriNetUnfolder]: 188/1256 cut-off events. [2019-12-27 00:47:16,127 INFO L133 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2019-12-27 00:47:16,137 INFO L76 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 1256 events. 188/1256 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6683 event pairs. 0/1052 useless extension candidates. Maximal degree in co-relation 706. Up to 80 conditions per place. [2019-12-27 00:47:16,175 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 99 places, 98 transitions [2019-12-27 00:47:16,481 INFO L132 PetriNetUnfolder]: 188/1256 cut-off events. [2019-12-27 00:47:16,482 INFO L133 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2019-12-27 00:47:16,493 INFO L76 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 1256 events. 188/1256 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6683 event pairs. 0/1052 useless extension candidates. Maximal degree in co-relation 706. Up to 80 conditions per place. [2019-12-27 00:47:16,519 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2480 [2019-12-27 00:47:16,519 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:47:16,824 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:16,851 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:16,855 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:16,876 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:16,877 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:16,878 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 00:47:16,894 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:16,917 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:16,921 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:16,939 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:16,940 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:16,940 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 00:47:19,585 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:19,625 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:19,628 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:19,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:19,662 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:19,662 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:47:19,686 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:19,722 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:19,726 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:19,755 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:19,756 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:19,757 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:47:22,373 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:22,409 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:22,413 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:22,450 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:22,451 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:22,451 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:47:22,462 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:22,505 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:22,509 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:22,559 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:22,560 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:22,561 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:47:24,787 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-12-27 00:47:25,152 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-27 00:47:25,273 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-12-27 00:47:25,308 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2037 [2019-12-27 00:47:25,308 INFO L214 etLargeBlockEncoding]: Total number of compositions: 72 [2019-12-27 00:47:25,309 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 31 transitions [2019-12-27 00:47:25,417 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2289 states. [2019-12-27 00:47:25,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states. [2019-12-27 00:47:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 00:47:25,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:25,418 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 00:47:25,418 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:25,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:25,419 INFO L82 PathProgramCache]: Analyzing trace with hash 29088089, now seen corresponding path program 1 times [2019-12-27 00:47:25,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:25,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233941631] [2019-12-27 00:47:25,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:25,434 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 00:47:25,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233941631] [2019-12-27 00:47:25,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:47:25,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:47:25,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387038221] [2019-12-27 00:47:25,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:47:25,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:25,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:47:25,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:47:25,436 INFO L87 Difference]: Start difference. First operand 2289 states. Second operand 3 states. [2019-12-27 00:47:25,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:25,479 INFO L93 Difference]: Finished difference Result 2289 states and 6658 transitions. [2019-12-27 00:47:25,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:47:25,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-27 00:47:25,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:25,493 INFO L225 Difference]: With dead ends: 2289 [2019-12-27 00:47:25,494 INFO L226 Difference]: Without dead ends: 2044 [2019-12-27 00:47:25,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:47:25,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2019-12-27 00:47:25,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2044. [2019-12-27 00:47:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2019-12-27 00:47:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 6008 transitions. [2019-12-27 00:47:25,558 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 6008 transitions. Word has length 4 [2019-12-27 00:47:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:25,558 INFO L462 AbstractCegarLoop]: Abstraction has 2044 states and 6008 transitions. [2019-12-27 00:47:25,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:47:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 6008 transitions. [2019-12-27 00:47:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 00:47:25,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:25,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:25,559 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:25,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:25,560 INFO L82 PathProgramCache]: Analyzing trace with hash 138335209, now seen corresponding path program 1 times [2019-12-27 00:47:25,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:25,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013929812] [2019-12-27 00:47:25,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 00:47:25,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013929812] [2019-12-27 00:47:25,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:47:25,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:47:25,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798224081] [2019-12-27 00:47:25,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:47:25,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:25,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:47:25,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:47:25,602 INFO L87 Difference]: Start difference. First operand 2044 states and 6008 transitions. Second operand 4 states. [2019-12-27 00:47:25,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:25,653 INFO L93 Difference]: Finished difference Result 2379 states and 6766 transitions. [2019-12-27 00:47:25,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:47:25,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-27 00:47:25,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:25,670 INFO L225 Difference]: With dead ends: 2379 [2019-12-27 00:47:25,670 INFO L226 Difference]: Without dead ends: 2379 [2019-12-27 00:47:25,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:47:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2019-12-27 00:47:25,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2221. [2019-12-27 00:47:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2221 states. [2019-12-27 00:47:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 6367 transitions. [2019-12-27 00:47:25,742 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 6367 transitions. Word has length 10 [2019-12-27 00:47:25,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:25,742 INFO L462 AbstractCegarLoop]: Abstraction has 2221 states and 6367 transitions. [2019-12-27 00:47:25,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:47:25,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 6367 transitions. [2019-12-27 00:47:25,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:47:25,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:25,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:25,743 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:25,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1136182213, now seen corresponding path program 1 times [2019-12-27 00:47:25,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:25,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666483177] [2019-12-27 00:47:25,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:25,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666483177] [2019-12-27 00:47:25,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492850082] [2019-12-27 00:47:25,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 00:47:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:25,846 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 00:47:25,847 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:25,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:25,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-12-27 00:47:25,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334183285] [2019-12-27 00:47:25,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:47:25,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:25,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:47:25,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:47:25,868 INFO L87 Difference]: Start difference. First operand 2221 states and 6367 transitions. Second operand 6 states. [2019-12-27 00:47:25,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:25,913 INFO L93 Difference]: Finished difference Result 2219 states and 6362 transitions. [2019-12-27 00:47:25,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:47:25,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 00:47:25,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:25,929 INFO L225 Difference]: With dead ends: 2219 [2019-12-27 00:47:25,929 INFO L226 Difference]: Without dead ends: 2219 [2019-12-27 00:47:25,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:47:25,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2019-12-27 00:47:25,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2219. [2019-12-27 00:47:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2219 states. [2019-12-27 00:47:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 6362 transitions. [2019-12-27 00:47:25,999 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 6362 transitions. Word has length 17 [2019-12-27 00:47:26,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:26,000 INFO L462 AbstractCegarLoop]: Abstraction has 2219 states and 6362 transitions. [2019-12-27 00:47:26,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:47:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 6362 transitions. [2019-12-27 00:47:26,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:47:26,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:26,002 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:26,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:26,214 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:26,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:26,215 INFO L82 PathProgramCache]: Analyzing trace with hash -130574714, now seen corresponding path program 1 times [2019-12-27 00:47:26,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:26,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606967332] [2019-12-27 00:47:26,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:26,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606967332] [2019-12-27 00:47:26,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821769051] [2019-12-27 00:47:26,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 00:47:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:26,340 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-27 00:47:26,341 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:26,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:26,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-12-27 00:47:26,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605569560] [2019-12-27 00:47:26,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 00:47:26,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:26,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 00:47:26,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:47:26,365 INFO L87 Difference]: Start difference. First operand 2219 states and 6362 transitions. Second operand 8 states. [2019-12-27 00:47:26,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:26,451 INFO L93 Difference]: Finished difference Result 2215 states and 6350 transitions. [2019-12-27 00:47:26,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:47:26,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-12-27 00:47:26,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:26,514 INFO L225 Difference]: With dead ends: 2215 [2019-12-27 00:47:26,515 INFO L226 Difference]: Without dead ends: 2215 [2019-12-27 00:47:26,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:47:26,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2019-12-27 00:47:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2215. [2019-12-27 00:47:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2215 states. [2019-12-27 00:47:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 6350 transitions. [2019-12-27 00:47:26,588 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 6350 transitions. Word has length 23 [2019-12-27 00:47:26,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:26,588 INFO L462 AbstractCegarLoop]: Abstraction has 2215 states and 6350 transitions. [2019-12-27 00:47:26,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 00:47:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 6350 transitions. [2019-12-27 00:47:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 00:47:26,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:26,590 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:26,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:26,794 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:26,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:26,794 INFO L82 PathProgramCache]: Analyzing trace with hash -255340588, now seen corresponding path program 1 times [2019-12-27 00:47:26,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:26,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883566377] [2019-12-27 00:47:26,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:26,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883566377] [2019-12-27 00:47:26,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789072635] [2019-12-27 00:47:26,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 00:47:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:26,923 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:47:26,924 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:26,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:26,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-12-27 00:47:26,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851364291] [2019-12-27 00:47:26,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 00:47:26,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:26,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 00:47:26,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-12-27 00:47:26,967 INFO L87 Difference]: Start difference. First operand 2215 states and 6350 transitions. Second operand 10 states. [2019-12-27 00:47:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:27,048 INFO L93 Difference]: Finished difference Result 2207 states and 6322 transitions. [2019-12-27 00:47:27,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:47:27,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-12-27 00:47:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:27,064 INFO L225 Difference]: With dead ends: 2207 [2019-12-27 00:47:27,064 INFO L226 Difference]: Without dead ends: 2207 [2019-12-27 00:47:27,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-12-27 00:47:27,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2019-12-27 00:47:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2207. [2019-12-27 00:47:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2019-12-27 00:47:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 6322 transitions. [2019-12-27 00:47:27,125 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 6322 transitions. Word has length 29 [2019-12-27 00:47:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:27,126 INFO L462 AbstractCegarLoop]: Abstraction has 2207 states and 6322 transitions. [2019-12-27 00:47:27,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 00:47:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 6322 transitions. [2019-12-27 00:47:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 00:47:27,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:27,128 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:27,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:27,332 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:27,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:27,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1503593471, now seen corresponding path program 1 times [2019-12-27 00:47:27,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:27,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064420736] [2019-12-27 00:47:27,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:27,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064420736] [2019-12-27 00:47:27,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932256442] [2019-12-27 00:47:27,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 00:47:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:27,481 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:47:27,490 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:27,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:27,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-12-27 00:47:27,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929958110] [2019-12-27 00:47:27,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:47:27,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:27,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:47:27,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:47:27,543 INFO L87 Difference]: Start difference. First operand 2207 states and 6322 transitions. Second operand 12 states. [2019-12-27 00:47:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:27,687 INFO L93 Difference]: Finished difference Result 2191 states and 6258 transitions. [2019-12-27 00:47:27,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:47:27,687 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-12-27 00:47:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:27,700 INFO L225 Difference]: With dead ends: 2191 [2019-12-27 00:47:27,700 INFO L226 Difference]: Without dead ends: 2191 [2019-12-27 00:47:27,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:47:27,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2019-12-27 00:47:27,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2191. [2019-12-27 00:47:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2191 states. [2019-12-27 00:47:27,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 6258 transitions. [2019-12-27 00:47:27,761 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 6258 transitions. Word has length 35 [2019-12-27 00:47:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:27,762 INFO L462 AbstractCegarLoop]: Abstraction has 2191 states and 6258 transitions. [2019-12-27 00:47:27,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:47:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 6258 transitions. [2019-12-27 00:47:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 00:47:27,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:27,764 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:27,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:27,977 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:27,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:27,978 INFO L82 PathProgramCache]: Analyzing trace with hash 2016252618, now seen corresponding path program 1 times [2019-12-27 00:47:27,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:27,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098069675] [2019-12-27 00:47:27,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:47:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:47:28,059 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:47:28,060 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:47:28,060 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:47:28,060 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 00:47:28,073 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,073 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,073 WARN L315 ript$VariableManager]: TermVariabe threadThread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,073 WARN L315 ript$VariableManager]: TermVariabe threadThread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,073 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,074 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,074 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,074 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,074 WARN L315 ript$VariableManager]: TermVariabe threadThread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,074 WARN L315 ript$VariableManager]: TermVariabe threadThread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,074 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,074 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,075 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,075 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,075 WARN L315 ript$VariableManager]: TermVariabe threadThread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,075 WARN L315 ript$VariableManager]: TermVariabe threadThread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,075 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,075 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,075 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,075 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,076 WARN L315 ript$VariableManager]: TermVariabe threadThread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,076 WARN L315 ript$VariableManager]: TermVariabe threadThread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,076 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,076 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,076 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,077 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,077 WARN L315 ript$VariableManager]: TermVariabe threadThread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,077 WARN L315 ript$VariableManager]: TermVariabe threadThread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,077 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,077 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,077 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,077 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,078 WARN L315 ript$VariableManager]: TermVariabe threadThread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,078 WARN L315 ript$VariableManager]: TermVariabe threadThread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,078 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,078 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,078 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,078 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,079 WARN L315 ript$VariableManager]: TermVariabe threadThread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,079 WARN L315 ript$VariableManager]: TermVariabe threadThread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,080 WARN L315 ript$VariableManager]: TermVariabe threadThread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,080 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,080 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,081 WARN L315 ript$VariableManager]: TermVariabe threadThread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,082 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,082 WARN L315 ript$VariableManager]: TermVariabe threadThread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,082 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,082 WARN L315 ript$VariableManager]: TermVariabe threadThread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,083 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,083 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,084 WARN L315 ript$VariableManager]: TermVariabe threadThread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,084 WARN L315 ript$VariableManager]: TermVariabe threadThread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,085 WARN L315 ript$VariableManager]: TermVariabe threadThread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,085 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,085 WARN L315 ript$VariableManager]: TermVariabe threadThread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,085 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,086 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,087 WARN L315 ript$VariableManager]: TermVariabe threadThread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,087 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,087 WARN L315 ript$VariableManager]: TermVariabe threadThread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:28,092 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 00:47:28,092 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:47:28,093 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:47:28,093 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:47:28,093 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:47:28,093 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:47:28,093 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:47:28,093 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:47:28,093 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:47:28,094 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 104 transitions [2019-12-27 00:47:28,094 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 106 places, 104 transitions [2019-12-27 00:47:28,684 INFO L132 PetriNetUnfolder]: 398/2443 cut-off events. [2019-12-27 00:47:28,684 INFO L133 PetriNetUnfolder]: For 242/242 co-relation queries the response was YES. [2019-12-27 00:47:28,711 INFO L76 FinitePrefix]: Finished finitePrefix Result has 2675 conditions, 2443 events. 398/2443 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 16457 event pairs. 0/2045 useless extension candidates. Maximal degree in co-relation 1355. Up to 192 conditions per place. [2019-12-27 00:47:28,769 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 106 places, 104 transitions [2019-12-27 00:47:29,399 INFO L132 PetriNetUnfolder]: 398/2443 cut-off events. [2019-12-27 00:47:29,400 INFO L133 PetriNetUnfolder]: For 242/242 co-relation queries the response was YES. [2019-12-27 00:47:29,422 INFO L76 FinitePrefix]: Finished finitePrefix Result has 2675 conditions, 2443 events. 398/2443 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 16457 event pairs. 0/2045 useless extension candidates. Maximal degree in co-relation 1355. Up to 192 conditions per place. [2019-12-27 00:47:29,469 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3144 [2019-12-27 00:47:29,469 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:47:29,798 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:29,829 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:29,833 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:29,858 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:29,858 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:29,859 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 00:47:29,868 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:29,896 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:29,901 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:29,924 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:29,925 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:29,925 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 00:47:32,210 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:32,240 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:32,243 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:32,347 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:32,347 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 00:47:32,348 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 00:47:32,360 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:32,388 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:32,391 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:32,415 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:32,416 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 00:47:32,416 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 00:47:32,476 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:32,507 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:32,512 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:32,542 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:32,542 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 00:47:32,543 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 00:47:32,550 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:32,589 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:32,594 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:32,623 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:32,624 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 00:47:32,624 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 00:47:32,931 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:32,967 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:32,971 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:33,003 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:33,004 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:33,004 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:47:33,013 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:33,051 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:33,055 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:33,093 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:33,093 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:33,094 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:47:35,114 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,140 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:35,143 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,164 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:35,165 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,165 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 00:47:35,171 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,196 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:35,199 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,220 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:35,220 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,220 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 00:47:35,407 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,433 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:35,435 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,456 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:35,456 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,456 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 00:47:35,485 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,509 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:35,512 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,532 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:35,533 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,533 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 00:47:35,590 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,618 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:35,622 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,649 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:35,649 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,649 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 00:47:35,659 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,687 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:35,690 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,713 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:35,713 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 00:47:35,713 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 00:47:36,032 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:36,072 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:36,079 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:36,120 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:36,121 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:36,121 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:47:36,132 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:36,176 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:36,181 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:36,217 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:36,217 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:36,218 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:47:38,955 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2019-12-27 00:47:39,366 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-12-27 00:47:39,461 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2554 [2019-12-27 00:47:39,461 INFO L214 etLargeBlockEncoding]: Total number of compositions: 75 [2019-12-27 00:47:39,461 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 34 transitions [2019-12-27 00:47:39,676 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6529 states. [2019-12-27 00:47:39,677 INFO L276 IsEmpty]: Start isEmpty. Operand 6529 states. [2019-12-27 00:47:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 00:47:39,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:39,677 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 00:47:39,677 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:39,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:39,678 INFO L82 PathProgramCache]: Analyzing trace with hash 34932643, now seen corresponding path program 1 times [2019-12-27 00:47:39,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:39,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922141628] [2019-12-27 00:47:39,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:47:39,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922141628] [2019-12-27 00:47:39,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:47:39,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:47:39,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104058601] [2019-12-27 00:47:39,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:47:39,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:39,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:47:39,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:47:39,701 INFO L87 Difference]: Start difference. First operand 6529 states. Second operand 3 states. [2019-12-27 00:47:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:39,758 INFO L93 Difference]: Finished difference Result 6529 states and 21447 transitions. [2019-12-27 00:47:39,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:47:39,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-27 00:47:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:39,783 INFO L225 Difference]: With dead ends: 6529 [2019-12-27 00:47:39,783 INFO L226 Difference]: Without dead ends: 5798 [2019-12-27 00:47:39,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:47:39,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5798 states. [2019-12-27 00:47:39,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5798 to 5798. [2019-12-27 00:47:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5798 states. [2019-12-27 00:47:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5798 states to 5798 states and 19258 transitions. [2019-12-27 00:47:39,973 INFO L78 Accepts]: Start accepts. Automaton has 5798 states and 19258 transitions. Word has length 4 [2019-12-27 00:47:39,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:39,974 INFO L462 AbstractCegarLoop]: Abstraction has 5798 states and 19258 transitions. [2019-12-27 00:47:39,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:47:39,974 INFO L276 IsEmpty]: Start isEmpty. Operand 5798 states and 19258 transitions. [2019-12-27 00:47:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 00:47:39,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:39,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:39,975 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:39,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:39,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1745623254, now seen corresponding path program 1 times [2019-12-27 00:47:39,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:40,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252500759] [2019-12-27 00:47:40,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 00:47:40,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252500759] [2019-12-27 00:47:40,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:47:40,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:47:40,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721022945] [2019-12-27 00:47:40,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:47:40,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:40,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:47:40,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:47:40,092 INFO L87 Difference]: Start difference. First operand 5798 states and 19258 transitions. Second operand 4 states. [2019-12-27 00:47:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:40,146 INFO L93 Difference]: Finished difference Result 6779 states and 21955 transitions. [2019-12-27 00:47:40,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:47:40,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-27 00:47:40,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:40,170 INFO L225 Difference]: With dead ends: 6779 [2019-12-27 00:47:40,171 INFO L226 Difference]: Without dead ends: 6779 [2019-12-27 00:47:40,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:47:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6779 states. [2019-12-27 00:47:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6779 to 6397. [2019-12-27 00:47:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6397 states. [2019-12-27 00:47:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6397 states to 6397 states and 20804 transitions. [2019-12-27 00:47:40,370 INFO L78 Accepts]: Start accepts. Automaton has 6397 states and 20804 transitions. Word has length 10 [2019-12-27 00:47:40,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:40,370 INFO L462 AbstractCegarLoop]: Abstraction has 6397 states and 20804 transitions. [2019-12-27 00:47:40,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:47:40,371 INFO L276 IsEmpty]: Start isEmpty. Operand 6397 states and 20804 transitions. [2019-12-27 00:47:40,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:47:40,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:40,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:40,371 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:40,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:40,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1760908010, now seen corresponding path program 1 times [2019-12-27 00:47:40,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:40,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517621922] [2019-12-27 00:47:40,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:40,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517621922] [2019-12-27 00:47:40,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515874915] [2019-12-27 00:47:40,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:40,495 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 00:47:40,498 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:40,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:40,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-12-27 00:47:40,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33288235] [2019-12-27 00:47:40,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:47:40,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:40,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:47:40,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:47:40,525 INFO L87 Difference]: Start difference. First operand 6397 states and 20804 transitions. Second operand 6 states. [2019-12-27 00:47:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:40,608 INFO L93 Difference]: Finished difference Result 6395 states and 20799 transitions. [2019-12-27 00:47:40,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:47:40,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 00:47:40,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:40,633 INFO L225 Difference]: With dead ends: 6395 [2019-12-27 00:47:40,633 INFO L226 Difference]: Without dead ends: 6395 [2019-12-27 00:47:40,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:47:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6395 states. [2019-12-27 00:47:40,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6395 to 6395. [2019-12-27 00:47:40,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6395 states. [2019-12-27 00:47:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6395 states to 6395 states and 20799 transitions. [2019-12-27 00:47:40,832 INFO L78 Accepts]: Start accepts. Automaton has 6395 states and 20799 transitions. Word has length 17 [2019-12-27 00:47:40,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:40,832 INFO L462 AbstractCegarLoop]: Abstraction has 6395 states and 20799 transitions. [2019-12-27 00:47:40,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:47:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 6395 states and 20799 transitions. [2019-12-27 00:47:40,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:47:40,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:40,834 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:41,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:41,039 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:41,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:41,041 INFO L82 PathProgramCache]: Analyzing trace with hash 854603708, now seen corresponding path program 1 times [2019-12-27 00:47:41,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:41,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627177444] [2019-12-27 00:47:41,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:41,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:41,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627177444] [2019-12-27 00:47:41,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59492560] [2019-12-27 00:47:41,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:41,171 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-27 00:47:41,174 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:41,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:41,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:41,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-12-27 00:47:41,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507365995] [2019-12-27 00:47:41,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 00:47:41,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:41,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 00:47:41,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:47:41,210 INFO L87 Difference]: Start difference. First operand 6395 states and 20799 transitions. Second operand 8 states. [2019-12-27 00:47:41,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:41,410 INFO L93 Difference]: Finished difference Result 6391 states and 20787 transitions. [2019-12-27 00:47:41,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:47:41,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-12-27 00:47:41,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:41,435 INFO L225 Difference]: With dead ends: 6391 [2019-12-27 00:47:41,436 INFO L226 Difference]: Without dead ends: 6391 [2019-12-27 00:47:41,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:47:41,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6391 states. [2019-12-27 00:47:41,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6391 to 6391. [2019-12-27 00:47:41,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6391 states. [2019-12-27 00:47:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6391 states to 6391 states and 20787 transitions. [2019-12-27 00:47:41,606 INFO L78 Accepts]: Start accepts. Automaton has 6391 states and 20787 transitions. Word has length 23 [2019-12-27 00:47:41,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:41,606 INFO L462 AbstractCegarLoop]: Abstraction has 6391 states and 20787 transitions. [2019-12-27 00:47:41,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 00:47:41,606 INFO L276 IsEmpty]: Start isEmpty. Operand 6391 states and 20787 transitions. [2019-12-27 00:47:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 00:47:41,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:41,607 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:41,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:41,811 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:41,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:41,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1833018259, now seen corresponding path program 1 times [2019-12-27 00:47:41,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:41,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466184354] [2019-12-27 00:47:41,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:41,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466184354] [2019-12-27 00:47:41,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871516324] [2019-12-27 00:47:41,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:41,937 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:47:41,940 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:41,977 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:41,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:41,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-12-27 00:47:41,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562544491] [2019-12-27 00:47:41,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 00:47:41,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:41,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 00:47:41,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-12-27 00:47:41,979 INFO L87 Difference]: Start difference. First operand 6391 states and 20787 transitions. Second operand 10 states. [2019-12-27 00:47:42,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:42,053 INFO L93 Difference]: Finished difference Result 6383 states and 20759 transitions. [2019-12-27 00:47:42,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:47:42,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-12-27 00:47:42,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:42,068 INFO L225 Difference]: With dead ends: 6383 [2019-12-27 00:47:42,069 INFO L226 Difference]: Without dead ends: 6383 [2019-12-27 00:47:42,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-12-27 00:47:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6383 states. [2019-12-27 00:47:42,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6383 to 6383. [2019-12-27 00:47:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6383 states. [2019-12-27 00:47:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6383 states to 6383 states and 20759 transitions. [2019-12-27 00:47:42,274 INFO L78 Accepts]: Start accepts. Automaton has 6383 states and 20759 transitions. Word has length 29 [2019-12-27 00:47:42,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:42,275 INFO L462 AbstractCegarLoop]: Abstraction has 6383 states and 20759 transitions. [2019-12-27 00:47:42,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 00:47:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 6383 states and 20759 transitions. [2019-12-27 00:47:42,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 00:47:42,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:42,278 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:42,490 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:42,490 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:42,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:42,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1531059645, now seen corresponding path program 1 times [2019-12-27 00:47:42,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:42,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270420733] [2019-12-27 00:47:42,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:42,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270420733] [2019-12-27 00:47:42,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294573746] [2019-12-27 00:47:42,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:42,651 INFO L264 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:47:42,658 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:42,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:42,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-12-27 00:47:42,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258843963] [2019-12-27 00:47:42,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:47:42,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:42,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:47:42,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:47:42,713 INFO L87 Difference]: Start difference. First operand 6383 states and 20759 transitions. Second operand 12 states. [2019-12-27 00:47:43,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:43,218 INFO L93 Difference]: Finished difference Result 6367 states and 20695 transitions. [2019-12-27 00:47:43,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:47:43,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-12-27 00:47:43,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:43,233 INFO L225 Difference]: With dead ends: 6367 [2019-12-27 00:47:43,233 INFO L226 Difference]: Without dead ends: 6367 [2019-12-27 00:47:43,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:47:43,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6367 states. [2019-12-27 00:47:43,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6367 to 6367. [2019-12-27 00:47:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6367 states. [2019-12-27 00:47:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6367 states to 6367 states and 20695 transitions. [2019-12-27 00:47:43,401 INFO L78 Accepts]: Start accepts. Automaton has 6367 states and 20695 transitions. Word has length 35 [2019-12-27 00:47:43,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:43,401 INFO L462 AbstractCegarLoop]: Abstraction has 6367 states and 20695 transitions. [2019-12-27 00:47:43,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:47:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 6367 states and 20695 transitions. [2019-12-27 00:47:43,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 00:47:43,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:43,406 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:43,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:43,609 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:43,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:43,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1747629972, now seen corresponding path program 1 times [2019-12-27 00:47:43,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:43,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093676070] [2019-12-27 00:47:43,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:43,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093676070] [2019-12-27 00:47:43,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104612977] [2019-12-27 00:47:43,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:47:43,779 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:47:43,780 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:47:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:47:43,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:47:43,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-12-27 00:47:43,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53559149] [2019-12-27 00:47:43,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 00:47:43,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:47:43,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 00:47:43,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:47:43,852 INFO L87 Difference]: Start difference. First operand 6367 states and 20695 transitions. Second operand 14 states. [2019-12-27 00:47:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:47:43,972 INFO L93 Difference]: Finished difference Result 6335 states and 20551 transitions. [2019-12-27 00:47:43,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 00:47:43,973 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2019-12-27 00:47:43,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:47:43,987 INFO L225 Difference]: With dead ends: 6335 [2019-12-27 00:47:43,987 INFO L226 Difference]: Without dead ends: 6335 [2019-12-27 00:47:43,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:47:44,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6335 states. [2019-12-27 00:47:44,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6335 to 6335. [2019-12-27 00:47:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6335 states. [2019-12-27 00:47:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 20551 transitions. [2019-12-27 00:47:44,152 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 20551 transitions. Word has length 41 [2019-12-27 00:47:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:47:44,154 INFO L462 AbstractCegarLoop]: Abstraction has 6335 states and 20551 transitions. [2019-12-27 00:47:44,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 00:47:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 20551 transitions. [2019-12-27 00:47:44,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 00:47:44,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:47:44,158 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:47:44,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:47:44,364 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:47:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:47:44,364 INFO L82 PathProgramCache]: Analyzing trace with hash 741042800, now seen corresponding path program 1 times [2019-12-27 00:47:44,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:47:44,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613435829] [2019-12-27 00:47:44,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:47:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:47:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:47:44,426 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:47:44,426 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:47:44,427 WARN L364 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:47:44,427 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2019-12-27 00:47:44,435 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,435 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,435 WARN L315 ript$VariableManager]: TermVariabe threadThread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,435 WARN L315 ript$VariableManager]: TermVariabe threadThread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,435 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,435 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,436 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,436 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,436 WARN L315 ript$VariableManager]: TermVariabe threadThread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,436 WARN L315 ript$VariableManager]: TermVariabe threadThread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,436 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,436 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,436 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,437 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,437 WARN L315 ript$VariableManager]: TermVariabe threadThread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,437 WARN L315 ript$VariableManager]: TermVariabe threadThread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,437 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,437 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,437 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,437 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,438 WARN L315 ript$VariableManager]: TermVariabe threadThread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,438 WARN L315 ript$VariableManager]: TermVariabe threadThread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,438 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,438 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,438 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,438 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,438 WARN L315 ript$VariableManager]: TermVariabe threadThread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,439 WARN L315 ript$VariableManager]: TermVariabe threadThread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,439 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,439 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,439 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,439 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,439 WARN L315 ript$VariableManager]: TermVariabe threadThread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,439 WARN L315 ript$VariableManager]: TermVariabe threadThread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,440 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,440 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,440 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,440 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,440 WARN L315 ript$VariableManager]: TermVariabe threadThread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,440 WARN L315 ript$VariableManager]: TermVariabe threadThread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,440 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,441 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,441 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,441 WARN L315 ript$VariableManager]: TermVariabe threadThread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,441 WARN L315 ript$VariableManager]: TermVariabe threadThread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,441 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,443 WARN L315 ript$VariableManager]: TermVariabe threadThread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,443 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,443 WARN L315 ript$VariableManager]: TermVariabe threadThread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,443 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,444 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,444 WARN L315 ript$VariableManager]: TermVariabe threadThread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,445 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,445 WARN L315 ript$VariableManager]: TermVariabe threadThread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,446 WARN L315 ript$VariableManager]: TermVariabe threadThread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,446 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,447 WARN L315 ript$VariableManager]: TermVariabe threadThread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,447 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,448 WARN L315 ript$VariableManager]: TermVariabe threadThread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,448 WARN L315 ript$VariableManager]: TermVariabe threadThread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,449 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,449 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,450 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,450 WARN L315 ript$VariableManager]: TermVariabe threadThread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,450 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,450 WARN L315 ript$VariableManager]: TermVariabe threadThread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,451 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,452 WARN L315 ript$VariableManager]: TermVariabe threadThread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,452 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,452 WARN L315 ript$VariableManager]: TermVariabe threadThread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:47:44,457 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 00:47:44,458 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:47:44,458 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:47:44,458 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:47:44,458 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:47:44,458 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:47:44,458 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:47:44,458 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:47:44,459 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:47:44,460 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 110 transitions [2019-12-27 00:47:44,460 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 113 places, 110 transitions [2019-12-27 00:47:45,966 INFO L132 PetriNetUnfolder]: 848/4830 cut-off events. [2019-12-27 00:47:45,967 INFO L133 PetriNetUnfolder]: For 525/525 co-relation queries the response was YES. [2019-12-27 00:47:46,019 INFO L76 FinitePrefix]: Finished finitePrefix Result has 5328 conditions, 4830 events. 848/4830 cut-off events. For 525/525 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 39222 event pairs. 0/4046 useless extension candidates. Maximal degree in co-relation 2661. Up to 448 conditions per place. [2019-12-27 00:47:46,131 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 113 places, 110 transitions [2019-12-27 00:47:47,234 INFO L132 PetriNetUnfolder]: 848/4830 cut-off events. [2019-12-27 00:47:47,234 INFO L133 PetriNetUnfolder]: For 525/525 co-relation queries the response was YES. [2019-12-27 00:47:47,277 INFO L76 FinitePrefix]: Finished finitePrefix Result has 5328 conditions, 4830 events. 848/4830 cut-off events. For 525/525 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 39222 event pairs. 0/4046 useless extension candidates. Maximal degree in co-relation 2661. Up to 448 conditions per place. [2019-12-27 00:47:47,379 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3864 [2019-12-27 00:47:47,379 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:47:47,540 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:47,567 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:47,571 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:47,591 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:47,592 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:47,592 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 00:47:47,605 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:47,633 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:47,637 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:47,664 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:47,665 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:47,665 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 00:47:50,543 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:50,577 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:50,585 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:50,614 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:50,615 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:50,615 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:47:50,635 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:50,666 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:50,672 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:50,882 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-27 00:47:50,883 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:50,884 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:50,884 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:47:53,459 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-12-27 00:47:53,538 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:53,573 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:53,577 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:53,605 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:53,606 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:53,607 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:47:53,616 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:53,650 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:53,653 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:53,680 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:53,681 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:53,681 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:47:56,034 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:56,090 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:56,095 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:56,145 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:56,146 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:56,146 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:47:56,163 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:56,216 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:56,220 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:56,266 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:47:56,267 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:47:56,267 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:47:58,436 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-12-27 00:47:58,770 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-12-27 00:47:58,882 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-27 00:47:58,928 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3195 [2019-12-27 00:47:58,928 INFO L214 etLargeBlockEncoding]: Total number of compositions: 78 [2019-12-27 00:47:58,928 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 37 transitions [2019-12-27 00:48:00,006 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18897 states. [2019-12-27 00:48:00,006 INFO L276 IsEmpty]: Start isEmpty. Operand 18897 states. [2019-12-27 00:48:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 00:48:00,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:48:00,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 00:48:00,007 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:48:00,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:48:00,007 INFO L82 PathProgramCache]: Analyzing trace with hash 40994171, now seen corresponding path program 1 times [2019-12-27 00:48:00,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:48:00,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57519757] [2019-12-27 00:48:00,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:48:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:00,026 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 00:48:00,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57519757] [2019-12-27 00:48:00,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:48:00,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:48:00,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844754611] [2019-12-27 00:48:00,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:48:00,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:48:00,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:48:00,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:48:00,028 INFO L87 Difference]: Start difference. First operand 18897 states. Second operand 4 states. [2019-12-27 00:48:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:48:00,169 INFO L93 Difference]: Finished difference Result 21592 states and 77556 transitions. [2019-12-27 00:48:00,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:48:00,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-27 00:48:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:48:00,209 INFO L225 Difference]: With dead ends: 21592 [2019-12-27 00:48:00,209 INFO L226 Difference]: Without dead ends: 19531 [2019-12-27 00:48:00,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:48:00,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19531 states. [2019-12-27 00:48:00,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19531 to 18637. [2019-12-27 00:48:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18637 states. [2019-12-27 00:48:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18637 states to 18637 states and 67705 transitions. [2019-12-27 00:48:00,763 INFO L78 Accepts]: Start accepts. Automaton has 18637 states and 67705 transitions. Word has length 4 [2019-12-27 00:48:00,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:48:00,763 INFO L462 AbstractCegarLoop]: Abstraction has 18637 states and 67705 transitions. [2019-12-27 00:48:00,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:48:00,763 INFO L276 IsEmpty]: Start isEmpty. Operand 18637 states and 67705 transitions. [2019-12-27 00:48:00,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:48:00,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:48:00,764 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:48:00,764 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:48:00,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:48:00,764 INFO L82 PathProgramCache]: Analyzing trace with hash 71145926, now seen corresponding path program 1 times [2019-12-27 00:48:00,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:48:00,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706989020] [2019-12-27 00:48:00,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:48:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:48:00,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706989020] [2019-12-27 00:48:00,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310301577] [2019-12-27 00:48:00,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:01,735 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 00:48:01,736 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:48:01,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:48:01,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:48:01,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-12-27 00:48:01,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638679825] [2019-12-27 00:48:01,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:48:01,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:48:01,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:48:01,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:48:01,766 INFO L87 Difference]: Start difference. First operand 18637 states and 67705 transitions. Second operand 7 states. [2019-12-27 00:48:01,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:48:01,902 INFO L93 Difference]: Finished difference Result 21452 states and 75330 transitions. [2019-12-27 00:48:01,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:48:01,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-27 00:48:01,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:48:01,942 INFO L225 Difference]: With dead ends: 21452 [2019-12-27 00:48:01,942 INFO L226 Difference]: Without dead ends: 21452 [2019-12-27 00:48:01,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:48:02,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21452 states. [2019-12-27 00:48:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21452 to 20110. [2019-12-27 00:48:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20110 states. [2019-12-27 00:48:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20110 states to 20110 states and 70948 transitions. [2019-12-27 00:48:02,441 INFO L78 Accepts]: Start accepts. Automaton has 20110 states and 70948 transitions. Word has length 17 [2019-12-27 00:48:02,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:48:02,441 INFO L462 AbstractCegarLoop]: Abstraction has 20110 states and 70948 transitions. [2019-12-27 00:48:02,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:48:02,441 INFO L276 IsEmpty]: Start isEmpty. Operand 20110 states and 70948 transitions. [2019-12-27 00:48:02,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:48:02,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:48:02,443 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:48:02,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:02,646 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:48:02,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:48:02,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1524488795, now seen corresponding path program 1 times [2019-12-27 00:48:02,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:48:02,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723706314] [2019-12-27 00:48:02,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:48:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:02,691 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-27 00:48:02,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723706314] [2019-12-27 00:48:02,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21717068] [2019-12-27 00:48:02,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:02,777 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-27 00:48:02,778 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:48:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-27 00:48:02,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:48:02,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-12-27 00:48:02,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437198489] [2019-12-27 00:48:02,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:48:02,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:48:02,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:48:02,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:48:02,814 INFO L87 Difference]: Start difference. First operand 20110 states and 70948 transitions. Second operand 9 states. [2019-12-27 00:48:02,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:48:02,963 INFO L93 Difference]: Finished difference Result 21137 states and 71956 transitions. [2019-12-27 00:48:02,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:48:02,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-12-27 00:48:02,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:48:02,998 INFO L225 Difference]: With dead ends: 21137 [2019-12-27 00:48:02,998 INFO L226 Difference]: Without dead ends: 21137 [2019-12-27 00:48:02,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:48:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21137 states. [2019-12-27 00:48:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21137 to 20019. [2019-12-27 00:48:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20019 states. [2019-12-27 00:48:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20019 states to 20019 states and 68739 transitions. [2019-12-27 00:48:03,641 INFO L78 Accepts]: Start accepts. Automaton has 20019 states and 68739 transitions. Word has length 30 [2019-12-27 00:48:03,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:48:03,641 INFO L462 AbstractCegarLoop]: Abstraction has 20019 states and 68739 transitions. [2019-12-27 00:48:03,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:48:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 20019 states and 68739 transitions. [2019-12-27 00:48:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 00:48:03,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:48:03,647 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:48:03,851 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:03,851 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:48:03,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:48:03,852 INFO L82 PathProgramCache]: Analyzing trace with hash 143720568, now seen corresponding path program 1 times [2019-12-27 00:48:03,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:48:03,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907074968] [2019-12-27 00:48:03,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:48:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-27 00:48:03,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907074968] [2019-12-27 00:48:03,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172256902] [2019-12-27 00:48:03,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:04,019 INFO L264 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:48:04,020 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:48:04,098 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-27 00:48:04,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:48:04,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:48:04,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105658006] [2019-12-27 00:48:04,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:48:04,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:48:04,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:48:04,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:48:04,100 INFO L87 Difference]: Start difference. First operand 20019 states and 68739 transitions. Second operand 11 states. [2019-12-27 00:48:04,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:48:04,344 INFO L93 Difference]: Finished difference Result 19366 states and 65474 transitions. [2019-12-27 00:48:04,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:48:04,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2019-12-27 00:48:04,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:48:04,394 INFO L225 Difference]: With dead ends: 19366 [2019-12-27 00:48:04,394 INFO L226 Difference]: Without dead ends: 19366 [2019-12-27 00:48:04,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:48:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19366 states. [2019-12-27 00:48:05,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19366 to 18808. [2019-12-27 00:48:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18808 states. [2019-12-27 00:48:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18808 states to 18808 states and 64142 transitions. [2019-12-27 00:48:05,094 INFO L78 Accepts]: Start accepts. Automaton has 18808 states and 64142 transitions. Word has length 43 [2019-12-27 00:48:05,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:48:05,094 INFO L462 AbstractCegarLoop]: Abstraction has 18808 states and 64142 transitions. [2019-12-27 00:48:05,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:48:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 18808 states and 64142 transitions. [2019-12-27 00:48:05,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 00:48:05,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:48:05,103 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:48:05,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:05,307 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:48:05,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:48:05,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1247564156, now seen corresponding path program 1 times [2019-12-27 00:48:05,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:48:05,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793205361] [2019-12-27 00:48:05,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:48:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:48:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:48:05,357 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:48:05,358 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:48:05,358 WARN L364 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:48:05,358 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2019-12-27 00:48:05,367 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,367 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,367 WARN L315 ript$VariableManager]: TermVariabe threadThread4of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,367 WARN L315 ript$VariableManager]: TermVariabe threadThread4of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,368 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,368 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,368 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,368 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,368 WARN L315 ript$VariableManager]: TermVariabe threadThread3of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,368 WARN L315 ript$VariableManager]: TermVariabe threadThread3of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,369 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,369 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,369 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,369 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,369 WARN L315 ript$VariableManager]: TermVariabe threadThread1of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,369 WARN L315 ript$VariableManager]: TermVariabe threadThread1of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,370 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,370 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,370 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,370 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,370 WARN L315 ript$VariableManager]: TermVariabe threadThread7of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,370 WARN L315 ript$VariableManager]: TermVariabe threadThread7of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,370 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,370 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,371 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,371 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,371 WARN L315 ript$VariableManager]: TermVariabe threadThread2of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,371 WARN L315 ript$VariableManager]: TermVariabe threadThread2of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,371 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,371 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,371 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,371 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,372 WARN L315 ript$VariableManager]: TermVariabe threadThread5of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,372 WARN L315 ript$VariableManager]: TermVariabe threadThread5of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,372 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,372 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,372 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,372 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,372 WARN L315 ript$VariableManager]: TermVariabe threadThread6of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,372 WARN L315 ript$VariableManager]: TermVariabe threadThread6of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,373 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,373 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,373 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,373 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,373 WARN L315 ript$VariableManager]: TermVariabe threadThread8of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,373 WARN L315 ript$VariableManager]: TermVariabe threadThread8of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,373 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,374 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,374 WARN L315 ript$VariableManager]: TermVariabe threadThread1of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,374 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,374 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,374 WARN L315 ript$VariableManager]: TermVariabe threadThread1of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,376 WARN L315 ript$VariableManager]: TermVariabe threadThread2of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,376 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,376 WARN L315 ript$VariableManager]: TermVariabe threadThread2of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,376 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,377 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,377 WARN L315 ript$VariableManager]: TermVariabe threadThread3of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,378 WARN L315 ript$VariableManager]: TermVariabe threadThread3of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,378 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,379 WARN L315 ript$VariableManager]: TermVariabe threadThread4of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,379 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,379 WARN L315 ript$VariableManager]: TermVariabe threadThread4of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,379 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,381 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,381 WARN L315 ript$VariableManager]: TermVariabe threadThread5of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,381 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,381 WARN L315 ript$VariableManager]: TermVariabe threadThread5of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,382 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,382 WARN L315 ript$VariableManager]: TermVariabe threadThread6of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,382 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,383 WARN L315 ript$VariableManager]: TermVariabe threadThread6of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,384 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,384 WARN L315 ript$VariableManager]: TermVariabe threadThread7of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,384 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,384 WARN L315 ript$VariableManager]: TermVariabe threadThread7of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,385 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,386 WARN L315 ript$VariableManager]: TermVariabe threadThread8of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,386 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,386 WARN L315 ript$VariableManager]: TermVariabe threadThread8of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:05,393 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 00:48:05,393 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:48:05,393 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:48:05,393 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:48:05,393 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:48:05,394 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:48:05,394 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:48:05,394 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:48:05,394 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:48:05,395 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 116 transitions [2019-12-27 00:48:05,395 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 120 places, 116 transitions [2019-12-27 00:48:07,957 INFO L132 PetriNetUnfolder]: 1810/9649 cut-off events. [2019-12-27 00:48:07,957 INFO L133 PetriNetUnfolder]: For 1136/1136 co-relation queries the response was YES. [2019-12-27 00:48:08,018 INFO L76 FinitePrefix]: Finished finitePrefix Result has 10734 conditions, 9649 events. 1810/9649 cut-off events. For 1136/1136 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 92296 event pairs. 0/8095 useless extension candidates. Maximal degree in co-relation 5313. Up to 1024 conditions per place. [2019-12-27 00:48:08,161 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 120 places, 116 transitions [2019-12-27 00:48:11,210 INFO L132 PetriNetUnfolder]: 1810/9649 cut-off events. [2019-12-27 00:48:11,211 INFO L133 PetriNetUnfolder]: For 1136/1136 co-relation queries the response was YES. [2019-12-27 00:48:11,271 INFO L76 FinitePrefix]: Finished finitePrefix Result has 10734 conditions, 9649 events. 1810/9649 cut-off events. For 1136/1136 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 92296 event pairs. 0/8095 useless extension candidates. Maximal degree in co-relation 5313. Up to 1024 conditions per place. [2019-12-27 00:48:11,415 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4640 [2019-12-27 00:48:11,415 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:48:12,593 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:48:12,629 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:48:12,633 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:48:12,665 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:48:12,666 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:48:12,667 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:48:12,675 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:48:12,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:48:12,713 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:48:12,743 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:48:12,744 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:48:12,744 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:48:15,159 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:48:15,201 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:48:15,205 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:48:15,246 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:48:15,247 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:48:15,247 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:48:15,255 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:48:15,299 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:48:15,302 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:48:15,347 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:48:15,348 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:48:15,348 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:48:17,935 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-12-27 00:48:18,249 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-12-27 00:48:18,352 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-27 00:48:18,356 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3778 [2019-12-27 00:48:18,356 INFO L214 etLargeBlockEncoding]: Total number of compositions: 81 [2019-12-27 00:48:18,356 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 40 transitions [2019-12-27 00:48:24,380 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 55297 states. [2019-12-27 00:48:24,381 INFO L276 IsEmpty]: Start isEmpty. Operand 55297 states. [2019-12-27 00:48:24,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 00:48:24,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:48:24,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 00:48:24,381 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:48:24,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:48:24,382 INFO L82 PathProgramCache]: Analyzing trace with hash 47396195, now seen corresponding path program 1 times [2019-12-27 00:48:24,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:48:24,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233249023] [2019-12-27 00:48:24,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:48:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:48:24,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233249023] [2019-12-27 00:48:24,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:48:24,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:48:24,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392737045] [2019-12-27 00:48:24,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:48:24,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:48:24,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:48:24,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:48:24,413 INFO L87 Difference]: Start difference. First operand 55297 states. Second operand 4 states. [2019-12-27 00:48:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:48:24,731 INFO L93 Difference]: Finished difference Result 63134 states and 250644 transitions. [2019-12-27 00:48:24,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:48:24,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-27 00:48:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:48:24,869 INFO L225 Difference]: With dead ends: 63134 [2019-12-27 00:48:24,870 INFO L226 Difference]: Without dead ends: 56827 [2019-12-27 00:48:24,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:48:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56827 states. [2019-12-27 00:48:28,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56827 to 54781. [2019-12-27 00:48:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54781 states. [2019-12-27 00:48:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54781 states to 54781 states and 219674 transitions. [2019-12-27 00:48:28,260 INFO L78 Accepts]: Start accepts. Automaton has 54781 states and 219674 transitions. Word has length 4 [2019-12-27 00:48:28,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:48:28,260 INFO L462 AbstractCegarLoop]: Abstraction has 54781 states and 219674 transitions. [2019-12-27 00:48:28,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:48:28,260 INFO L276 IsEmpty]: Start isEmpty. Operand 54781 states and 219674 transitions. [2019-12-27 00:48:28,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:48:28,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:48:28,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:48:28,261 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:48:28,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:48:28,261 INFO L82 PathProgramCache]: Analyzing trace with hash 686766067, now seen corresponding path program 1 times [2019-12-27 00:48:28,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:48:28,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541080988] [2019-12-27 00:48:28,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:48:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:48:28,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541080988] [2019-12-27 00:48:28,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988432641] [2019-12-27 00:48:28,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:28,379 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 00:48:28,380 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:48:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:48:28,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:48:28,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-12-27 00:48:28,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816617330] [2019-12-27 00:48:28,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:48:28,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:48:28,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:48:28,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:48:28,400 INFO L87 Difference]: Start difference. First operand 54781 states and 219674 transitions. Second operand 6 states. [2019-12-27 00:48:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:48:28,814 INFO L93 Difference]: Finished difference Result 54779 states and 219669 transitions. [2019-12-27 00:48:28,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:48:28,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 00:48:28,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:48:29,050 INFO L225 Difference]: With dead ends: 54779 [2019-12-27 00:48:29,050 INFO L226 Difference]: Without dead ends: 54779 [2019-12-27 00:48:29,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:48:30,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54779 states. [2019-12-27 00:48:33,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54779 to 54779. [2019-12-27 00:48:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54779 states. [2019-12-27 00:48:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54779 states to 54779 states and 219669 transitions. [2019-12-27 00:48:33,484 INFO L78 Accepts]: Start accepts. Automaton has 54779 states and 219669 transitions. Word has length 17 [2019-12-27 00:48:33,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:48:33,485 INFO L462 AbstractCegarLoop]: Abstraction has 54779 states and 219669 transitions. [2019-12-27 00:48:33,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:48:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 54779 states and 219669 transitions. [2019-12-27 00:48:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:48:33,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:48:33,486 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:48:33,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:33,687 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:48:33,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:48:33,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1923464070, now seen corresponding path program 1 times [2019-12-27 00:48:33,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:48:33,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681137402] [2019-12-27 00:48:33,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:48:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:48:33,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681137402] [2019-12-27 00:48:33,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919937563] [2019-12-27 00:48:33,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:33,813 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-27 00:48:33,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:48:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:48:33,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:48:33,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-12-27 00:48:33,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175799218] [2019-12-27 00:48:33,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 00:48:33,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:48:33,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 00:48:33,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:48:33,847 INFO L87 Difference]: Start difference. First operand 54779 states and 219669 transitions. Second operand 8 states. [2019-12-27 00:48:34,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:48:34,095 INFO L93 Difference]: Finished difference Result 54775 states and 219657 transitions. [2019-12-27 00:48:34,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:48:34,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-12-27 00:48:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:48:34,228 INFO L225 Difference]: With dead ends: 54775 [2019-12-27 00:48:34,228 INFO L226 Difference]: Without dead ends: 54775 [2019-12-27 00:48:34,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:48:35,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54775 states. [2019-12-27 00:48:36,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54775 to 54775. [2019-12-27 00:48:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54775 states. [2019-12-27 00:48:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54775 states to 54775 states and 219657 transitions. [2019-12-27 00:48:36,246 INFO L78 Accepts]: Start accepts. Automaton has 54775 states and 219657 transitions. Word has length 23 [2019-12-27 00:48:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:48:36,247 INFO L462 AbstractCegarLoop]: Abstraction has 54775 states and 219657 transitions. [2019-12-27 00:48:36,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 00:48:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 54775 states and 219657 transitions. [2019-12-27 00:48:36,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 00:48:36,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:48:36,247 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:48:36,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:36,448 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:48:36,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:48:36,449 INFO L82 PathProgramCache]: Analyzing trace with hash 353447834, now seen corresponding path program 1 times [2019-12-27 00:48:36,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:48:36,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947778566] [2019-12-27 00:48:36,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:48:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:48:36,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947778566] [2019-12-27 00:48:36,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569991108] [2019-12-27 00:48:36,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:36,592 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:48:36,593 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:48:36,632 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:48:36,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:48:36,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-12-27 00:48:36,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198848992] [2019-12-27 00:48:36,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 00:48:36,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:48:36,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 00:48:36,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2019-12-27 00:48:36,633 INFO L87 Difference]: Start difference. First operand 54775 states and 219657 transitions. Second operand 10 states. [2019-12-27 00:48:36,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:48:36,896 INFO L93 Difference]: Finished difference Result 54767 states and 219629 transitions. [2019-12-27 00:48:36,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:48:36,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-12-27 00:48:36,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:48:37,023 INFO L225 Difference]: With dead ends: 54767 [2019-12-27 00:48:37,023 INFO L226 Difference]: Without dead ends: 54767 [2019-12-27 00:48:37,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2019-12-27 00:48:40,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54767 states. [2019-12-27 00:48:40,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54767 to 54767. [2019-12-27 00:48:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54767 states. [2019-12-27 00:48:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54767 states to 54767 states and 219629 transitions. [2019-12-27 00:48:41,074 INFO L78 Accepts]: Start accepts. Automaton has 54767 states and 219629 transitions. Word has length 29 [2019-12-27 00:48:41,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:48:41,075 INFO L462 AbstractCegarLoop]: Abstraction has 54767 states and 219629 transitions. [2019-12-27 00:48:41,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 00:48:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 54767 states and 219629 transitions. [2019-12-27 00:48:41,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 00:48:41,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:48:41,076 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:48:41,276 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:41,277 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:48:41,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:48:41,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1586842415, now seen corresponding path program 1 times [2019-12-27 00:48:41,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:48:41,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624913600] [2019-12-27 00:48:41,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:48:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:48:41,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624913600] [2019-12-27 00:48:41,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322088922] [2019-12-27 00:48:41,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:41,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:48:41,438 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:48:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:48:41,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:48:41,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-12-27 00:48:41,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104431754] [2019-12-27 00:48:41,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:48:41,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:48:41,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:48:41,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:48:41,492 INFO L87 Difference]: Start difference. First operand 54767 states and 219629 transitions. Second operand 12 states. [2019-12-27 00:48:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:48:41,759 INFO L93 Difference]: Finished difference Result 54751 states and 219565 transitions. [2019-12-27 00:48:41,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:48:41,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-12-27 00:48:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:48:41,892 INFO L225 Difference]: With dead ends: 54751 [2019-12-27 00:48:41,893 INFO L226 Difference]: Without dead ends: 54751 [2019-12-27 00:48:41,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:48:43,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54751 states. [2019-12-27 00:48:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54751 to 54751. [2019-12-27 00:48:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54751 states. [2019-12-27 00:48:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54751 states to 54751 states and 219565 transitions. [2019-12-27 00:48:43,869 INFO L78 Accepts]: Start accepts. Automaton has 54751 states and 219565 transitions. Word has length 35 [2019-12-27 00:48:43,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:48:43,869 INFO L462 AbstractCegarLoop]: Abstraction has 54751 states and 219565 transitions. [2019-12-27 00:48:43,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:48:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 54751 states and 219565 transitions. [2019-12-27 00:48:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 00:48:43,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:48:43,871 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:48:44,072 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:44,072 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:48:44,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:48:44,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1977395589, now seen corresponding path program 1 times [2019-12-27 00:48:44,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:48:44,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33457587] [2019-12-27 00:48:44,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:48:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:48:44,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33457587] [2019-12-27 00:48:44,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501310688] [2019-12-27 00:48:44,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:44,278 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:48:44,279 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:48:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:48:44,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:48:44,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-12-27 00:48:44,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236307036] [2019-12-27 00:48:44,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 00:48:44,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:48:44,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 00:48:44,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:48:44,376 INFO L87 Difference]: Start difference. First operand 54751 states and 219565 transitions. Second operand 14 states. [2019-12-27 00:48:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:48:44,804 INFO L93 Difference]: Finished difference Result 54719 states and 219421 transitions. [2019-12-27 00:48:44,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 00:48:44,804 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2019-12-27 00:48:44,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:48:47,397 INFO L225 Difference]: With dead ends: 54719 [2019-12-27 00:48:47,397 INFO L226 Difference]: Without dead ends: 54719 [2019-12-27 00:48:47,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:48:48,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54719 states. [2019-12-27 00:48:48,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54719 to 54719. [2019-12-27 00:48:48,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54719 states. [2019-12-27 00:48:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54719 states to 54719 states and 219421 transitions. [2019-12-27 00:48:48,855 INFO L78 Accepts]: Start accepts. Automaton has 54719 states and 219421 transitions. Word has length 41 [2019-12-27 00:48:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:48:48,856 INFO L462 AbstractCegarLoop]: Abstraction has 54719 states and 219421 transitions. [2019-12-27 00:48:48,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 00:48:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 54719 states and 219421 transitions. [2019-12-27 00:48:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 00:48:48,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:48:48,860 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:48:49,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:49,061 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:48:49,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:48:49,062 INFO L82 PathProgramCache]: Analyzing trace with hash 600385180, now seen corresponding path program 1 times [2019-12-27 00:48:49,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:48:49,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809306049] [2019-12-27 00:48:49,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:48:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:48:49,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809306049] [2019-12-27 00:48:49,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144440726] [2019-12-27 00:48:49,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:49,250 INFO L264 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:48:49,250 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:48:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:48:49,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:48:49,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-27 00:48:49,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411815569] [2019-12-27 00:48:49,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:48:49,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:48:49,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:48:49,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=135, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:48:49,337 INFO L87 Difference]: Start difference. First operand 54719 states and 219421 transitions. Second operand 16 states. [2019-12-27 00:48:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:48:49,639 INFO L93 Difference]: Finished difference Result 54655 states and 219101 transitions. [2019-12-27 00:48:49,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 00:48:49,639 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2019-12-27 00:48:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:48:50,318 INFO L225 Difference]: With dead ends: 54655 [2019-12-27 00:48:50,318 INFO L226 Difference]: Without dead ends: 54655 [2019-12-27 00:48:50,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=135, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:48:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54655 states. [2019-12-27 00:48:51,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54655 to 54655. [2019-12-27 00:48:51,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54655 states. [2019-12-27 00:48:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54655 states to 54655 states and 219101 transitions. [2019-12-27 00:48:51,753 INFO L78 Accepts]: Start accepts. Automaton has 54655 states and 219101 transitions. Word has length 47 [2019-12-27 00:48:51,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:48:51,754 INFO L462 AbstractCegarLoop]: Abstraction has 54655 states and 219101 transitions. [2019-12-27 00:48:51,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:48:51,754 INFO L276 IsEmpty]: Start isEmpty. Operand 54655 states and 219101 transitions. [2019-12-27 00:48:51,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:48:51,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:48:51,764 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:48:51,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:51,965 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:48:51,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:48:51,966 INFO L82 PathProgramCache]: Analyzing trace with hash 793869420, now seen corresponding path program 1 times [2019-12-27 00:48:51,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:48:51,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839939356] [2019-12-27 00:48:51,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:48:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:48:52,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839939356] [2019-12-27 00:48:52,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581239734] [2019-12-27 00:48:52,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:48:52,180 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 00:48:52,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:48:52,278 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:48:52,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:48:52,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-12-27 00:48:52,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937738721] [2019-12-27 00:48:52,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 00:48:52,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:48:52,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 00:48:52,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-12-27 00:48:52,280 INFO L87 Difference]: Start difference. First operand 54655 states and 219101 transitions. Second operand 18 states. [2019-12-27 00:48:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:48:52,654 INFO L93 Difference]: Finished difference Result 54527 states and 218397 transitions. [2019-12-27 00:48:52,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 00:48:52,655 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2019-12-27 00:48:52,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:48:53,365 INFO L225 Difference]: With dead ends: 54527 [2019-12-27 00:48:53,365 INFO L226 Difference]: Without dead ends: 54527 [2019-12-27 00:48:53,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-12-27 00:48:54,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54527 states. [2019-12-27 00:48:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54527 to 54527. [2019-12-27 00:48:54,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54527 states. [2019-12-27 00:48:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54527 states to 54527 states and 218397 transitions. [2019-12-27 00:48:54,791 INFO L78 Accepts]: Start accepts. Automaton has 54527 states and 218397 transitions. Word has length 53 [2019-12-27 00:48:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:48:54,791 INFO L462 AbstractCegarLoop]: Abstraction has 54527 states and 218397 transitions. [2019-12-27 00:48:54,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 00:48:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 54527 states and 218397 transitions. [2019-12-27 00:48:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:48:54,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:48:54,797 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:48:54,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:48:54,998 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:48:54,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:48:54,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1631424205, now seen corresponding path program 1 times [2019-12-27 00:48:54,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:48:55,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105341463] [2019-12-27 00:48:55,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:48:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:48:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:48:55,049 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:48:55,050 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:48:55,050 WARN L364 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:48:55,050 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2019-12-27 00:48:55,062 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,063 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,063 WARN L315 ript$VariableManager]: TermVariabe threadThread2of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,063 WARN L315 ript$VariableManager]: TermVariabe threadThread2of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,063 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,063 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,063 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,064 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,064 WARN L315 ript$VariableManager]: TermVariabe threadThread3of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,064 WARN L315 ript$VariableManager]: TermVariabe threadThread3of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,064 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,064 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,064 WARN L315 ript$VariableManager]: TermVariabe |threadThread9of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,064 WARN L315 ript$VariableManager]: TermVariabe |threadThread9of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,064 WARN L315 ript$VariableManager]: TermVariabe threadThread9of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,065 WARN L315 ript$VariableManager]: TermVariabe threadThread9of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,065 WARN L315 ript$VariableManager]: TermVariabe |threadThread9of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,065 WARN L315 ript$VariableManager]: TermVariabe |threadThread9of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,065 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,065 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,065 WARN L315 ript$VariableManager]: TermVariabe threadThread8of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,065 WARN L315 ript$VariableManager]: TermVariabe threadThread8of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,066 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,066 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,066 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,066 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,066 WARN L315 ript$VariableManager]: TermVariabe threadThread7of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,066 WARN L315 ript$VariableManager]: TermVariabe threadThread7of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,066 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,066 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,067 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,067 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,067 WARN L315 ript$VariableManager]: TermVariabe threadThread5of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,067 WARN L315 ript$VariableManager]: TermVariabe threadThread5of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,067 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,067 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,069 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,069 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,069 WARN L315 ript$VariableManager]: TermVariabe threadThread6of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,069 WARN L315 ript$VariableManager]: TermVariabe threadThread6of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,070 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,070 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,071 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,071 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,071 WARN L315 ript$VariableManager]: TermVariabe threadThread1of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,071 WARN L315 ript$VariableManager]: TermVariabe threadThread1of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,072 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,072 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,072 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,072 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,072 WARN L315 ript$VariableManager]: TermVariabe threadThread4of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,072 WARN L315 ript$VariableManager]: TermVariabe threadThread4of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,072 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,072 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,073 WARN L315 ript$VariableManager]: TermVariabe threadThread1of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,073 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,073 WARN L315 ript$VariableManager]: TermVariabe threadThread1of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,073 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,074 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,075 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,075 WARN L315 ript$VariableManager]: TermVariabe threadThread2of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,075 WARN L315 ript$VariableManager]: TermVariabe threadThread2of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,076 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,077 WARN L315 ript$VariableManager]: TermVariabe threadThread3of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,077 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,077 WARN L315 ript$VariableManager]: TermVariabe threadThread3of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,078 WARN L315 ript$VariableManager]: TermVariabe threadThread4of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,078 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,079 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,079 WARN L315 ript$VariableManager]: TermVariabe threadThread4of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,080 WARN L315 ript$VariableManager]: TermVariabe threadThread5of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,080 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,080 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,080 WARN L315 ript$VariableManager]: TermVariabe threadThread5of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,082 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,082 WARN L315 ript$VariableManager]: TermVariabe threadThread6of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,082 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,082 WARN L315 ript$VariableManager]: TermVariabe threadThread6of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,083 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,084 WARN L315 ript$VariableManager]: TermVariabe threadThread7of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,084 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,084 WARN L315 ript$VariableManager]: TermVariabe threadThread7of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,088 WARN L315 ript$VariableManager]: TermVariabe threadThread8of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,088 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,088 WARN L315 ript$VariableManager]: TermVariabe threadThread8of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,088 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,090 WARN L315 ript$VariableManager]: TermVariabe threadThread9of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,090 WARN L315 ript$VariableManager]: TermVariabe |threadThread9of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,090 WARN L315 ript$VariableManager]: TermVariabe threadThread9of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,090 WARN L315 ript$VariableManager]: TermVariabe |threadThread9of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:48:55,099 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 00:48:55,099 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:48:55,099 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:48:55,100 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:48:55,100 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:48:55,100 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:48:55,100 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:48:55,100 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:48:55,100 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:48:55,103 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 122 transitions [2019-12-27 00:48:55,103 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 127 places, 122 transitions [2019-12-27 00:49:03,813 INFO L132 PetriNetUnfolder]: 3860/19396 cut-off events. [2019-12-27 00:49:03,813 INFO L133 PetriNetUnfolder]: For 2460/2460 co-relation queries the response was YES. [2019-12-27 00:49:03,962 INFO L76 FinitePrefix]: Finished finitePrefix Result has 21773 conditions, 19396 events. 3860/19396 cut-off events. For 2460/2460 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 212691 event pairs. 0/16304 useless extension candidates. Maximal degree in co-relation 10719. Up to 2304 conditions per place. [2019-12-27 00:49:04,315 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 127 places, 122 transitions [2019-12-27 00:49:11,810 INFO L132 PetriNetUnfolder]: 3860/19396 cut-off events. [2019-12-27 00:49:11,810 INFO L133 PetriNetUnfolder]: For 2460/2460 co-relation queries the response was YES. [2019-12-27 00:49:11,984 INFO L76 FinitePrefix]: Finished finitePrefix Result has 21773 conditions, 19396 events. 3860/19396 cut-off events. For 2460/2460 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 212691 event pairs. 0/16304 useless extension candidates. Maximal degree in co-relation 10719. Up to 2304 conditions per place. [2019-12-27 00:49:12,337 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5472 [2019-12-27 00:49:12,337 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:49:12,362 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:12,383 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:49:12,387 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:12,408 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:49:12,409 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:12,410 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 00:49:12,431 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:12,454 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:49:12,457 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:12,477 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:49:12,478 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:12,479 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 00:49:15,800 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:15,834 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:49:15,839 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:15,873 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:49:15,874 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:15,874 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:49:15,883 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:15,917 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:49:15,921 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:15,950 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:49:15,951 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:15,951 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 00:49:18,517 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-12-27 00:49:18,634 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:18,702 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:49:18,708 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:18,770 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:49:18,771 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:18,771 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:49:18,787 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:18,847 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:49:18,852 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:18,900 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:49:18,901 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:49:18,901 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 00:49:21,347 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-12-27 00:49:21,470 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-27 00:49:21,936 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-27 00:49:22,100 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-12-27 00:49:22,196 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4435 [2019-12-27 00:49:22,196 INFO L214 etLargeBlockEncoding]: Total number of compositions: 84 [2019-12-27 00:49:22,197 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 43 transitions [2019-12-27 00:50:03,585 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 163089 states. [2019-12-27 00:50:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 163089 states. [2019-12-27 00:50:03,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 00:50:03,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:50:03,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 00:50:03,586 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:50:03,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:50:03,586 INFO L82 PathProgramCache]: Analyzing trace with hash 54015380, now seen corresponding path program 1 times [2019-12-27 00:50:03,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:50:03,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573400017] [2019-12-27 00:50:03,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:50:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:50:03,608 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 00:50:03,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573400017] [2019-12-27 00:50:03,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:50:03,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:50:03,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861999917] [2019-12-27 00:50:03,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:50:03,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:50:03,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:50:03,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:50:03,610 INFO L87 Difference]: Start difference. First operand 163089 states. Second operand 4 states. [2019-12-27 00:50:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:50:04,538 INFO L93 Difference]: Finished difference Result 185840 states and 807312 transitions. [2019-12-27 00:50:04,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:50:04,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-27 00:50:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:50:05,016 INFO L225 Difference]: With dead ends: 185840 [2019-12-27 00:50:05,016 INFO L226 Difference]: Without dead ends: 166667 [2019-12-27 00:50:05,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:50:15,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166667 states. [2019-12-27 00:50:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166667 to 162061. [2019-12-27 00:50:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162061 states. [2019-12-27 00:50:19,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162061 states to 162061 states and 710659 transitions. [2019-12-27 00:50:19,492 INFO L78 Accepts]: Start accepts. Automaton has 162061 states and 710659 transitions. Word has length 4 [2019-12-27 00:50:19,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:50:19,492 INFO L462 AbstractCegarLoop]: Abstraction has 162061 states and 710659 transitions. [2019-12-27 00:50:19,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:50:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand 162061 states and 710659 transitions. [2019-12-27 00:50:19,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:50:19,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:50:19,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:50:19,492 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:50:19,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:50:19,493 INFO L82 PathProgramCache]: Analyzing trace with hash 416229304, now seen corresponding path program 1 times [2019-12-27 00:50:19,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:50:19,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556985631] [2019-12-27 00:50:19,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:50:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:50:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:50:19,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556985631] [2019-12-27 00:50:19,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306191843] [2019-12-27 00:50:19,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:50:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:50:19,638 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 00:50:19,639 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:50:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:50:19,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:50:19,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-12-27 00:50:19,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199030181] [2019-12-27 00:50:19,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:50:19,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:50:19,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:50:19,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:50:19,665 INFO L87 Difference]: Start difference. First operand 162061 states and 710659 transitions. Second operand 7 states. Received shutdown request... [2019-12-27 00:50:28,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:50:28,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:50:28,375 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 00:50:28,382 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 00:50:28,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:50:28 BasicIcfg [2019-12-27 00:50:28,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:50:28,383 INFO L168 Benchmark]: Toolchain (without parser) took 231044.71 ms. Allocated memory was 146.3 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 102.2 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 00:50:28,384 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 00:50:28,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 916.22 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 123.6 MB in the end (delta: -21.8 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-27 00:50:28,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.18 ms. Allocated memory is still 204.5 MB. Free memory was 123.6 MB in the beginning and 120.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 00:50:28,385 INFO L168 Benchmark]: Boogie Preprocessor took 36.49 ms. Allocated memory is still 204.5 MB. Free memory was 120.9 MB in the beginning and 119.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 00:50:28,385 INFO L168 Benchmark]: RCFGBuilder took 503.90 ms. Allocated memory is still 204.5 MB. Free memory was 119.6 MB in the beginning and 95.3 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-27 00:50:28,386 INFO L168 Benchmark]: TraceAbstraction took 229524.21 ms. Allocated memory was 204.5 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 94.6 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 00:50:28,387 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.18 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 916.22 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 123.6 MB in the end (delta: -21.8 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.18 ms. Allocated memory is still 204.5 MB. Free memory was 123.6 MB in the beginning and 120.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.49 ms. Allocated memory is still 204.5 MB. Free memory was 120.9 MB in the beginning and 119.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 503.90 ms. Allocated memory is still 204.5 MB. Free memory was 119.6 MB in the beginning and 95.3 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 229524.21 ms. Allocated memory was 204.5 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 94.6 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.0s, 71 ProgramPointsBefore, 17 ProgramPointsAfterwards, 74 TransitionsBefore, 17 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 6 FixpointIterations, 23 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 4 ChoiceCompositions, 166 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 13 SemBasedMoverChecksNegative, 2 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 4.7s, 0 MoverChecksTotal, 278 CheckedPairsTotal, 61 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 11.0s, 78 ProgramPointsBefore, 23 ProgramPointsAfterwards, 80 TransitionsBefore, 22 TransitionsAfterwards, 824 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 4 ChoiceCompositions, 386 VarBasedMoverChecksPositive, 24 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 23 SemBasedMoverChecksNegative, 4 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 8.9s, 0 MoverChecksTotal, 733 CheckedPairsTotal, 62 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.7s, 85 ProgramPointsBefore, 27 ProgramPointsAfterwards, 86 TransitionsBefore, 25 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 4 ChoiceCompositions, 614 VarBasedMoverChecksPositive, 19 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 17 SemBasedMoverChecksNegative, 3 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 6.7s, 0 MoverChecksTotal, 1071 CheckedPairsTotal, 67 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.8s, 92 ProgramPointsBefore, 31 ProgramPointsAfterwards, 92 TransitionsBefore, 28 TransitionsAfterwards, 1872 CoEnabledTransitionPairs, 7 FixpointIterations, 19 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 4 ChoiceCompositions, 882 VarBasedMoverChecksPositive, 15 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 16 SemBasedMoverChecksNegative, 2 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 4.4s, 0 MoverChecksTotal, 1448 CheckedPairsTotal, 68 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 9.4s, 99 ProgramPointsBefore, 35 ProgramPointsAfterwards, 98 TransitionsBefore, 31 TransitionsAfterwards, 2480 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 4 ChoiceCompositions, 1216 VarBasedMoverChecksPositive, 22 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 21 SemBasedMoverChecksNegative, 3 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 6.6s, 0 MoverChecksTotal, 2037 CheckedPairsTotal, 72 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 11.3s, 106 ProgramPointsBefore, 39 ProgramPointsAfterwards, 104 TransitionsBefore, 34 TransitionsAfterwards, 3144 CoEnabledTransitionPairs, 7 FixpointIterations, 19 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 4 ChoiceCompositions, 1476 VarBasedMoverChecksPositive, 26 VarBasedMoverChecksNegative, 5 SemBasedMoverChecksPositive, 19 SemBasedMoverChecksNegative, 3 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 7.4s, 0 MoverChecksTotal, 2554 CheckedPairsTotal, 75 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 14.4s, 113 ProgramPointsBefore, 43 ProgramPointsAfterwards, 110 TransitionsBefore, 37 TransitionsAfterwards, 3864 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 4 ChoiceCompositions, 1793 VarBasedMoverChecksPositive, 29 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 27 SemBasedMoverChecksNegative, 4 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 9.2s, 0 MoverChecksTotal, 3195 CheckedPairsTotal, 78 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 12.9s, 120 ProgramPointsBefore, 47 ProgramPointsAfterwards, 116 TransitionsBefore, 40 TransitionsAfterwards, 4640 CoEnabledTransitionPairs, 7 FixpointIterations, 19 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 4 ChoiceCompositions, 2191 VarBasedMoverChecksPositive, 22 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 21 SemBasedMoverChecksNegative, 2 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 4.5s, 0 MoverChecksTotal, 3778 CheckedPairsTotal, 81 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 27.0s, 127 ProgramPointsBefore, 51 ProgramPointsAfterwards, 122 TransitionsBefore, 43 TransitionsAfterwards, 5472 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 4 ChoiceCompositions, 2586 VarBasedMoverChecksPositive, 27 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 27 SemBasedMoverChecksNegative, 3 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 6.8s, 0 MoverChecksTotal, 4435 CheckedPairsTotal, 84 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 1089]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1089). Cancelled while BasicCegarLoop was constructing difference of abstraction (162061states) and FLOYD_HOARE automaton (currently 5 states, 7 states before enhancement),while ReachableStatesComputation was computing reachable states (132214 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Result: TIMEOUT, OverallTime: 93.2s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 80 SDtfs, 208 SDslu, 110 SDs, 0 SdLazy, 53 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163089occurred 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: 14.4s AutomataMinimizationTime, 1 MinimizatonAttempts, 4606 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 1831 SizeOfPredicates, 1 NumberOfNonLiveVariables, 102 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 4/6 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 could not prove your program: Timeout Completed graceful shutdown