/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/VMCAI2021_PN.epf -i ../../../trunk/examples/concurrent/pthreads/forkFork.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 19:28:12,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 19:28:12,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 19:28:12,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 19:28:12,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 19:28:12,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 19:28:12,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 19:28:12,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 19:28:12,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 19:28:12,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 19:28:12,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 19:28:12,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 19:28:12,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 19:28:12,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 19:28:12,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 19:28:12,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 19:28:12,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 19:28:12,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 19:28:12,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 19:28:12,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 19:28:12,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 19:28:12,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 19:28:12,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 19:28:12,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 19:28:12,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 19:28:12,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 19:28:12,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 19:28:12,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 19:28:12,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 19:28:12,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 19:28:12,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 19:28:12,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 19:28:12,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 19:28:12,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 19:28:12,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 19:28:12,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 19:28:12,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 19:28:12,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 19:28:12,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 19:28:12,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 19:28:12,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 19:28:12,693 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-09 19:28:12,714 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 19:28:12,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 19:28:12,715 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 19:28:12,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 19:28:12,716 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 19:28:12,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 19:28:12,716 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 19:28:12,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 19:28:12,717 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 19:28:12,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 19:28:12,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 19:28:12,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 19:28:12,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 19:28:12,718 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 19:28:12,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 19:28:12,718 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 19:28:12,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 19:28:12,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 19:28:12,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 19:28:12,719 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 19:28:12,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 19:28:12,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 19:28:12,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 19:28:12,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 19:28:12,720 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 19:28:12,720 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 19:28:12,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 19:28:12,720 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 19:28:12,720 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 19:28:12,721 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 19:28:12,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 19:28:12,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 19:28:12,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 19:28:13,000 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 19:28:13,002 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 19:28:13,003 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/pthreads/forkFork.c [2020-10-09 19:28:13,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb10048b/7213ff68820c4dceb11af08cfc48b196/FLAG0aeea7082 [2020-10-09 19:28:13,486 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 19:28:13,486 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/concurrent/pthreads/forkFork.c [2020-10-09 19:28:13,486 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2020-10-09 19:28:13,487 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2020-10-09 19:28:13,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb10048b/7213ff68820c4dceb11af08cfc48b196/FLAG0aeea7082 [2020-10-09 19:28:13,884 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb10048b/7213ff68820c4dceb11af08cfc48b196 [2020-10-09 19:28:13,891 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 19:28:13,893 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 19:28:13,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 19:28:13,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 19:28:13,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 19:28:13,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 07:28:13" (1/1) ... [2020-10-09 19:28:13,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd3b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 07:28:13, skipping insertion in model container [2020-10-09 19:28:13,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 07:28:13" (1/1) ... [2020-10-09 19:28:13,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 19:28:13,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 19:28:14,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 19:28:14,169 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 19:28:14,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 19:28:14,200 INFO L208 MainTranslator]: Completed translation [2020-10-09 19:28:14,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 07:28:14 WrapperNode [2020-10-09 19:28:14,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 19:28:14,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 19:28:14,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 19:28:14,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 19:28:14,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 07:28:14" (1/1) ... [2020-10-09 19:28:14,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 07:28:14" (1/1) ... [2020-10-09 19:28:14,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 19:28:14,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 19:28:14,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 19:28:14,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 19:28:14,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 07:28:14" (1/1) ... [2020-10-09 19:28:14,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 07:28:14" (1/1) ... [2020-10-09 19:28:14,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 07:28:14" (1/1) ... [2020-10-09 19:28:14,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 07:28:14" (1/1) ... [2020-10-09 19:28:14,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 07:28:14" (1/1) ... [2020-10-09 19:28:14,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 07:28:14" (1/1) ... [2020-10-09 19:28:14,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 07:28:14" (1/1) ... [2020-10-09 19:28:14,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 19:28:14,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 19:28:14,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 19:28:14,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 19:28:14,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 07:28:14" (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-09 19:28:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-09 19:28:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 19:28:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure bar [2020-10-09 19:28:14,315 INFO L138 BoogieDeclarations]: Found implementation of procedure bar [2020-10-09 19:28:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2020-10-09 19:28:14,316 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2020-10-09 19:28:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 19:28:14,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 19:28:14,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-09 19:28:14,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-09 19:28:14,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-09 19:28:14,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 19:28:14,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 19:28:14,320 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 19:28:14,755 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 19:28:14,756 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-10-09 19:28:14,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 07:28:14 BoogieIcfgContainer [2020-10-09 19:28:14,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 19:28:14,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 19:28:14,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 19:28:14,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 19:28:14,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 07:28:13" (1/3) ... [2020-10-09 19:28:14,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@899841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 07:28:14, skipping insertion in model container [2020-10-09 19:28:14,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 07:28:14" (2/3) ... [2020-10-09 19:28:14,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@899841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 07:28:14, skipping insertion in model container [2020-10-09 19:28:14,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 07:28:14" (3/3) ... [2020-10-09 19:28:14,766 INFO L111 eAbstractionObserver]: Analyzing ICFG forkFork.c [2020-10-09 19:28:14,777 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 19:28:14,784 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 19:28:14,785 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 19:28:14,815 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#in~b.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,815 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#in~b.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,815 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,815 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,816 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,816 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,816 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,816 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,817 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,817 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,817 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,817 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,818 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,818 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,818 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,818 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,819 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,819 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,819 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,819 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,819 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,820 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,820 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,821 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,821 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,821 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,821 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,822 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#in~a.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,822 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#in~a.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,822 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,822 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,823 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,823 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,823 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,824 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,824 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,824 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,824 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,824 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,825 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,825 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,825 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,826 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,826 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,826 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,827 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,827 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,827 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,827 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,828 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,828 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,828 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,828 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,829 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,829 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,829 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,829 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,829 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,830 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,830 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,830 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,830 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,830 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,831 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,831 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,831 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,831 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,831 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,835 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,835 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,835 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,835 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,836 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,836 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,836 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,836 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,836 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,847 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,847 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,847 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,848 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,848 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,849 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,849 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,849 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,849 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,849 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,850 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,850 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,850 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,850 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,850 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,851 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,856 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,856 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,857 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,857 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,857 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,857 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,857 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,858 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,858 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 19:28:14,902 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-09 19:28:14,926 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 19:28:14,926 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 19:28:14,929 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 19:28:14,929 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 19:28:14,929 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 19:28:14,930 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 19:28:14,930 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 19:28:14,932 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 19:28:14,954 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 89 places, 83 transitions, 194 flow [2020-10-09 19:28:14,999 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-09 19:28:14,999 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2020-10-09 19:28:15,003 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 89 events. 2/89 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 98. Up to 5 conditions per place. [2020-10-09 19:28:15,004 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 83 transitions, 194 flow [2020-10-09 19:28:15,009 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 59 transitions, 139 flow [2020-10-09 19:28:15,020 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2020-10-09 19:28:15,020 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 19:28:15,020 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 19:28:15,021 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, 1] [2020-10-09 19:28:15,022 INFO L429 AbstractCegarLoop]: === Iteration 1 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT]=== [2020-10-09 19:28:15,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 19:28:15,028 INFO L82 PathProgramCache]: Analyzing trace with hash -202481228, now seen corresponding path program 1 times [2020-10-09 19:28:15,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 19:28:15,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766079058] [2020-10-09 19:28:15,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-09 19:28:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 19:28:15,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 39 conjunts are in the unsatisfiable core [2020-10-09 19:28:15,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 19:28:15,203 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-09 19:28:15,204 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:28:15,211 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:28:15,211 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:28:15,212 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-09 19:28:15,273 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:28:15,274 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-10-09 19:28:15,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 19:28:15,292 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:28:15,322 INFO L625 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2020-10-09 19:28:15,323 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:28:15,323 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2020-10-09 19:28:15,380 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-09 19:28:15,381 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:28:15,398 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:28:15,403 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 19:28:15,403 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2020-10-09 19:28:15,604 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:28:15,605 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-10-09 19:28:15,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 19:28:15,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 19:28:15,613 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:28:15,625 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:28:15,629 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 19:28:15,629 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2020-10-09 19:28:15,734 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-10-09 19:28:15,735 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:28:15,780 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:28:15,787 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-09 19:28:15,788 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-10-09 19:28:16,021 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-10-09 19:28:16,023 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:28:16,031 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:28:16,033 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:28:16,033 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-10-09 19:28:16,086 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-09 19:28:16,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 19:28:29,087 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 57 [2020-10-09 19:28:29,089 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-09 19:28:29,126 INFO L625 ElimStorePlain]: treesize reduction 27, result has 48.1 percent of original size [2020-10-09 19:28:29,133 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 19:28:29,134 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-09 19:28:29,135 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:25 [2020-10-09 19:28:29,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 19:28:29,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 19:28:31,264 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-09 19:28:31,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766079058] [2020-10-09 19:28:31,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 19:28:31,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 15] imperfect sequences [] total 27 [2020-10-09 19:28:31,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962130308] [2020-10-09 19:28:31,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-09 19:28:31,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 19:28:31,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-09 19:28:31,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=660, Unknown=20, NotChecked=0, Total=756 [2020-10-09 19:29:26,516 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 86 [2020-10-09 19:29:26,520 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 139 flow. Second operand 28 states. [2020-10-09 19:29:26,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 19:29:26,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 86 [2020-10-09 19:29:26,522 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 19:30:56,075 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-09 19:31:12,431 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-09 19:31:20,680 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-09 19:31:35,903 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-09 19:31:44,127 WARN L193 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 91 [2020-10-09 19:32:00,176 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-09 19:32:40,210 WARN L193 SmtUtils]: Spent 4.18 s on a formula simplification that was a NOOP. DAG size: 17 [2020-10-09 19:33:07,616 INFO L129 PetriNetUnfolder]: 192/565 cut-off events. [2020-10-09 19:33:07,616 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-09 19:33:07,619 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 565 events. 192/565 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2726 event pairs, 10 based on Foata normal form. 0/548 useless extension candidates. Maximal degree in co-relation 949. Up to 80 conditions per place. [2020-10-09 19:33:07,624 INFO L132 encePairwiseOnDemand]: 66/86 looper letters, 76 selfloop transitions, 36 changer transitions 0/139 dead transitions. [2020-10-09 19:33:07,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 139 transitions, 526 flow [2020-10-09 19:33:07,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-09 19:33:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-09 19:33:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1402 transitions. [2020-10-09 19:33:07,648 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.5822259136212624 [2020-10-09 19:33:07,649 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 1402 transitions. [2020-10-09 19:33:07,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 1402 transitions. [2020-10-09 19:33:07,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 19:33:07,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 1402 transitions. [2020-10-09 19:33:07,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 29 states. [2020-10-09 19:33:07,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 29 states. [2020-10-09 19:33:07,678 INFO L81 ComplementDD]: Finished complementDD. Result 29 states. [2020-10-09 19:33:07,681 INFO L185 Difference]: Start difference. First operand has 63 places, 59 transitions, 139 flow. Second operand 28 states and 1402 transitions. [2020-10-09 19:33:07,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 139 transitions, 526 flow [2020-10-09 19:33:07,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 139 transitions, 510 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-09 19:33:07,694 INFO L241 Difference]: Finished difference. Result has 90 places, 86 transitions, 292 flow [2020-10-09 19:33:07,697 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=292, PETRI_PLACES=90, PETRI_TRANSITIONS=86} [2020-10-09 19:33:07,698 INFO L341 CegarLoopForPetriNet]: 63 programPoint places, 27 predicate places. [2020-10-09 19:33:07,698 INFO L481 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 292 flow [2020-10-09 19:33:07,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-09 19:33:07,698 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 19:33:07,699 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, 1, 1, 1] [2020-10-09 19:33:07,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 19:33:07,914 INFO L429 AbstractCegarLoop]: === Iteration 2 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT]=== [2020-10-09 19:33:07,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 19:33:07,915 INFO L82 PathProgramCache]: Analyzing trace with hash -765314172, now seen corresponding path program 1 times [2020-10-09 19:33:07,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 19:33:07,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213540701] [2020-10-09 19:33:07,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-09 19:33:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 19:33:07,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 39 conjunts are in the unsatisfiable core [2020-10-09 19:33:07,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 19:33:07,974 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-09 19:33:07,974 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:33:07,976 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:33:07,976 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:33:07,977 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-09 19:33:08,009 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:33:08,010 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-10-09 19:33:08,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 19:33:08,013 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:33:08,029 INFO L625 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2020-10-09 19:33:08,030 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:33:08,030 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2020-10-09 19:33:08,056 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-09 19:33:08,057 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:33:08,067 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:33:08,069 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 19:33:08,069 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2020-10-09 19:33:08,149 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:33:08,150 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-10-09 19:33:08,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 19:33:08,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 19:33:08,154 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:33:08,163 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:33:08,165 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 19:33:08,165 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2020-10-09 19:33:08,240 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-10-09 19:33:08,241 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:33:08,253 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:33:08,257 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-09 19:33:08,257 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-10-09 19:33:08,471 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-10-09 19:33:08,473 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:33:08,482 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:33:08,483 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:33:08,483 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-10-09 19:33:08,544 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-09 19:33:08,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 19:33:10,104 WARN L838 $PredicateComparison]: unable to prove that (forall ((|fooThread1of1ForFork1_~#second_thread~0.offset| Int)) (= 5 (select (select (store |c_#memory_int| |c_fooThread1of1ForFork1_~#second_thread~0.base| (store (select |c_#memory_int| |c_fooThread1of1ForFork1_~#second_thread~0.base|) |fooThread1of1ForFork1_~#second_thread~0.offset| 0)) c_fooThread1of1ForFork1_~param~0.base) c_fooThread1of1ForFork1_~param~0.offset))) is different from false [2020-10-09 19:33:30,207 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2020-10-09 19:33:30,208 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-09 19:33:30,218 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:33:30,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 19:33:30,221 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-09 19:33:30,222 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:25 [2020-10-09 19:33:30,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 19:33:30,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 19:33:32,417 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-09 19:33:32,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213540701] [2020-10-09 19:33:32,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 19:33:32,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 15] imperfect sequences [] total 27 [2020-10-09 19:33:32,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467232926] [2020-10-09 19:33:32,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-09 19:33:32,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 19:33:32,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-09 19:33:32,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=618, Unknown=14, NotChecked=50, Total=756 [2020-10-09 19:33:33,268 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 86 [2020-10-09 19:33:33,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 292 flow. Second operand 28 states. [2020-10-09 19:33:33,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 19:33:33,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 86 [2020-10-09 19:33:33,270 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 19:33:35,423 WARN L193 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2020-10-09 19:34:08,048 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-09 19:34:26,376 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-09 19:34:44,769 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-09 19:35:03,305 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-09 19:35:21,888 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-09 19:35:57,093 INFO L129 PetriNetUnfolder]: 228/665 cut-off events. [2020-10-09 19:35:57,093 INFO L130 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2020-10-09 19:35:57,098 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 665 events. 228/665 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3439 event pairs, 17 based on Foata normal form. 4/649 useless extension candidates. Maximal degree in co-relation 1170. Up to 98 conditions per place. [2020-10-09 19:35:57,104 INFO L132 encePairwiseOnDemand]: 66/86 looper letters, 82 selfloop transitions, 38 changer transitions 0/147 dead transitions. [2020-10-09 19:35:57,105 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 147 transitions, 672 flow [2020-10-09 19:35:57,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-09 19:35:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-09 19:35:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1362 transitions. [2020-10-09 19:35:57,112 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.58656330749354 [2020-10-09 19:35:57,112 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 1362 transitions. [2020-10-09 19:35:57,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 1362 transitions. [2020-10-09 19:35:57,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 19:35:57,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1362 transitions. [2020-10-09 19:35:57,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 28 states. [2020-10-09 19:35:57,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 28 states. [2020-10-09 19:35:57,121 INFO L81 ComplementDD]: Finished complementDD. Result 28 states. [2020-10-09 19:35:57,121 INFO L185 Difference]: Start difference. First operand has 90 places, 86 transitions, 292 flow. Second operand 27 states and 1362 transitions. [2020-10-09 19:35:57,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 147 transitions, 672 flow [2020-10-09 19:35:57,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 147 transitions, 647 flow, removed 0 selfloop flow, removed 10 redundant places. [2020-10-09 19:35:57,129 INFO L241 Difference]: Finished difference. Result has 112 places, 94 transitions, 411 flow [2020-10-09 19:35:57,130 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=411, PETRI_PLACES=112, PETRI_TRANSITIONS=94} [2020-10-09 19:35:57,130 INFO L341 CegarLoopForPetriNet]: 63 programPoint places, 49 predicate places. [2020-10-09 19:35:57,130 INFO L481 AbstractCegarLoop]: Abstraction has has 112 places, 94 transitions, 411 flow [2020-10-09 19:35:57,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-09 19:35:57,131 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 19:35:57,131 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, 1, 1, 1] [2020-10-09 19:35:57,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 19:35:57,343 INFO L429 AbstractCegarLoop]: === Iteration 3 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT]=== [2020-10-09 19:35:57,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 19:35:57,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1311866268, now seen corresponding path program 2 times [2020-10-09 19:35:57,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 19:35:57,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756539857] [2020-10-09 19:35:57,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-09 19:35:57,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 19:35:57,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 19:35:57,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 39 conjunts are in the unsatisfiable core [2020-10-09 19:35:57,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 19:35:57,400 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-09 19:35:57,400 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:35:57,402 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:35:57,403 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:35:57,403 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-09 19:35:57,424 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:35:57,424 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-10-09 19:35:57,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 19:35:57,427 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:35:57,447 INFO L625 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2020-10-09 19:35:57,448 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:35:57,448 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2020-10-09 19:35:57,489 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-09 19:35:57,491 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:35:57,502 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:35:57,503 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 19:35:57,503 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2020-10-09 19:35:57,580 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:35:57,581 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-10-09 19:35:57,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 19:35:57,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 19:35:57,584 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:35:57,594 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:35:57,595 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 19:35:57,595 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2020-10-09 19:35:57,657 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-10-09 19:35:57,658 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:35:57,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:35:57,673 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-09 19:35:57,674 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-10-09 19:35:57,876 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-10-09 19:35:57,878 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:35:57,887 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:35:57,888 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:35:57,889 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-10-09 19:35:57,946 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-09 19:35:57,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 19:36:12,112 WARN L193 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 14 [2020-10-09 19:36:14,141 WARN L838 $PredicateComparison]: unable to prove that (forall ((|fooThread1of1ForFork1_~#second_thread~0.offset| Int)) (= (select (select (store |c_#memory_int| |c_fooThread1of1ForFork1_~#second_thread~0.base| (store (select |c_#memory_int| |c_fooThread1of1ForFork1_~#second_thread~0.base|) |fooThread1of1ForFork1_~#second_thread~0.offset| 0)) c_fooThread1of1ForFork1_~a.base) c_fooThread1of1ForFork1_~a.offset) 5)) is different from false [2020-10-09 19:36:24,536 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55 [2020-10-09 19:36:24,537 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:36:24,570 INFO L625 ElimStorePlain]: treesize reduction 25, result has 50.0 percent of original size [2020-10-09 19:36:24,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 19:36:24,573 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-09 19:36:24,573 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:25 [2020-10-09 19:36:24,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 19:36:24,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 19:36:26,921 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-09 19:36:26,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756539857] [2020-10-09 19:36:26,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 19:36:26,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 15] imperfect sequences [] total 27 [2020-10-09 19:36:26,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179731271] [2020-10-09 19:36:26,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-09 19:36:26,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 19:36:26,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-09 19:36:26,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=618, Unknown=13, NotChecked=50, Total=756 [2020-10-09 19:38:07,091 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 86 [2020-10-09 19:38:07,092 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 94 transitions, 411 flow. Second operand 28 states. [2020-10-09 19:38:07,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 19:38:07,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 86 [2020-10-09 19:38:07,093 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 19:38:46,702 WARN L193 SmtUtils]: Spent 544.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-10-09 19:38:47,398 INFO L129 PetriNetUnfolder]: 225/670 cut-off events. [2020-10-09 19:38:47,399 INFO L130 PetriNetUnfolder]: For 232/232 co-relation queries the response was YES. [2020-10-09 19:38:47,401 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1511 conditions, 670 events. 225/670 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3506 event pairs, 4 based on Foata normal form. 4/657 useless extension candidates. Maximal degree in co-relation 1324. Up to 148 conditions per place. [2020-10-09 19:38:47,404 INFO L132 encePairwiseOnDemand]: 68/86 looper letters, 51 selfloop transitions, 34 changer transitions 0/112 dead transitions. [2020-10-09 19:38:47,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 112 transitions, 613 flow [2020-10-09 19:38:47,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-09 19:38:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-09 19:38:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 936 transitions. [2020-10-09 19:38:47,409 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.572827417380661 [2020-10-09 19:38:47,409 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 936 transitions. [2020-10-09 19:38:47,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 936 transitions. [2020-10-09 19:38:47,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 19:38:47,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 936 transitions. [2020-10-09 19:38:47,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 20 states. [2020-10-09 19:38:47,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 20 states. [2020-10-09 19:38:47,416 INFO L81 ComplementDD]: Finished complementDD. Result 20 states. [2020-10-09 19:38:47,416 INFO L185 Difference]: Start difference. First operand has 112 places, 94 transitions, 411 flow. Second operand 19 states and 936 transitions. [2020-10-09 19:38:47,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 112 transitions, 613 flow [2020-10-09 19:38:47,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 112 transitions, 551 flow, removed 5 selfloop flow, removed 20 redundant places. [2020-10-09 19:38:47,428 INFO L241 Difference]: Finished difference. Result has 109 places, 93 transitions, 409 flow [2020-10-09 19:38:47,429 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=409, PETRI_PLACES=109, PETRI_TRANSITIONS=93} [2020-10-09 19:38:47,429 INFO L341 CegarLoopForPetriNet]: 63 programPoint places, 46 predicate places. [2020-10-09 19:38:47,429 INFO L481 AbstractCegarLoop]: Abstraction has has 109 places, 93 transitions, 409 flow [2020-10-09 19:38:47,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-09 19:38:47,429 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 19:38:47,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 19:38:47,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 19:38:47,650 INFO L429 AbstractCegarLoop]: === Iteration 4 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT]=== [2020-10-09 19:38:47,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 19:38:47,651 INFO L82 PathProgramCache]: Analyzing trace with hash -53602608, now seen corresponding path program 1 times [2020-10-09 19:38:47,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 19:38:47,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142531901] [2020-10-09 19:38:47,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-09 19:38:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 19:38:47,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-09 19:38:47,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 19:38:47,697 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-09 19:38:47,697 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:38:47,699 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:38:47,699 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:38:47,699 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-10-09 19:38:47,704 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-10-09 19:38:47,704 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:38:47,705 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:38:47,706 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:38:47,706 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-10-09 19:38:47,724 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-09 19:38:47,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 19:38:47,752 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-09 19:38:47,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142531901] [2020-10-09 19:38:47,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 19:38:47,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2020-10-09 19:38:47,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452510977] [2020-10-09 19:38:47,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 19:38:47,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 19:38:47,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 19:38:47,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-09 19:38:48,145 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 86 [2020-10-09 19:38:48,146 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 93 transitions, 409 flow. Second operand 7 states. [2020-10-09 19:38:48,146 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 19:38:48,146 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 86 [2020-10-09 19:38:48,146 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 19:38:48,234 INFO L129 PetriNetUnfolder]: 35/296 cut-off events. [2020-10-09 19:38:48,234 INFO L130 PetriNetUnfolder]: For 123/126 co-relation queries the response was YES. [2020-10-09 19:38:48,235 INFO L80 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 296 events. 35/296 cut-off events. For 123/126 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1273 event pairs, 9 based on Foata normal form. 1/279 useless extension candidates. Maximal degree in co-relation 467. Up to 66 conditions per place. [2020-10-09 19:38:48,236 INFO L132 encePairwiseOnDemand]: 79/86 looper letters, 18 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2020-10-09 19:38:48,237 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 100 transitions, 483 flow [2020-10-09 19:38:48,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 19:38:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-09 19:38:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 453 transitions. [2020-10-09 19:38:48,239 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.877906976744186 [2020-10-09 19:38:48,239 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 453 transitions. [2020-10-09 19:38:48,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 453 transitions. [2020-10-09 19:38:48,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 19:38:48,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 453 transitions. [2020-10-09 19:38:48,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-09 19:38:48,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-09 19:38:48,242 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-09 19:38:48,242 INFO L185 Difference]: Start difference. First operand has 109 places, 93 transitions, 409 flow. Second operand 6 states and 453 transitions. [2020-10-09 19:38:48,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 100 transitions, 483 flow [2020-10-09 19:38:48,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 100 transitions, 415 flow, removed 0 selfloop flow, removed 17 redundant places. [2020-10-09 19:38:48,251 INFO L241 Difference]: Finished difference. Result has 100 places, 97 transitions, 385 flow [2020-10-09 19:38:48,251 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=100, PETRI_TRANSITIONS=97} [2020-10-09 19:38:48,251 INFO L341 CegarLoopForPetriNet]: 63 programPoint places, 37 predicate places. [2020-10-09 19:38:48,252 INFO L481 AbstractCegarLoop]: Abstraction has has 100 places, 97 transitions, 385 flow [2020-10-09 19:38:48,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 19:38:48,252 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 19:38:48,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 19:38:48,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-09 19:38:48,464 INFO L429 AbstractCegarLoop]: === Iteration 5 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT]=== [2020-10-09 19:38:48,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 19:38:48,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1954931400, now seen corresponding path program 2 times [2020-10-09 19:38:48,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 19:38:48,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809292991] [2020-10-09 19:38:48,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-09 19:38:48,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 19:38:48,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 19:38:48,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 65 conjunts are in the unsatisfiable core [2020-10-09 19:38:48,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 19:38:48,537 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-09 19:38:48,538 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:38:48,541 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:38:48,542 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:38:48,542 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-09 19:38:48,579 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:38:48,579 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-09 19:38:48,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 19:38:48,582 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:38:48,586 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:38:48,587 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:38:48,587 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2020-10-09 19:38:48,734 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-09 19:38:48,735 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:38:48,740 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:38:48,740 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:38:48,741 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:15 [2020-10-09 19:38:48,803 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_23|, |v_#memory_$Pointer$.base_23|], 2=[|v_#memory_int_35|]} [2020-10-09 19:38:48,806 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09 19:38:48,807 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:38:48,817 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:38:48,820 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09 19:38:48,820 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-09 19:38:48,829 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:38:48,832 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-10-09 19:38:48,832 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-09 19:38:48,839 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:38:48,840 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:38:48,840 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:27 [2020-10-09 19:38:48,869 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-10-09 19:38:48,869 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:38:48,876 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:38:48,878 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-10-09 19:38:48,878 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-09 19:38:48,884 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:38:48,885 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:38:48,885 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2020-10-09 19:38:48,930 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-10-09 19:38:48,930 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:38:48,932 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:38:48,932 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:38:48,932 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-10-09 19:38:48,974 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-09 19:38:48,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 19:38:49,062 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 19:38:49,066 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:38:49,067 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 19:38:49,067 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:15 [2020-10-09 19:38:51,081 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#ret_val~0.offset| Int) (v_DerPreprocessor_1 Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#ret_val~0.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#ret_val~0.base|) |ULTIMATE.start_main_~#ret_val~0.offset| v_DerPreprocessor_1)) |c_ULTIMATE.start_main_#t~nondet8.base|) |c_ULTIMATE.start_main_#t~nondet8.offset|) 10)) is different from false [2020-10-09 19:38:53,089 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#ret_val~0.offset| Int) (v_DerPreprocessor_1 Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#ret_val~0.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#ret_val~0.base|) |ULTIMATE.start_main_~#ret_val~0.offset| v_DerPreprocessor_1)) |c_barThread1of1ForFork0_#res.base|) |c_barThread1of1ForFork0_#res.offset|) 10)) is different from false [2020-10-09 19:39:08,014 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2020-10-09 19:39:08,015 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:39:08,028 INFO L625 ElimStorePlain]: treesize reduction 7, result has 63.2 percent of original size [2020-10-09 19:39:08,032 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:39:08,033 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:4 [2020-10-09 19:39:10,296 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-09 19:39:10,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809292991] [2020-10-09 19:39:10,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 19:39:10,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 21] imperfect sequences [] total 39 [2020-10-09 19:39:10,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557501776] [2020-10-09 19:39:10,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-10-09 19:39:10,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 19:39:10,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-10-09 19:39:10,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1291, Unknown=10, NotChecked=146, Total=1560 [2020-10-09 19:39:12,436 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 86 [2020-10-09 19:39:12,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 97 transitions, 385 flow. Second operand 40 states. [2020-10-09 19:39:12,437 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 19:39:12,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 86 [2020-10-09 19:39:12,438 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 19:39:14,206 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-10-09 19:39:18,629 WARN L193 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-10-09 19:39:20,144 INFO L129 PetriNetUnfolder]: 449/1257 cut-off events. [2020-10-09 19:39:20,144 INFO L130 PetriNetUnfolder]: For 472/472 co-relation queries the response was YES. [2020-10-09 19:39:20,147 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3085 conditions, 1257 events. 449/1257 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 8003 event pairs, 206 based on Foata normal form. 2/1226 useless extension candidates. Maximal degree in co-relation 2699. Up to 582 conditions per place. [2020-10-09 19:39:20,153 INFO L132 encePairwiseOnDemand]: 53/86 looper letters, 163 selfloop transitions, 38 changer transitions 21/237 dead transitions. [2020-10-09 19:39:20,153 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 237 transitions, 1255 flow [2020-10-09 19:39:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-09 19:39:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-09 19:39:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1051 transitions. [2020-10-09 19:39:20,161 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.4073643410852713 [2020-10-09 19:39:20,161 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 1051 transitions. [2020-10-09 19:39:20,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 1051 transitions. [2020-10-09 19:39:20,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 19:39:20,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1051 transitions. [2020-10-09 19:39:20,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 31 states. [2020-10-09 19:39:20,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 31 states. [2020-10-09 19:39:20,170 INFO L81 ComplementDD]: Finished complementDD. Result 31 states. [2020-10-09 19:39:20,170 INFO L185 Difference]: Start difference. First operand has 100 places, 97 transitions, 385 flow. Second operand 30 states and 1051 transitions. [2020-10-09 19:39:20,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 237 transitions, 1255 flow [2020-10-09 19:39:20,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 237 transitions, 1250 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-09 19:39:20,184 INFO L241 Difference]: Finished difference. Result has 151 places, 117 transitions, 651 flow [2020-10-09 19:39:20,185 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=651, PETRI_PLACES=151, PETRI_TRANSITIONS=117} [2020-10-09 19:39:20,185 INFO L341 CegarLoopForPetriNet]: 63 programPoint places, 88 predicate places. [2020-10-09 19:39:20,185 INFO L481 AbstractCegarLoop]: Abstraction has has 151 places, 117 transitions, 651 flow [2020-10-09 19:39:20,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-10-09 19:39:20,186 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 19:39:20,186 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 19:39:20,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-09 19:39:20,405 INFO L429 AbstractCegarLoop]: === Iteration 6 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT]=== [2020-10-09 19:39:20,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 19:39:20,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1992057182, now seen corresponding path program 3 times [2020-10-09 19:39:20,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 19:39:20,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508032136] [2020-10-09 19:39:20,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-09 19:39:20,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-10-09 19:39:20,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 19:39:20,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 47 conjunts are in the unsatisfiable core [2020-10-09 19:39:20,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 19:39:20,464 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-09 19:39:20,465 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:39:20,466 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:39:20,466 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:39:20,466 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-09 19:39:20,483 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:39:20,483 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-09 19:39:20,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 19:39:20,487 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:39:20,489 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:39:20,489 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:39:20,489 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-10-09 19:39:20,609 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-09 19:39:20,609 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:39:20,623 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:39:20,623 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:39:20,623 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:12 [2020-10-09 19:39:20,685 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_28|], 2=[|v_#memory_int_41|]} [2020-10-09 19:39:20,688 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09 19:39:20,689 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:39:20,700 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:39:20,708 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09 19:39:20,708 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-09 19:39:20,718 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:39:20,722 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-10-09 19:39:20,723 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-09 19:39:20,730 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:39:20,731 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:39:20,731 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:24 [2020-10-09 19:39:20,759 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2020-10-09 19:39:20,759 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:39:20,765 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:39:20,768 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-10-09 19:39:20,768 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-09 19:39:20,771 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:39:20,772 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:39:20,772 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2020-10-09 19:39:20,811 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-10-09 19:39:20,812 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:39:20,818 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:39:20,819 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:39:20,819 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-10-09 19:39:20,861 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-09 19:39:20,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 19:39:20,898 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 19:39:20,900 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:39:20,901 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 19:39:20,901 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:15 [2020-10-09 19:39:22,914 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#ret_val~0.offset| Int) (v_DerPreprocessor_2 Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#ret_val~0.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#ret_val~0.base|) |ULTIMATE.start_main_~#ret_val~0.offset| v_DerPreprocessor_2)) |c_ULTIMATE.start_main_#t~nondet8.base|) |c_ULTIMATE.start_main_#t~nondet8.offset|) 10)) is different from false [2020-10-09 19:39:34,988 WARN L193 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 14 [2020-10-09 19:39:55,428 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 19:39:55,436 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2020-10-09 19:39:55,439 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:39:55,440 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:39:55,440 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:39:55,441 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:4 [2020-10-09 19:39:55,486 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-09 19:39:55,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508032136] [2020-10-09 19:39:55,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 19:39:55,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 21] imperfect sequences [] total 30 [2020-10-09 19:39:55,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324424663] [2020-10-09 19:39:55,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-10-09 19:39:55,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 19:39:55,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-10-09 19:39:55,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=780, Unknown=16, NotChecked=56, Total=930 [2020-10-09 19:39:55,915 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 86 [2020-10-09 19:39:55,916 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 117 transitions, 651 flow. Second operand 31 states. [2020-10-09 19:39:55,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 19:39:55,917 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 86 [2020-10-09 19:39:55,917 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 19:39:57,158 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-10-09 19:40:01,703 WARN L193 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-10-09 19:40:02,626 INFO L129 PetriNetUnfolder]: 434/1225 cut-off events. [2020-10-09 19:40:02,626 INFO L130 PetriNetUnfolder]: For 1469/1471 co-relation queries the response was YES. [2020-10-09 19:40:02,632 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4043 conditions, 1225 events. 434/1225 cut-off events. For 1469/1471 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7734 event pairs, 225 based on Foata normal form. 2/1198 useless extension candidates. Maximal degree in co-relation 3956. Up to 734 conditions per place. [2020-10-09 19:40:02,638 INFO L132 encePairwiseOnDemand]: 56/86 looper letters, 167 selfloop transitions, 36 changer transitions 21/239 dead transitions. [2020-10-09 19:40:02,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 239 transitions, 1671 flow [2020-10-09 19:40:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-09 19:40:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-09 19:40:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1037 transitions. [2020-10-09 19:40:02,642 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.40193798449612406 [2020-10-09 19:40:02,642 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 1037 transitions. [2020-10-09 19:40:02,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 1037 transitions. [2020-10-09 19:40:02,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 19:40:02,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1037 transitions. [2020-10-09 19:40:02,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 31 states. [2020-10-09 19:40:02,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 31 states. [2020-10-09 19:40:02,652 INFO L81 ComplementDD]: Finished complementDD. Result 31 states. [2020-10-09 19:40:02,652 INFO L185 Difference]: Start difference. First operand has 151 places, 117 transitions, 651 flow. Second operand 30 states and 1037 transitions. [2020-10-09 19:40:02,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 239 transitions, 1671 flow [2020-10-09 19:40:02,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 239 transitions, 1567 flow, removed 48 selfloop flow, removed 12 redundant places. [2020-10-09 19:40:02,666 INFO L241 Difference]: Finished difference. Result has 183 places, 133 transitions, 890 flow [2020-10-09 19:40:02,667 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=890, PETRI_PLACES=183, PETRI_TRANSITIONS=133} [2020-10-09 19:40:02,667 INFO L341 CegarLoopForPetriNet]: 63 programPoint places, 120 predicate places. [2020-10-09 19:40:02,667 INFO L481 AbstractCegarLoop]: Abstraction has has 183 places, 133 transitions, 890 flow [2020-10-09 19:40:02,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-10-09 19:40:02,668 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 19:40:02,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 19:40:02,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-09 19:40:02,879 INFO L429 AbstractCegarLoop]: === Iteration 7 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT]=== [2020-10-09 19:40:02,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 19:40:02,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1371807900, now seen corresponding path program 4 times [2020-10-09 19:40:02,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 19:40:02,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617739190] [2020-10-09 19:40:02,882 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-09 19:40:02,935 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-09 19:40:02,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 19:40:02,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 19:40:02,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 19:40:02,943 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-09 19:40:02,943 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:40:02,945 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:40:02,945 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:40:02,945 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-09 19:40:02,959 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:40:02,959 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-10-09 19:40:02,960 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:40:02,972 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-10-09 19:40:02,973 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 19:40:02,973 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2020-10-09 19:40:02,978 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-09 19:40:02,978 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:40:02,983 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:40:02,984 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:40:02,984 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2020-10-09 19:40:03,000 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:40:03,001 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-09 19:40:03,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 19:40:03,003 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:40:03,007 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:40:03,007 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:40:03,008 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2020-10-09 19:40:03,021 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-09 19:40:03,021 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:40:03,026 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:40:03,027 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 19:40:03,028 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-10-09 19:40:03,048 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-10-09 19:40:03,049 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:40:03,053 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:40:03,053 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:40:03,054 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-10-09 19:40:03,076 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-09 19:40:03,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 19:40:05,105 WARN L838 $PredicateComparison]: unable to prove that (forall ((|fooThread1of1ForFork1_~#second_thread~0.offset| Int)) (< 0 (select (select (store |c_#memory_int| |c_fooThread1of1ForFork1_~#second_thread~0.base| (store (select |c_#memory_int| |c_fooThread1of1ForFork1_~#second_thread~0.base|) |fooThread1of1ForFork1_~#second_thread~0.offset| 0)) |c_ULTIMATE.start_main_~#thread_id~0.base|) |c_ULTIMATE.start_main_~#thread_id~0.offset|))) is different from false [2020-10-09 19:40:05,168 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:40:05,173 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:40:05,174 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:40:05,174 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:5 [2020-10-09 19:40:07,174 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-09 19:40:07,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617739190] [2020-10-09 19:40:07,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 19:40:07,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2020-10-09 19:40:07,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320643407] [2020-10-09 19:40:07,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-09 19:40:07,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 19:40:07,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-09 19:40:07,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2020-10-09 19:40:07,565 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 86 [2020-10-09 19:40:07,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 133 transitions, 890 flow. Second operand 13 states. [2020-10-09 19:40:07,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 19:40:07,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 86 [2020-10-09 19:40:07,566 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 19:40:12,120 INFO L129 PetriNetUnfolder]: 264/1173 cut-off events. [2020-10-09 19:40:12,121 INFO L130 PetriNetUnfolder]: For 2566/2605 co-relation queries the response was YES. [2020-10-09 19:40:12,129 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3906 conditions, 1173 events. 264/1173 cut-off events. For 2566/2605 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 8633 event pairs, 53 based on Foata normal form. 6/1096 useless extension candidates. Maximal degree in co-relation 3829. Up to 309 conditions per place. [2020-10-09 19:40:12,134 INFO L132 encePairwiseOnDemand]: 75/86 looper letters, 104 selfloop transitions, 55 changer transitions 0/217 dead transitions. [2020-10-09 19:40:12,135 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 217 transitions, 1800 flow [2020-10-09 19:40:12,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-09 19:40:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-09 19:40:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 751 transitions. [2020-10-09 19:40:12,137 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.6237541528239202 [2020-10-09 19:40:12,137 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 751 transitions. [2020-10-09 19:40:12,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 751 transitions. [2020-10-09 19:40:12,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 19:40:12,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 751 transitions. [2020-10-09 19:40:12,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-09 19:40:12,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-09 19:40:12,140 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-09 19:40:12,140 INFO L185 Difference]: Start difference. First operand has 183 places, 133 transitions, 890 flow. Second operand 14 states and 751 transitions. [2020-10-09 19:40:12,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 217 transitions, 1800 flow [2020-10-09 19:40:12,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 217 transitions, 1718 flow, removed 39 selfloop flow, removed 11 redundant places. [2020-10-09 19:40:12,160 INFO L241 Difference]: Finished difference. Result has 178 places, 165 transitions, 1269 flow [2020-10-09 19:40:12,161 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1269, PETRI_PLACES=178, PETRI_TRANSITIONS=165} [2020-10-09 19:40:12,161 INFO L341 CegarLoopForPetriNet]: 63 programPoint places, 115 predicate places. [2020-10-09 19:40:12,161 INFO L481 AbstractCegarLoop]: Abstraction has has 178 places, 165 transitions, 1269 flow [2020-10-09 19:40:12,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-09 19:40:12,161 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 19:40:12,162 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 19:40:12,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-09 19:40:12,376 INFO L429 AbstractCegarLoop]: === Iteration 8 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT]=== [2020-10-09 19:40:12,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 19:40:12,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1848231896, now seen corresponding path program 5 times [2020-10-09 19:40:12,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 19:40:12,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382486112] [2020-10-09 19:40:12,377 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-09 19:40:12,429 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 19:40:12,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 19:40:12,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 19:40:12,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 19:40:12,437 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-09 19:40:12,438 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:40:12,439 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:40:12,439 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:40:12,440 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-09 19:40:12,453 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:40:12,454 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-10-09 19:40:12,455 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:40:12,466 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-10-09 19:40:12,466 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 19:40:12,466 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2020-10-09 19:40:12,471 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-09 19:40:12,471 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:40:12,475 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:40:12,475 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:40:12,475 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2020-10-09 19:40:12,488 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:40:12,489 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-09 19:40:12,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 19:40:12,491 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:40:12,495 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:40:12,496 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:40:12,496 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2020-10-09 19:40:12,507 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-09 19:40:12,507 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:40:12,512 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:40:12,513 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 19:40:12,513 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-10-09 19:40:12,554 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-10-09 19:40:12,555 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:40:12,559 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:40:12,560 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:40:12,560 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2020-10-09 19:40:12,576 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-09 19:40:12,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 19:40:18,635 WARN L193 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 13 [2020-10-09 19:40:18,721 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:40:18,726 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:40:18,727 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:40:18,727 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:5 [2020-10-09 19:40:20,525 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-09 19:40:20,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382486112] [2020-10-09 19:40:20,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 19:40:20,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2020-10-09 19:40:20,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065968197] [2020-10-09 19:40:20,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 19:40:20,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 19:40:20,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 19:40:20,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=141, Unknown=2, NotChecked=0, Total=182 [2020-10-09 19:42:18,068 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 86 [2020-10-09 19:42:18,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 165 transitions, 1269 flow. Second operand 14 states. [2020-10-09 19:42:18,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 19:42:18,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 86 [2020-10-09 19:42:18,068 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 19:42:18,487 INFO L129 PetriNetUnfolder]: 240/1133 cut-off events. [2020-10-09 19:42:18,487 INFO L130 PetriNetUnfolder]: For 3125/3166 co-relation queries the response was YES. [2020-10-09 19:42:18,494 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3839 conditions, 1133 events. 240/1133 cut-off events. For 3125/3166 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 8369 event pairs, 56 based on Foata normal form. 10/1066 useless extension candidates. Maximal degree in co-relation 3711. Up to 285 conditions per place. [2020-10-09 19:42:18,500 INFO L132 encePairwiseOnDemand]: 75/86 looper letters, 78 selfloop transitions, 54 changer transitions 0/191 dead transitions. [2020-10-09 19:42:18,500 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 191 transitions, 1682 flow [2020-10-09 19:42:18,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-09 19:42:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-09 19:42:18,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 556 transitions. [2020-10-09 19:42:18,502 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.6465116279069767 [2020-10-09 19:42:18,502 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 556 transitions. [2020-10-09 19:42:18,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 556 transitions. [2020-10-09 19:42:18,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 19:42:18,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 556 transitions. [2020-10-09 19:42:18,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-09 19:42:18,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-09 19:42:18,506 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-09 19:42:18,507 INFO L185 Difference]: Start difference. First operand has 178 places, 165 transitions, 1269 flow. Second operand 10 states and 556 transitions. [2020-10-09 19:42:18,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 191 transitions, 1682 flow [2020-10-09 19:42:18,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 191 transitions, 1661 flow, removed 7 selfloop flow, removed 2 redundant places. [2020-10-09 19:42:18,533 INFO L241 Difference]: Finished difference. Result has 188 places, 166 transitions, 1414 flow [2020-10-09 19:42:18,534 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1414, PETRI_PLACES=188, PETRI_TRANSITIONS=166} [2020-10-09 19:42:18,534 INFO L341 CegarLoopForPetriNet]: 63 programPoint places, 125 predicate places. [2020-10-09 19:42:18,534 INFO L481 AbstractCegarLoop]: Abstraction has has 188 places, 166 transitions, 1414 flow [2020-10-09 19:42:18,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 19:42:18,534 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 19:42:18,535 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 19:42:18,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-09 19:42:18,737 INFO L429 AbstractCegarLoop]: === Iteration 9 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, barErr0ASSERT_VIOLATIONASSERT]=== [2020-10-09 19:42:18,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 19:42:18,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1396938195, now seen corresponding path program 1 times [2020-10-09 19:42:18,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 19:42:18,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558215439] [2020-10-09 19:42:18,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-10-09 19:42:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 19:42:18,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-09 19:42:18,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 19:42:18,803 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-09 19:42:18,803 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:42:18,804 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:42:18,804 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:42:18,805 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-09 19:42:18,823 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:42:18,824 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-10-09 19:42:18,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 19:42:18,826 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:42:18,847 INFO L625 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2020-10-09 19:42:18,847 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:42:18,847 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2020-10-09 19:42:18,860 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09 19:42:18,860 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:42:18,866 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:42:18,866 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:42:18,866 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2020-10-09 19:42:18,919 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:42:18,920 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-10-09 19:42:18,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 19:42:18,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 19:42:18,922 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:42:18,928 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:42:18,929 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:42:18,929 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2020-10-09 19:42:18,957 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-09 19:42:18,958 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:42:18,965 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:42:18,966 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 19:42:18,967 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-10-09 19:42:19,090 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2020-10-09 19:42:19,090 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:42:19,103 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:42:19,109 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 19:42:19,109 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:43, output treesize:22 [2020-10-09 19:42:19,151 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-10-09 19:42:19,152 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 19:42:19,159 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 19:42:19,160 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 19:42:19,160 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2020-10-09 19:42:19,185 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-09 19:42:19,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 19:42:21,234 WARN L838 $PredicateComparison]: unable to prove that (forall ((barThread1of1ForFork0_~c~0.offset Int) (|barThread1of1ForFork0_#t~mem1| Int)) (< c_barThread1of1ForFork0_thidvar0 (select (select (store |c_#memory_int| c_barThread1of1ForFork0_~c~0.base (store (select |c_#memory_int| c_barThread1of1ForFork0_~c~0.base) barThread1of1ForFork0_~c~0.offset (+ |barThread1of1ForFork0_#t~mem1| 5))) |c_ULTIMATE.start_main_~#thread_id~0.base|) |c_ULTIMATE.start_main_~#thread_id~0.offset|))) is different from false [2020-10-09 19:42:42,765 WARN L193 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 21 [2020-10-09 19:42:44,771 WARN L838 $PredicateComparison]: unable to prove that (forall ((barThread1of1ForFork0_~c~0.offset Int) (|barThread1of1ForFork0_#t~mem1| Int) (|fooThread1of1ForFork1_~#second_thread~0.offset| Int)) (< 0 (select (select (let ((.cse0 (store |c_#memory_int| |c_fooThread1of1ForFork1_~#second_thread~0.base| (store (select |c_#memory_int| |c_fooThread1of1ForFork1_~#second_thread~0.base|) |fooThread1of1ForFork1_~#second_thread~0.offset| 0)))) (store .cse0 c_fooThread1of1ForFork1_~a.base (store (select .cse0 c_fooThread1of1ForFork1_~a.base) barThread1of1ForFork0_~c~0.offset (+ |barThread1of1ForFork0_#t~mem1| 5)))) |c_ULTIMATE.start_main_~#thread_id~0.base|) |c_ULTIMATE.start_main_~#thread_id~0.offset|))) is different from false Received shutdown request... [2020-10-09 19:42:51,129 WARN L210 SmtUtils]: Removed 1 from assertion stack [2020-10-09 19:42:51,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-09 19:42:51,330 WARN L546 AbstractCegarLoop]: Verification canceled [2020-10-09 19:42:51,336 WARN L235 ceAbstractionStarter]: Timeout [2020-10-09 19:42:51,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 07:42:51 BasicIcfg [2020-10-09 19:42:51,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 19:42:51,338 INFO L168 Benchmark]: Toolchain (without parser) took 877445.78 ms. Allocated memory was 251.7 MB in the beginning and 324.0 MB in the end (delta: 72.4 MB). Free memory was 206.2 MB in the beginning and 175.4 MB in the end (delta: 30.8 MB). Peak memory consumption was 103.1 MB. Max. memory is 14.2 GB. [2020-10-09 19:42:51,338 INFO L168 Benchmark]: CDTParser took 1.30 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 19:42:51,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.83 ms. Allocated memory was 251.7 MB in the beginning and 314.6 MB in the end (delta: 62.9 MB). Free memory was 206.2 MB in the beginning and 288.7 MB in the end (delta: -82.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 14.2 GB. [2020-10-09 19:42:51,339 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.27 ms. Allocated memory is still 314.6 MB. Free memory was 288.7 MB in the beginning and 286.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 19:42:51,339 INFO L168 Benchmark]: Boogie Preprocessor took 23.66 ms. Allocated memory is still 314.6 MB. Free memory was 286.2 MB in the beginning and 283.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 19:42:51,340 INFO L168 Benchmark]: RCFGBuilder took 493.27 ms. Allocated memory is still 314.6 MB. Free memory was 283.7 MB in the beginning and 261.1 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 14.2 GB. [2020-10-09 19:42:51,340 INFO L168 Benchmark]: TraceAbstraction took 876577.93 ms. Allocated memory was 314.6 MB in the beginning and 324.0 MB in the end (delta: 9.4 MB). Free memory was 261.1 MB in the beginning and 175.4 MB in the end (delta: 85.8 MB). Peak memory consumption was 95.2 MB. Max. memory is 14.2 GB. [2020-10-09 19:42:51,342 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 306.83 ms. Allocated memory was 251.7 MB in the beginning and 314.6 MB in the end (delta: 62.9 MB). Free memory was 206.2 MB in the beginning and 288.7 MB in the end (delta: -82.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 39.27 ms. Allocated memory is still 314.6 MB. Free memory was 288.7 MB in the beginning and 286.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 23.66 ms. Allocated memory is still 314.6 MB. Free memory was 286.2 MB in the beginning and 283.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 493.27 ms. Allocated memory is still 314.6 MB. Free memory was 283.7 MB in the beginning and 261.1 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 876577.93 ms. Allocated memory was 314.6 MB in the beginning and 324.0 MB in the end (delta: 9.4 MB). Free memory was 261.1 MB in the beginning and 175.4 MB in the end (delta: 85.8 MB). Peak memory consumption was 95.2 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19). Cancelled while CegarLoopForPetriNet was analyzing trace of length 42 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 25 for 0ms.. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 45). Cancelled while CegarLoopForPetriNet was analyzing trace of length 42 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 25 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 69 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: TIMEOUT, OverallTime: 876.4s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 702.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 262 SDtfs, 1894 SDslu, 5500 SDs, 0 SdLazy, 6536 SolverSat, 293 SolverUnsat, 207 SolverUnknown, 0 SolverNotchecked, 368.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 664 GetRequests, 363 SyntacticMatches, 8 SemanticMatches, 293 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 1629 ImplicationChecksByTransitivity, 268.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1414occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 139.3s InterpolantComputationTime, 275 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 534 ConstructedInterpolants, 102 QuantifiedInterpolants, 159929 SizeOfPredicates, 164 NumberOfNonLiveVariables, 935 ConjunctsInSsa, 249 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown