/usr/bin/java -Xmx16000000000 -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-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread/stack_longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 03:23:19,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 03:23:19,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 03:23:19,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 03:23:19,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 03:23:19,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 03:23:19,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 03:23:19,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 03:23:19,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 03:23:19,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 03:23:19,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 03:23:19,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 03:23:19,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 03:23:19,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 03:23:20,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 03:23:20,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 03:23:20,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 03:23:20,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 03:23:20,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 03:23:20,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 03:23:20,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 03:23:20,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 03:23:20,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 03:23:20,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 03:23:20,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 03:23:20,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 03:23:20,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 03:23:20,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 03:23:20,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 03:23:20,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 03:23:20,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 03:23:20,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 03:23:20,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 03:23:20,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 03:23:20,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 03:23:20,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 03:23:20,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 03:23:20,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 03:23:20,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 03:23:20,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 03:23:20,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 03:23:20,031 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-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 03:23:20,051 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 03:23:20,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 03:23:20,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 03:23:20,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 03:23:20,053 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 03:23:20,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 03:23:20,053 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 03:23:20,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 03:23:20,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 03:23:20,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 03:23:20,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 03:23:20,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 03:23:20,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 03:23:20,054 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 03:23:20,055 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 03:23:20,055 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 03:23:20,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 03:23:20,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 03:23:20,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 03:23:20,056 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 03:23:20,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 03:23:20,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 03:23:20,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 03:23:20,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 03:23:20,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 03:23:20,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 03:23:20,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 03:23:20,057 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 03:23:20,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 03:23:20,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 03:23:20,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 03:23:20,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 03:23:20,365 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 03:23:20,366 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 03:23:20,366 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-2.i [2020-10-16 03:23:20,421 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451cf41f5/9dc68a46455e41418620fc201d7e2a48/FLAG49e955019 [2020-10-16 03:23:20,972 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 03:23:20,973 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i [2020-10-16 03:23:20,991 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451cf41f5/9dc68a46455e41418620fc201d7e2a48/FLAG49e955019 [2020-10-16 03:23:21,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451cf41f5/9dc68a46455e41418620fc201d7e2a48 [2020-10-16 03:23:21,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 03:23:21,251 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 03:23:21,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 03:23:21,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 03:23:21,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 03:23:21,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 03:23:21" (1/1) ... [2020-10-16 03:23:21,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7e4e2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:23:21, skipping insertion in model container [2020-10-16 03:23:21,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 03:23:21" (1/1) ... [2020-10-16 03:23:21,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 03:23:21,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 03:23:21,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 03:23:21,853 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 03:23:21,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 03:23:22,051 INFO L208 MainTranslator]: Completed translation [2020-10-16 03:23:22,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:23:22 WrapperNode [2020-10-16 03:23:22,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 03:23:22,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 03:23:22,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 03:23:22,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 03:23:22,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:23:22" (1/1) ... [2020-10-16 03:23:22,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:23:22" (1/1) ... [2020-10-16 03:23:22,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 03:23:22,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 03:23:22,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 03:23:22,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 03:23:22,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:23:22" (1/1) ... [2020-10-16 03:23:22,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:23:22" (1/1) ... [2020-10-16 03:23:22,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:23:22" (1/1) ... [2020-10-16 03:23:22,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:23:22" (1/1) ... [2020-10-16 03:23:22,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:23:22" (1/1) ... [2020-10-16 03:23:22,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:23:22" (1/1) ... [2020-10-16 03:23:22,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:23:22" (1/1) ... [2020-10-16 03:23:22,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 03:23:22,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 03:23:22,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 03:23:22,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 03:23:22,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:23:22" (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 [2020-10-16 03:23:22,274 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-10-16 03:23:22,275 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-10-16 03:23:22,275 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-10-16 03:23:22,275 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-10-16 03:23:22,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 03:23:22,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 03:23:22,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-16 03:23:22,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 03:23:22,276 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-16 03:23:22,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-16 03:23:22,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 03:23:22,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 03:23:22,278 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 03:23:22,798 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 03:23:22,799 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-16 03:23:22,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 03:23:22 BoogieIcfgContainer [2020-10-16 03:23:22,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 03:23:22,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 03:23:22,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 03:23:22,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 03:23:22,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 03:23:21" (1/3) ... [2020-10-16 03:23:22,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63101c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 03:23:22, skipping insertion in model container [2020-10-16 03:23:22,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 03:23:22" (2/3) ... [2020-10-16 03:23:22,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63101c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 03:23:22, skipping insertion in model container [2020-10-16 03:23:22,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 03:23:22" (3/3) ... [2020-10-16 03:23:22,812 INFO L111 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2020-10-16 03:23:22,826 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 03:23:22,835 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 03:23:22,836 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 03:23:22,875 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,878 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,879 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,879 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,880 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,881 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,881 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,881 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,881 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,881 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,882 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,882 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,882 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,882 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,883 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,883 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,883 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,883 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,884 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,884 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,884 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,884 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,885 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,885 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,885 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,886 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,886 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,886 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,886 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,887 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,887 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,887 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,887 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,888 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,888 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,888 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,888 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,888 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,889 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,889 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,889 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,889 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,890 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,890 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,890 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,891 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,891 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,891 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,891 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,892 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,892 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,892 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,892 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,893 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,893 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,893 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,893 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,894 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,894 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,894 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,894 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,895 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,895 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,895 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,896 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,896 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,896 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,896 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,897 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,898 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,898 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,898 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,898 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,899 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,899 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,899 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,899 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,900 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,900 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,900 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,901 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,901 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,901 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,901 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,901 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,902 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,902 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,902 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,902 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,903 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,903 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,903 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,903 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,904 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,904 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,904 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,904 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,905 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,905 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,906 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,906 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,906 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,906 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,907 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,907 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,907 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,908 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,908 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,908 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,908 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,909 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,909 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,909 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,909 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,910 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,910 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,910 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,911 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,911 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,911 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,911 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,912 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,912 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,916 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,916 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,916 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,916 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,917 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,917 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,917 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,917 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,918 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,918 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,918 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,918 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,919 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,919 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,919 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,919 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,919 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,920 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,920 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,920 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,920 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,921 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,921 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,929 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,929 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,930 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,930 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,930 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,930 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,930 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,931 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,931 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,931 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,931 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,932 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,932 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,932 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,932 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,933 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,933 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,933 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 03:23:22,959 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 03:23:22,984 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 03:23:22,984 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 03:23:22,984 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 03:23:22,984 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 03:23:22,985 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 03:23:22,985 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 03:23:22,985 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 03:23:22,985 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 03:23:23,002 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 133 places, 138 transitions, 298 flow [2020-10-16 03:23:23,079 INFO L129 PetriNetUnfolder]: 11/138 cut-off events. [2020-10-16 03:23:23,080 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 03:23:23,089 INFO L80 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 138 events. 11/138 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 106. Up to 3 conditions per place. [2020-10-16 03:23:23,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 138 transitions, 298 flow [2020-10-16 03:23:23,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 126 transitions, 264 flow [2020-10-16 03:23:23,101 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 03:23:23,104 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 126 transitions, 264 flow [2020-10-16 03:23:23,107 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 126 transitions, 264 flow [2020-10-16 03:23:23,108 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 126 transitions, 264 flow [2020-10-16 03:23:23,171 INFO L129 PetriNetUnfolder]: 10/128 cut-off events. [2020-10-16 03:23:23,172 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-16 03:23:23,176 INFO L80 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 128 events. 10/128 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 278 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 106. Up to 3 conditions per place. [2020-10-16 03:23:23,184 INFO L117 LiptonReduction]: Number of co-enabled transitions 5744 [2020-10-16 03:23:25,367 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-10-16 03:23:26,125 WARN L193 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2020-10-16 03:23:26,286 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-16 03:23:26,580 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-16 03:23:26,786 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-16 03:23:26,834 INFO L132 LiptonReduction]: Checked pairs total: 9349 [2020-10-16 03:23:26,835 INFO L134 LiptonReduction]: Total number of compositions: 118 [2020-10-16 03:23:26,838 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3739 [2020-10-16 03:23:26,845 INFO L129 PetriNetUnfolder]: 1/13 cut-off events. [2020-10-16 03:23:26,846 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-10-16 03:23:26,846 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 03:23:26,847 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-16 03:23:26,847 INFO L429 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 03:23:26,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 03:23:26,854 INFO L82 PathProgramCache]: Analyzing trace with hash -461369305, now seen corresponding path program 1 times [2020-10-16 03:23:26,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 03:23:26,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837566168] [2020-10-16 03:23:26,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 03:23:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 03:23:27,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837566168] [2020-10-16 03:23:27,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 03:23:27,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 03:23:27,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056828059] [2020-10-16 03:23:27,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 03:23:27,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 03:23:27,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 03:23:27,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 03:23:27,102 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 256 [2020-10-16 03:23:27,105 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 34 transitions, 80 flow. Second operand 3 states. [2020-10-16 03:23:27,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 03:23:27,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 256 [2020-10-16 03:23:27,108 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 03:23:27,191 INFO L129 PetriNetUnfolder]: 54/170 cut-off events. [2020-10-16 03:23:27,192 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2020-10-16 03:23:27,193 INFO L80 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 170 events. 54/170 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 621 event pairs, 18 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 259. Up to 71 conditions per place. [2020-10-16 03:23:27,196 INFO L132 encePairwiseOnDemand]: 251/256 looper letters, 15 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2020-10-16 03:23:27,196 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 126 flow [2020-10-16 03:23:27,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 03:23:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 03:23:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 608 transitions. [2020-10-16 03:23:27,215 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2020-10-16 03:23:27,216 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 608 transitions. [2020-10-16 03:23:27,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 608 transitions. [2020-10-16 03:23:27,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 03:23:27,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 608 transitions. [2020-10-16 03:23:27,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 03:23:27,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 03:23:27,237 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 03:23:27,239 INFO L185 Difference]: Start difference. First operand has 35 places, 34 transitions, 80 flow. Second operand 3 states and 608 transitions. [2020-10-16 03:23:27,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 126 flow [2020-10-16 03:23:27,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 03:23:27,246 INFO L241 Difference]: Finished difference. Result has 34 places, 35 transitions, 89 flow [2020-10-16 03:23:27,249 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=35} [2020-10-16 03:23:27,250 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2020-10-16 03:23:27,250 INFO L481 AbstractCegarLoop]: Abstraction has has 34 places, 35 transitions, 89 flow [2020-10-16 03:23:27,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 03:23:27,250 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 03:23:27,250 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 03:23:27,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 03:23:27,251 INFO L429 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 03:23:27,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 03:23:27,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1604352594, now seen corresponding path program 1 times [2020-10-16 03:23:27,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 03:23:27,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925616311] [2020-10-16 03:23:27,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 03:23:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 03:23:27,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925616311] [2020-10-16 03:23:27,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 03:23:27,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 03:23:27,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110665116] [2020-10-16 03:23:27,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 03:23:27,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 03:23:27,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 03:23:27,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 03:23:27,332 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 256 [2020-10-16 03:23:27,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 35 transitions, 89 flow. Second operand 3 states. [2020-10-16 03:23:27,332 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 03:23:27,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 256 [2020-10-16 03:23:27,333 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 03:23:27,371 INFO L129 PetriNetUnfolder]: 12/93 cut-off events. [2020-10-16 03:23:27,371 INFO L130 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2020-10-16 03:23:27,372 INFO L80 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 93 events. 12/93 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 264 event pairs, 1 based on Foata normal form. 1/81 useless extension candidates. Maximal degree in co-relation 90. Up to 11 conditions per place. [2020-10-16 03:23:27,373 INFO L132 encePairwiseOnDemand]: 253/256 looper letters, 4 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2020-10-16 03:23:27,373 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 105 flow [2020-10-16 03:23:27,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 03:23:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 03:23:27,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2020-10-16 03:23:27,382 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8606770833333334 [2020-10-16 03:23:27,382 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 661 transitions. [2020-10-16 03:23:27,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 661 transitions. [2020-10-16 03:23:27,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 03:23:27,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 661 transitions. [2020-10-16 03:23:27,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 03:23:27,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 03:23:27,392 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 03:23:27,392 INFO L185 Difference]: Start difference. First operand has 34 places, 35 transitions, 89 flow. Second operand 3 states and 661 transitions. [2020-10-16 03:23:27,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 105 flow [2020-10-16 03:23:27,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 102 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 03:23:27,397 INFO L241 Difference]: Finished difference. Result has 36 places, 36 transitions, 101 flow [2020-10-16 03:23:27,398 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=36, PETRI_TRANSITIONS=36} [2020-10-16 03:23:27,399 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2020-10-16 03:23:27,399 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 101 flow [2020-10-16 03:23:27,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 03:23:27,399 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 03:23:27,400 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 03:23:27,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 03:23:27,401 INFO L429 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 03:23:27,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 03:23:27,402 INFO L82 PathProgramCache]: Analyzing trace with hash 873993597, now seen corresponding path program 1 times [2020-10-16 03:23:27,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 03:23:27,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107790292] [2020-10-16 03:23:27,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 03:23:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 03:23:27,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107790292] [2020-10-16 03:23:27,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777085869] [2020-10-16 03:23:27,553 INFO L95 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 [2020-10-16 03:23:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:27,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-16 03:23:27,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-16 03:23:27,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 03:23:27,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-16 03:23:27,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-10-16 03:23:27,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385726943] [2020-10-16 03:23:27,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 03:23:27,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 03:23:27,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 03:23:27,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 03:23:27,705 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 256 [2020-10-16 03:23:27,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 101 flow. Second operand 7 states. [2020-10-16 03:23:27,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 03:23:27,707 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 256 [2020-10-16 03:23:27,707 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 03:23:27,888 INFO L129 PetriNetUnfolder]: 104/365 cut-off events. [2020-10-16 03:23:27,889 INFO L130 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2020-10-16 03:23:27,890 INFO L80 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 365 events. 104/365 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2025 event pairs, 12 based on Foata normal form. 13/336 useless extension candidates. Maximal degree in co-relation 568. Up to 83 conditions per place. [2020-10-16 03:23:27,894 INFO L132 encePairwiseOnDemand]: 248/256 looper letters, 25 selfloop transitions, 13 changer transitions 0/59 dead transitions. [2020-10-16 03:23:27,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 247 flow [2020-10-16 03:23:27,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 03:23:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 03:23:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1393 transitions. [2020-10-16 03:23:27,900 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.77734375 [2020-10-16 03:23:27,901 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1393 transitions. [2020-10-16 03:23:27,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1393 transitions. [2020-10-16 03:23:27,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 03:23:27,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1393 transitions. [2020-10-16 03:23:27,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 03:23:27,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 03:23:27,910 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 03:23:27,911 INFO L185 Difference]: Start difference. First operand has 36 places, 36 transitions, 101 flow. Second operand 7 states and 1393 transitions. [2020-10-16 03:23:27,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 247 flow [2020-10-16 03:23:27,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 59 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 03:23:27,914 INFO L241 Difference]: Finished difference. Result has 46 places, 46 transitions, 206 flow [2020-10-16 03:23:27,915 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=206, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2020-10-16 03:23:27,915 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2020-10-16 03:23:27,915 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 206 flow [2020-10-16 03:23:27,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 03:23:27,916 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 03:23:27,916 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 03:23:28,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-10-16 03:23:28,131 INFO L429 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 03:23:28,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 03:23:28,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1025090109, now seen corresponding path program 1 times [2020-10-16 03:23:28,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 03:23:28,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426476015] [2020-10-16 03:23:28,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 03:23:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 03:23:28,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426476015] [2020-10-16 03:23:28,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 03:23:28,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 03:23:28,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787528945] [2020-10-16 03:23:28,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 03:23:28,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 03:23:28,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 03:23:28,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 03:23:28,182 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 256 [2020-10-16 03:23:28,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 206 flow. Second operand 3 states. [2020-10-16 03:23:28,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 03:23:28,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 256 [2020-10-16 03:23:28,183 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 03:23:28,221 INFO L129 PetriNetUnfolder]: 14/122 cut-off events. [2020-10-16 03:23:28,221 INFO L130 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2020-10-16 03:23:28,222 INFO L80 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 122 events. 14/122 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 422 event pairs, 0 based on Foata normal form. 12/134 useless extension candidates. Maximal degree in co-relation 195. Up to 14 conditions per place. [2020-10-16 03:23:28,223 INFO L132 encePairwiseOnDemand]: 251/256 looper letters, 1 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2020-10-16 03:23:28,223 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 200 flow [2020-10-16 03:23:28,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 03:23:28,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 03:23:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2020-10-16 03:23:28,226 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7955729166666666 [2020-10-16 03:23:28,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 611 transitions. [2020-10-16 03:23:28,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 611 transitions. [2020-10-16 03:23:28,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 03:23:28,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 611 transitions. [2020-10-16 03:23:28,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 03:23:28,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 03:23:28,230 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 03:23:28,230 INFO L185 Difference]: Start difference. First operand has 46 places, 46 transitions, 206 flow. Second operand 3 states and 611 transitions. [2020-10-16 03:23:28,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 200 flow [2020-10-16 03:23:28,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 190 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 03:23:28,234 INFO L241 Difference]: Finished difference. Result has 46 places, 44 transitions, 188 flow [2020-10-16 03:23:28,235 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2020-10-16 03:23:28,235 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2020-10-16 03:23:28,235 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 188 flow [2020-10-16 03:23:28,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 03:23:28,235 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 03:23:28,235 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 03:23:28,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 03:23:28,236 INFO L429 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 03:23:28,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 03:23:28,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1347278275, now seen corresponding path program 1 times [2020-10-16 03:23:28,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 03:23:28,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283023069] [2020-10-16 03:23:28,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 03:23:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 03:23:28,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283023069] [2020-10-16 03:23:28,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 03:23:28,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 03:23:28,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80518089] [2020-10-16 03:23:28,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 03:23:28,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 03:23:28,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 03:23:28,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 03:23:28,283 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 256 [2020-10-16 03:23:28,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 188 flow. Second operand 3 states. [2020-10-16 03:23:28,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 03:23:28,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 256 [2020-10-16 03:23:28,285 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 03:23:28,343 INFO L129 PetriNetUnfolder]: 15/130 cut-off events. [2020-10-16 03:23:28,344 INFO L130 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2020-10-16 03:23:28,344 INFO L80 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 130 events. 15/130 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 472 event pairs, 0 based on Foata normal form. 3/133 useless extension candidates. Maximal degree in co-relation 251. Up to 35 conditions per place. [2020-10-16 03:23:28,345 INFO L132 encePairwiseOnDemand]: 250/256 looper letters, 21 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2020-10-16 03:23:28,346 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 258 flow [2020-10-16 03:23:28,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 03:23:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 03:23:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 608 transitions. [2020-10-16 03:23:28,348 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2020-10-16 03:23:28,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 608 transitions. [2020-10-16 03:23:28,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 608 transitions. [2020-10-16 03:23:28,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 03:23:28,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 608 transitions. [2020-10-16 03:23:28,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 03:23:28,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 03:23:28,353 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 03:23:28,353 INFO L185 Difference]: Start difference. First operand has 46 places, 44 transitions, 188 flow. Second operand 3 states and 608 transitions. [2020-10-16 03:23:28,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 258 flow [2020-10-16 03:23:28,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 48 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 03:23:28,357 INFO L241 Difference]: Finished difference. Result has 49 places, 45 transitions, 218 flow [2020-10-16 03:23:28,357 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2020-10-16 03:23:28,358 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2020-10-16 03:23:28,358 INFO L481 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 218 flow [2020-10-16 03:23:28,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 03:23:28,358 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 03:23:28,358 INFO L255 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-10-16 03:23:28,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 03:23:28,359 INFO L429 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 03:23:28,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 03:23:28,359 INFO L82 PathProgramCache]: Analyzing trace with hash -184188057, now seen corresponding path program 2 times [2020-10-16 03:23:28,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 03:23:28,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042932550] [2020-10-16 03:23:28,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 03:23:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 03:23:28,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042932550] [2020-10-16 03:23:28,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630961845] [2020-10-16 03:23:28,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-10-16 03:23:28,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-16 03:23:28,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-16 03:23:28,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-16 03:23:28,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-16 03:23:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 03:23:28,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-16 03:23:28,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-10-16 03:23:28,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898866272] [2020-10-16 03:23:28,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 03:23:28,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 03:23:28,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 03:23:28,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-16 03:23:28,607 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 256 [2020-10-16 03:23:28,608 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 218 flow. Second operand 9 states. [2020-10-16 03:23:28,608 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 03:23:28,608 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 256 [2020-10-16 03:23:28,608 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 03:23:28,736 INFO L129 PetriNetUnfolder]: 18/159 cut-off events. [2020-10-16 03:23:28,736 INFO L130 PetriNetUnfolder]: For 233/233 co-relation queries the response was YES. [2020-10-16 03:23:28,737 INFO L80 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 159 events. 18/159 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 569 event pairs, 0 based on Foata normal form. 2/158 useless extension candidates. Maximal degree in co-relation 319. Up to 31 conditions per place. [2020-10-16 03:23:28,738 INFO L132 encePairwiseOnDemand]: 250/256 looper letters, 31 selfloop transitions, 13 changer transitions 0/65 dead transitions. [2020-10-16 03:23:28,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 394 flow [2020-10-16 03:23:28,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 03:23:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 03:23:28,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1779 transitions. [2020-10-16 03:23:28,745 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7721354166666666 [2020-10-16 03:23:28,745 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1779 transitions. [2020-10-16 03:23:28,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1779 transitions. [2020-10-16 03:23:28,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 03:23:28,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1779 transitions. [2020-10-16 03:23:28,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 03:23:28,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 03:23:28,756 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 03:23:28,756 INFO L185 Difference]: Start difference. First operand has 49 places, 45 transitions, 218 flow. Second operand 9 states and 1779 transitions. [2020-10-16 03:23:28,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 394 flow [2020-10-16 03:23:28,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 372 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 03:23:28,760 INFO L241 Difference]: Finished difference. Result has 57 places, 49 transitions, 275 flow [2020-10-16 03:23:28,761 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=275, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2020-10-16 03:23:28,761 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2020-10-16 03:23:28,761 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 275 flow [2020-10-16 03:23:28,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 03:23:28,761 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 03:23:28,762 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 03:23:28,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-16 03:23:28,978 INFO L429 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 03:23:28,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 03:23:28,979 INFO L82 PathProgramCache]: Analyzing trace with hash -909717566, now seen corresponding path program 1 times [2020-10-16 03:23:28,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 03:23:28,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637110885] [2020-10-16 03:23:28,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 03:23:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:29,603 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2020-10-16 03:23:30,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 03:23:30,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637110885] [2020-10-16 03:23:30,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 03:23:30,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 03:23:30,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505555937] [2020-10-16 03:23:30,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 03:23:30,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 03:23:30,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 03:23:30,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-16 03:23:30,014 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 256 [2020-10-16 03:23:30,015 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 275 flow. Second operand 10 states. [2020-10-16 03:23:30,015 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 03:23:30,015 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 256 [2020-10-16 03:23:30,015 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 03:23:30,822 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-10-16 03:23:31,136 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2020-10-16 03:23:31,412 INFO L129 PetriNetUnfolder]: 353/898 cut-off events. [2020-10-16 03:23:31,412 INFO L130 PetriNetUnfolder]: For 901/901 co-relation queries the response was YES. [2020-10-16 03:23:31,415 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2343 conditions, 898 events. 353/898 cut-off events. For 901/901 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5299 event pairs, 71 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 1252. Up to 484 conditions per place. [2020-10-16 03:23:31,421 INFO L132 encePairwiseOnDemand]: 246/256 looper letters, 69 selfloop transitions, 16 changer transitions 1/98 dead transitions. [2020-10-16 03:23:31,422 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 98 transitions, 649 flow [2020-10-16 03:23:31,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 03:23:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 03:23:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1307 transitions. [2020-10-16 03:23:31,428 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.510546875 [2020-10-16 03:23:31,428 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1307 transitions. [2020-10-16 03:23:31,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1307 transitions. [2020-10-16 03:23:31,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 03:23:31,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1307 transitions. [2020-10-16 03:23:31,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 03:23:31,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 03:23:31,437 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 03:23:31,437 INFO L185 Difference]: Start difference. First operand has 57 places, 49 transitions, 275 flow. Second operand 10 states and 1307 transitions. [2020-10-16 03:23:31,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 98 transitions, 649 flow [2020-10-16 03:23:31,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 98 transitions, 614 flow, removed 4 selfloop flow, removed 5 redundant places. [2020-10-16 03:23:31,444 INFO L241 Difference]: Finished difference. Result has 67 places, 64 transitions, 356 flow [2020-10-16 03:23:31,444 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=356, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2020-10-16 03:23:31,444 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2020-10-16 03:23:31,444 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 356 flow [2020-10-16 03:23:31,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 03:23:31,445 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 03:23:31,445 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 03:23:31,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 03:23:31,445 INFO L429 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 03:23:31,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 03:23:31,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1157930222, now seen corresponding path program 2 times [2020-10-16 03:23:31,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 03:23:31,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547375658] [2020-10-16 03:23:31,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 03:23:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 03:23:32,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547375658] [2020-10-16 03:23:32,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 03:23:32,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 03:23:32,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226710439] [2020-10-16 03:23:32,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 03:23:32,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 03:23:32,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 03:23:32,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-16 03:23:32,233 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 256 [2020-10-16 03:23:32,234 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 356 flow. Second operand 10 states. [2020-10-16 03:23:32,234 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 03:23:32,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 256 [2020-10-16 03:23:32,235 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 03:23:32,827 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2020-10-16 03:23:33,020 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2020-10-16 03:23:33,936 INFO L129 PetriNetUnfolder]: 549/1433 cut-off events. [2020-10-16 03:23:33,936 INFO L130 PetriNetUnfolder]: For 1304/1304 co-relation queries the response was YES. [2020-10-16 03:23:33,942 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4026 conditions, 1433 events. 549/1433 cut-off events. For 1304/1304 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 10049 event pairs, 135 based on Foata normal form. 0/1373 useless extension candidates. Maximal degree in co-relation 2559. Up to 697 conditions per place. [2020-10-16 03:23:33,951 INFO L132 encePairwiseOnDemand]: 245/256 looper letters, 88 selfloop transitions, 27 changer transitions 1/128 dead transitions. [2020-10-16 03:23:33,951 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 128 transitions, 871 flow [2020-10-16 03:23:33,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 03:23:33,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 03:23:33,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1697 transitions. [2020-10-16 03:23:33,959 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5099158653846154 [2020-10-16 03:23:33,959 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1697 transitions. [2020-10-16 03:23:33,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1697 transitions. [2020-10-16 03:23:33,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 03:23:33,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1697 transitions. [2020-10-16 03:23:33,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 03:23:33,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 03:23:33,970 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 03:23:33,970 INFO L185 Difference]: Start difference. First operand has 67 places, 64 transitions, 356 flow. Second operand 13 states and 1697 transitions. [2020-10-16 03:23:33,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 128 transitions, 871 flow [2020-10-16 03:23:33,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 128 transitions, 871 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 03:23:33,987 INFO L241 Difference]: Finished difference. Result has 86 places, 81 transitions, 555 flow [2020-10-16 03:23:33,988 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=555, PETRI_PLACES=86, PETRI_TRANSITIONS=81} [2020-10-16 03:23:33,988 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 51 predicate places. [2020-10-16 03:23:33,988 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 81 transitions, 555 flow [2020-10-16 03:23:33,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 03:23:33,988 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 03:23:33,989 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 03:23:33,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 03:23:33,989 INFO L429 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 03:23:33,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 03:23:33,989 INFO L82 PathProgramCache]: Analyzing trace with hash 188548802, now seen corresponding path program 3 times [2020-10-16 03:23:33,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 03:23:33,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796613234] [2020-10-16 03:23:33,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 03:23:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 03:23:34,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796613234] [2020-10-16 03:23:34,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 03:23:34,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 03:23:34,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853882744] [2020-10-16 03:23:34,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 03:23:34,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 03:23:34,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 03:23:34,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-16 03:23:34,848 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 256 [2020-10-16 03:23:34,849 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 81 transitions, 555 flow. Second operand 10 states. [2020-10-16 03:23:34,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 03:23:34,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 256 [2020-10-16 03:23:34,849 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 03:23:35,187 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2020-10-16 03:23:35,728 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2020-10-16 03:23:36,787 INFO L129 PetriNetUnfolder]: 632/1668 cut-off events. [2020-10-16 03:23:36,787 INFO L130 PetriNetUnfolder]: For 2220/2224 co-relation queries the response was YES. [2020-10-16 03:23:36,795 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5240 conditions, 1668 events. 632/1668 cut-off events. For 2220/2224 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12158 event pairs, 184 based on Foata normal form. 4/1604 useless extension candidates. Maximal degree in co-relation 3274. Up to 859 conditions per place. [2020-10-16 03:23:36,806 INFO L132 encePairwiseOnDemand]: 245/256 looper letters, 90 selfloop transitions, 28 changer transitions 1/131 dead transitions. [2020-10-16 03:23:36,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 131 transitions, 1048 flow [2020-10-16 03:23:36,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 03:23:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 03:23:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1566 transitions. [2020-10-16 03:23:36,813 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.509765625 [2020-10-16 03:23:36,813 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1566 transitions. [2020-10-16 03:23:36,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1566 transitions. [2020-10-16 03:23:36,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 03:23:36,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1566 transitions. [2020-10-16 03:23:36,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 03:23:36,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 03:23:36,824 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 03:23:36,824 INFO L185 Difference]: Start difference. First operand has 86 places, 81 transitions, 555 flow. Second operand 12 states and 1566 transitions. [2020-10-16 03:23:36,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 131 transitions, 1048 flow [2020-10-16 03:23:36,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 131 transitions, 1032 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 03:23:36,841 INFO L241 Difference]: Finished difference. Result has 100 places, 91 transitions, 716 flow [2020-10-16 03:23:36,841 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=716, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2020-10-16 03:23:36,842 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 65 predicate places. [2020-10-16 03:23:36,842 INFO L481 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 716 flow [2020-10-16 03:23:36,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 03:23:36,842 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 03:23:36,842 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 03:23:36,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 03:23:36,843 INFO L429 AbstractCegarLoop]: === Iteration 10 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 03:23:36,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 03:23:36,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1666321511, now seen corresponding path program 1 times [2020-10-16 03:23:36,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 03:23:36,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802490391] [2020-10-16 03:23:36,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 03:23:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 03:23:36,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802490391] [2020-10-16 03:23:36,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279319040] [2020-10-16 03:23:36,922 INFO L95 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 [2020-10-16 03:23:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:36,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-16 03:23:37,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-16 03:23:37,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-16 03:23:37,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-16 03:23:37,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2020-10-16 03:23:37,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389832920] [2020-10-16 03:23:37,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 03:23:37,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 03:23:37,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 03:23:37,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 03:23:37,029 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 256 [2020-10-16 03:23:37,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 716 flow. Second operand 6 states. [2020-10-16 03:23:37,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 03:23:37,030 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 256 [2020-10-16 03:23:37,030 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 03:23:37,179 INFO L129 PetriNetUnfolder]: 91/575 cut-off events. [2020-10-16 03:23:37,179 INFO L130 PetriNetUnfolder]: For 1347/1349 co-relation queries the response was YES. [2020-10-16 03:23:37,183 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1907 conditions, 575 events. 91/575 cut-off events. For 1347/1349 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3626 event pairs, 3 based on Foata normal form. 13/580 useless extension candidates. Maximal degree in co-relation 1600. Up to 84 conditions per place. [2020-10-16 03:23:37,186 INFO L132 encePairwiseOnDemand]: 248/256 looper letters, 41 selfloop transitions, 19 changer transitions 0/109 dead transitions. [2020-10-16 03:23:37,187 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 109 transitions, 963 flow [2020-10-16 03:23:37,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 03:23:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 03:23:37,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1169 transitions. [2020-10-16 03:23:37,191 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7610677083333334 [2020-10-16 03:23:37,191 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1169 transitions. [2020-10-16 03:23:37,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1169 transitions. [2020-10-16 03:23:37,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 03:23:37,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1169 transitions. [2020-10-16 03:23:37,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 03:23:37,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 03:23:37,198 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 03:23:37,199 INFO L185 Difference]: Start difference. First operand has 100 places, 91 transitions, 716 flow. Second operand 6 states and 1169 transitions. [2020-10-16 03:23:37,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 109 transitions, 963 flow [2020-10-16 03:23:37,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 109 transitions, 945 flow, removed 4 selfloop flow, removed 3 redundant places. [2020-10-16 03:23:37,209 INFO L241 Difference]: Finished difference. Result has 105 places, 98 transitions, 836 flow [2020-10-16 03:23:37,210 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=836, PETRI_PLACES=105, PETRI_TRANSITIONS=98} [2020-10-16 03:23:37,211 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2020-10-16 03:23:37,211 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 98 transitions, 836 flow [2020-10-16 03:23:37,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 03:23:37,211 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 03:23:37,211 INFO L255 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2020-10-16 03:23:37,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-10-16 03:23:37,427 INFO L429 AbstractCegarLoop]: === Iteration 11 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 03:23:37,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 03:23:37,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1822000579, now seen corresponding path program 3 times [2020-10-16 03:23:37,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 03:23:37,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155332252] [2020-10-16 03:23:37,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 03:23:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 03:23:37,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155332252] [2020-10-16 03:23:37,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95088923] [2020-10-16 03:23:37,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-10-16 03:23:37,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-16 03:23:37,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-16 03:23:37,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-16 03:23:37,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-16 03:23:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 03:23:37,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-16 03:23:37,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-10-16 03:23:37,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354968474] [2020-10-16 03:23:37,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 03:23:37,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 03:23:37,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 03:23:37,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-16 03:23:37,645 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 256 [2020-10-16 03:23:37,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 98 transitions, 836 flow. Second operand 11 states. [2020-10-16 03:23:37,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 03:23:37,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 256 [2020-10-16 03:23:37,647 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 03:23:37,879 INFO L129 PetriNetUnfolder]: 56/509 cut-off events. [2020-10-16 03:23:37,879 INFO L130 PetriNetUnfolder]: For 1534/1536 co-relation queries the response was YES. [2020-10-16 03:23:37,883 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 509 events. 56/509 cut-off events. For 1534/1536 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3094 event pairs, 0 based on Foata normal form. 5/509 useless extension candidates. Maximal degree in co-relation 1402. Up to 72 conditions per place. [2020-10-16 03:23:37,886 INFO L132 encePairwiseOnDemand]: 250/256 looper letters, 49 selfloop transitions, 22 changer transitions 0/121 dead transitions. [2020-10-16 03:23:37,887 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 121 transitions, 1172 flow [2020-10-16 03:23:37,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 03:23:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 03:23:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2174 transitions. [2020-10-16 03:23:37,893 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7720170454545454 [2020-10-16 03:23:37,894 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2174 transitions. [2020-10-16 03:23:37,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2174 transitions. [2020-10-16 03:23:37,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 03:23:37,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2174 transitions. [2020-10-16 03:23:37,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 03:23:37,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 03:23:37,904 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 03:23:37,904 INFO L185 Difference]: Start difference. First operand has 105 places, 98 transitions, 836 flow. Second operand 11 states and 2174 transitions. [2020-10-16 03:23:37,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 121 transitions, 1172 flow [2020-10-16 03:23:37,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 121 transitions, 1154 flow, removed 9 selfloop flow, removed 0 redundant places. [2020-10-16 03:23:37,915 INFO L241 Difference]: Finished difference. Result has 117 places, 102 transitions, 926 flow [2020-10-16 03:23:37,916 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=926, PETRI_PLACES=117, PETRI_TRANSITIONS=102} [2020-10-16 03:23:37,916 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 82 predicate places. [2020-10-16 03:23:37,916 INFO L481 AbstractCegarLoop]: Abstraction has has 117 places, 102 transitions, 926 flow [2020-10-16 03:23:37,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 03:23:37,916 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 03:23:37,917 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 03:23:38,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-16 03:23:38,131 INFO L429 AbstractCegarLoop]: === Iteration 12 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 03:23:38,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 03:23:38,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1918787154, now seen corresponding path program 4 times [2020-10-16 03:23:38,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 03:23:38,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000812209] [2020-10-16 03:23:38,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 03:23:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-16 03:23:38,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000812209] [2020-10-16 03:23:38,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 03:23:38,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 03:23:38,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462210305] [2020-10-16 03:23:38,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 03:23:38,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 03:23:38,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 03:23:38,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-10-16 03:23:38,490 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 256 [2020-10-16 03:23:38,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 102 transitions, 926 flow. Second operand 14 states. [2020-10-16 03:23:38,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 03:23:38,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 256 [2020-10-16 03:23:38,492 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 03:23:40,000 INFO L129 PetriNetUnfolder]: 741/1968 cut-off events. [2020-10-16 03:23:40,000 INFO L130 PetriNetUnfolder]: For 5387/5391 co-relation queries the response was YES. [2020-10-16 03:23:40,016 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7232 conditions, 1968 events. 741/1968 cut-off events. For 5387/5391 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 13763 event pairs, 42 based on Foata normal form. 1/1929 useless extension candidates. Maximal degree in co-relation 5154. Up to 370 conditions per place. [2020-10-16 03:23:40,029 INFO L132 encePairwiseOnDemand]: 240/256 looper letters, 95 selfloop transitions, 89 changer transitions 0/196 dead transitions. [2020-10-16 03:23:40,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 196 transitions, 1805 flow [2020-10-16 03:23:40,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-16 03:23:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-16 03:23:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3159 transitions. [2020-10-16 03:23:40,043 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.49359375 [2020-10-16 03:23:40,043 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3159 transitions. [2020-10-16 03:23:40,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3159 transitions. [2020-10-16 03:23:40,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 03:23:40,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3159 transitions. [2020-10-16 03:23:40,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 26 states. [2020-10-16 03:23:40,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 26 states. [2020-10-16 03:23:40,063 INFO L81 ComplementDD]: Finished complementDD. Result 26 states. [2020-10-16 03:23:40,063 INFO L185 Difference]: Start difference. First operand has 117 places, 102 transitions, 926 flow. Second operand 25 states and 3159 transitions. [2020-10-16 03:23:40,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 196 transitions, 1805 flow [2020-10-16 03:23:40,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 196 transitions, 1737 flow, removed 9 selfloop flow, removed 8 redundant places. [2020-10-16 03:23:40,093 INFO L241 Difference]: Finished difference. Result has 138 places, 131 transitions, 1380 flow [2020-10-16 03:23:40,094 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1380, PETRI_PLACES=138, PETRI_TRANSITIONS=131} [2020-10-16 03:23:40,094 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 103 predicate places. [2020-10-16 03:23:40,095 INFO L481 AbstractCegarLoop]: Abstraction has has 138 places, 131 transitions, 1380 flow [2020-10-16 03:23:40,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 03:23:40,095 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 03:23:40,095 INFO L255 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 03:23:40,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 03:23:40,096 INFO L429 AbstractCegarLoop]: === Iteration 13 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 03:23:40,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 03:23:40,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1646530177, now seen corresponding path program 2 times [2020-10-16 03:23:40,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 03:23:40,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857387330] [2020-10-16 03:23:40,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 03:23:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-16 03:23:40,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857387330] [2020-10-16 03:23:40,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419257766] [2020-10-16 03:23:40,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-10-16 03:23:40,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-16 03:23:40,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-16 03:23:40,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-16 03:23:40,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-16 03:23:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-16 03:23:40,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-16 03:23:40,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-16 03:23:40,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421243394] [2020-10-16 03:23:40,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 03:23:40,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 03:23:40,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 03:23:40,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-16 03:23:40,329 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 256 [2020-10-16 03:23:40,330 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 131 transitions, 1380 flow. Second operand 10 states. [2020-10-16 03:23:40,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 03:23:40,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 256 [2020-10-16 03:23:40,331 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 03:23:40,565 INFO L129 PetriNetUnfolder]: 117/769 cut-off events. [2020-10-16 03:23:40,565 INFO L130 PetriNetUnfolder]: For 2835/2836 co-relation queries the response was YES. [2020-10-16 03:23:40,572 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3175 conditions, 769 events. 117/769 cut-off events. For 2835/2836 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4811 event pairs, 3 based on Foata normal form. 4/763 useless extension candidates. Maximal degree in co-relation 2297. Up to 114 conditions per place. [2020-10-16 03:23:40,576 INFO L132 encePairwiseOnDemand]: 249/256 looper letters, 77 selfloop transitions, 40 changer transitions 0/172 dead transitions. [2020-10-16 03:23:40,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 172 transitions, 2020 flow [2020-10-16 03:23:40,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 03:23:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 03:23:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2129 transitions. [2020-10-16 03:23:40,580 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7560369318181818 [2020-10-16 03:23:40,581 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2129 transitions. [2020-10-16 03:23:40,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2129 transitions. [2020-10-16 03:23:40,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 03:23:40,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2129 transitions. [2020-10-16 03:23:40,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 03:23:40,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 03:23:40,588 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 03:23:40,588 INFO L185 Difference]: Start difference. First operand has 138 places, 131 transitions, 1380 flow. Second operand 11 states and 2129 transitions. [2020-10-16 03:23:40,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 172 transitions, 2020 flow [2020-10-16 03:23:40,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 172 transitions, 1674 flow, removed 124 selfloop flow, removed 14 redundant places. [2020-10-16 03:23:40,610 INFO L241 Difference]: Finished difference. Result has 139 places, 143 transitions, 1445 flow [2020-10-16 03:23:40,611 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1445, PETRI_PLACES=139, PETRI_TRANSITIONS=143} [2020-10-16 03:23:40,611 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 104 predicate places. [2020-10-16 03:23:40,611 INFO L481 AbstractCegarLoop]: Abstraction has has 139 places, 143 transitions, 1445 flow [2020-10-16 03:23:40,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 03:23:40,611 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 03:23:40,611 INFO L255 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2020-10-16 03:23:40,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-10-16 03:23:40,826 INFO L429 AbstractCegarLoop]: === Iteration 14 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 03:23:40,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 03:23:40,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1080051367, now seen corresponding path program 4 times [2020-10-16 03:23:40,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 03:23:40,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528996228] [2020-10-16 03:23:40,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 03:23:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:40,915 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 03:23:40,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528996228] [2020-10-16 03:23:40,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621156665] [2020-10-16 03:23:40,916 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-16 03:23:40,998 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-16 03:23:40,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-16 03:23:41,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-16 03:23:41,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-16 03:23:41,037 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 03:23:41,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-16 03:23:41,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2020-10-16 03:23:41,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508452905] [2020-10-16 03:23:41,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-16 03:23:41,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 03:23:41,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-16 03:23:41,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-16 03:23:41,042 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 256 [2020-10-16 03:23:41,043 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 143 transitions, 1445 flow. Second operand 13 states. [2020-10-16 03:23:41,043 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 03:23:41,043 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 256 [2020-10-16 03:23:41,044 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 03:23:41,311 INFO L129 PetriNetUnfolder]: 78/691 cut-off events. [2020-10-16 03:23:41,311 INFO L130 PetriNetUnfolder]: For 2286/2287 co-relation queries the response was YES. [2020-10-16 03:23:41,316 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 691 events. 78/691 cut-off events. For 2286/2287 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4311 event pairs, 0 based on Foata normal form. 4/688 useless extension candidates. Maximal degree in co-relation 2063. Up to 126 conditions per place. [2020-10-16 03:23:41,320 INFO L132 encePairwiseOnDemand]: 250/256 looper letters, 86 selfloop transitions, 32 changer transitions 0/174 dead transitions. [2020-10-16 03:23:41,320 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 174 transitions, 1927 flow [2020-10-16 03:23:41,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 03:23:41,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 03:23:41,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2569 transitions. [2020-10-16 03:23:41,324 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7719350961538461 [2020-10-16 03:23:41,324 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2569 transitions. [2020-10-16 03:23:41,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2569 transitions. [2020-10-16 03:23:41,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 03:23:41,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2569 transitions. [2020-10-16 03:23:41,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 03:23:41,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 03:23:41,332 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 03:23:41,332 INFO L185 Difference]: Start difference. First operand has 139 places, 143 transitions, 1445 flow. Second operand 13 states and 2569 transitions. [2020-10-16 03:23:41,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 174 transitions, 1927 flow [2020-10-16 03:23:41,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 174 transitions, 1879 flow, removed 10 selfloop flow, removed 4 redundant places. [2020-10-16 03:23:41,350 INFO L241 Difference]: Finished difference. Result has 149 places, 147 transitions, 1539 flow [2020-10-16 03:23:41,350 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1539, PETRI_PLACES=149, PETRI_TRANSITIONS=147} [2020-10-16 03:23:41,350 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 114 predicate places. [2020-10-16 03:23:41,351 INFO L481 AbstractCegarLoop]: Abstraction has has 149 places, 147 transitions, 1539 flow [2020-10-16 03:23:41,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-16 03:23:41,351 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 03:23:41,351 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 03:23:41,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-16 03:23:41,564 INFO L429 AbstractCegarLoop]: === Iteration 15 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 03:23:41,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 03:23:41,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1334498623, now seen corresponding path program 1 times [2020-10-16 03:23:41,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 03:23:41,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488160840] [2020-10-16 03:23:41,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 03:23:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:42,503 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2020-10-16 03:23:42,668 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2020-10-16 03:23:42,815 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2020-10-16 03:23:43,033 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2020-10-16 03:23:43,293 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 37 [2020-10-16 03:23:43,489 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2020-10-16 03:23:43,732 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2020-10-16 03:23:44,025 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2020-10-16 03:23:44,313 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2020-10-16 03:23:44,604 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2020-10-16 03:23:44,899 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2020-10-16 03:23:45,183 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2020-10-16 03:23:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 03:23:45,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488160840] [2020-10-16 03:23:45,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383216534] [2020-10-16 03:23:45,344 INFO L95 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 [2020-10-16 03:23:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 03:23:45,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 50 conjunts are in the unsatisfiable core [2020-10-16 03:23:45,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-16 03:23:45,621 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 03:23:45,622 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 297 treesize of output 307 [2020-10-16 03:23:45,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 2, 2, 2, 5, 2, 4, 1] term [2020-10-16 03:23:45,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 03:23:45,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 03:23:45,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 5, 2, 4, 1] term [2020-10-16 03:23:45,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 03:23:45,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 1] term [2020-10-16 03:23:45,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 03:23:45,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 4, 1] term [2020-10-16 03:23:45,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 03:23:45,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 1] term [2020-10-16 03:23:45,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 03:23:45,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2020-10-16 03:23:45,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 4, 2, 6, 2, 2, 3, 4, 2, 4, 1] term [2020-10-16 03:23:45,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 03:23:45,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 3, 2, 6, 2, 2, 3, 4, 2, 4, 1] term [2020-10-16 03:23:45,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 03:23:45,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 6, 2, 2, 3, 4, 2, 4, 1] term [2020-10-16 03:23:45,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 03:23:45,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 6, 2, 2, 3, 4, 2, 4, 1] term [2020-10-16 03:23:45,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 03:23:45,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 03:23:45,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,672 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 03:23:45,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 03:23:45,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 03:23:45,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,694 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 03:23:45,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 03:23:45,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 03:23:45,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,707 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 03:23:45,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 03:23:45,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,715 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 03:23:45,717 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 03:23:45,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 03:23:45,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,732 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 03:23:45,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 03:23:45,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 03:23:45,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,748 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 03:23:45,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 03:23:45,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,767 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 03:23:45,779 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 03:23:45,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 03:23:45,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,808 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 03:23:45,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 03:23:45,818 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-16 03:23:46,122 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 52 [2020-10-16 03:23:46,123 INFO L625 ElimStorePlain]: treesize reduction 4717, result has 1.6 percent of original size [2020-10-16 03:23:46,140 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-16 03:23:46,140 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-16 03:23:46,169 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 03:23:46,173 WARN L340 FreeRefinementEngine]: Global settings require throwing the following exception [2020-10-16 03:23:46,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-10-16 03:23:46,376 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: need array sort at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.arrayEquality(SmtUtils.java:760) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.binaryEquality(SmtUtils.java:663) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.checkEqualityStatusViaSolver(ArrayIndexEqualityManager.java:150) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.checkEqualityStatus(ArrayIndexEqualityManager.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:617) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:240) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:409) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:295) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:602) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:515) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:239) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:309) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:105) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-10-16 03:23:46,381 INFO L168 Benchmark]: Toolchain (without parser) took 25130.02 ms. Allocated memory was 251.1 MB in the beginning and 635.4 MB in the end (delta: 384.3 MB). Free memory was 205.9 MB in the beginning and 496.2 MB in the end (delta: -290.3 MB). Peak memory consumption was 428.1 MB. Max. memory is 14.2 GB. [2020-10-16 03:23:46,381 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 03:23:46,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.77 ms. Allocated memory was 251.1 MB in the beginning and 314.6 MB in the end (delta: 63.4 MB). Free memory was 205.9 MB in the beginning and 242.3 MB in the end (delta: -36.5 MB). Peak memory consumption was 37.0 MB. Max. memory is 14.2 GB. [2020-10-16 03:23:46,382 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.54 ms. Allocated memory is still 314.6 MB. Free memory was 242.3 MB in the beginning and 239.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 03:23:46,383 INFO L168 Benchmark]: Boogie Preprocessor took 57.24 ms. Allocated memory is still 314.6 MB. Free memory is still 237.3 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 03:23:46,383 INFO L168 Benchmark]: RCFGBuilder took 620.45 ms. Allocated memory is still 314.6 MB. Free memory was 237.3 MB in the beginning and 202.8 MB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 14.2 GB. [2020-10-16 03:23:46,384 INFO L168 Benchmark]: TraceAbstraction took 23575.61 ms. Allocated memory was 314.6 MB in the beginning and 635.4 MB in the end (delta: 320.9 MB). Free memory was 202.8 MB in the beginning and 496.2 MB in the end (delta: -293.3 MB). Peak memory consumption was 361.6 MB. Max. memory is 14.2 GB. [2020-10-16 03:23:46,386 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 800.77 ms. Allocated memory was 251.1 MB in the beginning and 314.6 MB in the end (delta: 63.4 MB). Free memory was 205.9 MB in the beginning and 242.3 MB in the end (delta: -36.5 MB). Peak memory consumption was 37.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 70.54 ms. Allocated memory is still 314.6 MB. Free memory was 242.3 MB in the beginning and 239.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 57.24 ms. Allocated memory is still 314.6 MB. Free memory is still 237.3 MB. There was no memory consumed. Max. memory is 14.2 GB. * RCFGBuilder took 620.45 ms. Allocated memory is still 314.6 MB. Free memory was 237.3 MB in the beginning and 202.8 MB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 23575.61 ms. Allocated memory was 314.6 MB in the beginning and 635.4 MB in the end (delta: 320.9 MB). Free memory was 202.8 MB in the beginning and 496.2 MB in the end (delta: -293.3 MB). Peak memory consumption was 361.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 4050 VarBasedMoverChecksPositive, 70 VarBasedMoverChecksNegative, 9 SemBasedMoverChecksPositive, 61 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 335 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.7s, 122 PlacesBefore, 35 PlacesAfterwards, 126 TransitionsBefore, 34 TransitionsAfterwards, 5744 CoEnabledTransitionPairs, 6 FixpointIterations, 20 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 5 ChoiceCompositions, 118 TotalNumberOfCompositions, 9349 MoverChecksTotal - ExceptionOrErrorResult: UnsupportedOperationException: need array sort de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: need array sort: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.arrayEquality(SmtUtils.java:760) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...